International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE)
The N-queens Problem is an extension of the original 8-queens problem. The problem requires one to find the placement of N queens on an NXN chessboard such that no queen is attacking the other. In this paper, the authors discuss a new pattern observed while finding a unique solution to the famous N-Queens problem of placing N queens on an n X n chessboard such that none attacks the other. The basic idea for finding the solution for an n X n board is to apply the results of its preceding board, i.e., (n-1) X (n-1) board. The line of symmetry within a solution has also been explained and used to complete a solution from a half known solution.