The most famous problem of this type is Eight queens puzzle.

Finding all solutions to the eight queens puzzle is a good example of a simple but nontrivial problem.

The eight queens puzzle has 92 distinct solutions.

The eight queens puzzle is a challenge to arrange eight queens on the board so that none can capture any of the others.

He recalled how he once assigned Mr. Ma to solve a classic chess problem called the eight queens puzzle.

Classic combinatorial search problems include solving the eight queens puzzle or evaluating moves in games with a large game tree, such as reversi or chess.

The eight queens puzzle is the problem of placing eight chess queens on an 8x8 chessboard so that no two queens attack each other.

Since then, many mathematicians, including Carl Friedrich Gauss, have worked on both the eight queens puzzle and its generalized n-queens version.

For instance, the eight queens puzzle has 92 solutions; to solve it using answer set programming, we encode it by a logic program with 92 stable models.

A brute-force approach for the eight queens puzzle would examine all possible arrangements of 8 pieces on the 64-square chessboard, and, for each arrangement, check whether each (queen) piece can attack any other.

The eight queens puzzle is an example of the more general n-queens problem of placing n queens on an nxn chessboard, where solutions exist for all natural numbers n with the exception of 2 and 3.

There are 240 distinct solutions of the Soma cube puzzle, excluding rotations and reflections: these are easily generated by a simple recursive backtracking search computer program similar to that used for the eight queens puzzle.