The objective of the Eight Queens puzzle is to place eight chess queens on an 8×8 chessboard so that no two queens threaten each other. This means no two queens may share the same row, column, or diagonal.

There are exactly 92 distinct solutions to the 8 Queens problem. Factoring out rotations and reflections, there are 12 fundamental unique solutions.

Systematic backtracking is the standard algorithm. For human solvers, placing queens column by column while avoiding existing row and diagonal attack vectors, and adjusting previous placements when a conflict arises, is the most effective heuristic.