Solving 4 queen problem using backtracking
Assume Queen i is to be placed in row i. All solution to 4 queen problems can be represented as 4 tuples (x1, x2, x3, x4), Where xi is the column in which queen i is to be placed.
Bounding Function: if (x1, …….. xi) is the path to the current node, then all children nodes with parent-child labeling xi+1 are such that (x1, …….. Xi+1) represents a chessboard configuration in which no two queens are attacking.
Explicit Constrain: Si ={1, 2, 3, 4}
Implicit constrain: No two xi can be the same and no two queens can be on the same diagonal.
The backtracking technique to solve n queen problem is explained here in the following video
• The n queen problem and backtracking algor...
To know more join my Udemy course on Design and Analysis of Algorithm
https://www.udemy.com/course/algorith...