Question 957 – Nielit Scientist-B IT 4-12-2016

N-Queen problem:​ an arrangement of N queens on a chess board, such that no queen can attack any other queens on the board.The chess queens can attack in any direction as horizontal, vertical, horizontal and diagonal way. A binary matrix is used to display the
positions of N Queens, where no queens can attack other queens.

Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate (“backtracks”) as soon as
it determines that the candidate cannot possibly be completed to a valid solution.