Question

solve the N-Queens Problem and focus on the incremental formulation in which we add a queen to any square in the leftmost empty column that is not attacked by any other queen.
*Does Simulated Annealing -SA- (with 10 iterations) solve the 14-Queens Problem? What about SA (with 50 iterations). Show your answer.

*please I just need explanation and the steps not java or c++ code program .

Answer 1

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. For example, following is a solution for 4 Queen problem.

Here we places Queen in the 2nd left box and adding other queens which ensures no attack between the queen.

This means that we can solve using SA. The iteration steps will be based upon the number of boxes you select here there is a 4*4 matrix.

The expected output is a binary matrix which has 1s for the blocks where queens are placed. For example, following is the output matrix for above 4 queen solution.

          1st step-->    { 0,  1,  0,  0}
          2nd step-->    { 0,  0,  0,  1}
          3rd step-->    { 1,  0,  0,  0}
          4th step-->    { 0,  0,  1,  0}