[2901 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 in order 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.

Our Quiz prepared by Experts Helps you identify your knowledge in Algorithms. Everyone should atleast attempt this Quiz Once.

- Prefix to Infix notation Algorithm and Flowchart
- Algorithm and Flowchart for Postfix to Infix Notation
- Algorithm and Flowchart to Count no. of Vowels, Consonants and Special Character in a string
- Algorithm and Flowchart to Swap Two Integer Numbers
- Algorithm and Flowchart to Calculate Fibonacci series up to n