/nqueens-solver

Solving the N-Queens problem by Backtracking with Forward Checking (FC) and Minimum Remaining Value (MRV)

Primary LanguagePython

What is the N-queens problem?

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

Here we can see that none of the 4 queens are on the same row, column, or diagonal.