(38 Views)

**Problem Statement:** Place n-queens in n x n chessboard so that no two of them can attack each other i.e no two of them are on the same row, column or diagonal. In this problem backtracking is done to solve the problem. solutions of this problems are expressed in n-tuple.

In the above algorithm,

- For the n queen problem we take input of n, lets say n=4 so, k=1,2,3,4.
- For placing the first queen i.e k=1,we start a loop for n columns i.e n=4 so till the fourth column.
- The first queen can be placed at first column only.
- Then we move for the second queen and place it seeing that the first queen is not in the same column or in diagonal with the second queen.
- Similarly, the third queen and the fourth queen are placed. But if the fourth queen cannot be placed as it lies in same column or is in diagonal with other queens then back-tracking is done to the previous queens inorder of 3,2,1 to achieve the unique feasible solution.
- For an n problem queen the same way all the n queens are placed and if the n
^{th}cannot be placed back-tracking is done and the queens are re-ordered and solution is obtained.

0 UpvotesUpvote |
0 DownvotesDownvote |

- Add jar file in your Maven local repository using command line [259 Views]
- Download DIGITAL SIGNAL PROCESSING by Ashok Ambardar PDF [535 Views]
- Flowchart and Algorithm for Converting Infix to Postfix notation [214 Views]
- Top Project Management Platforms Every Business Team should Know - Slack, Zoho, Teamwork Projects [694 Views]
- 0/1 Knapsack problem with solution [2479 Views]

- Knuth-Morris-Pratt (KMP) Substring Search Algorithm with Java Example [10126 Views]
- Algorithm to find whether number is Armstrong Number or Not [9474 Views]
- How To Win Ludo King Game Every Time [9415 Views]
- error: Multiple commands produce error in Xcode 10 [5659 Views]
- FlowChart and Algorithm to find Whether a Number is Even or Odd [5123 Views]