The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other.

The 8-queens problems asks us to place 8 queens on a chessboard so that no two can capture one another; that is, no two are on the same row, column, or diagonal.

8Queens Game in Python

8 Queens problem with walls and different scores for each square solved with backtracking and forward check

Using two powerful local search algorithms to find a solution for the popular 8-queen problem.