[−][src]Module dancing_links::queens
The n queens puzzle
is the problem of placing n chess queens on an n×n chessboard so that
no two queens threaten each other.
A solution to the problem requires that no two queens share the same row, column, or diagonal.
Structs
| NQueens | An instance of the |
| Possibility | A position on the chess board. |
Enums
| Constraint | A condition which must be satisfied in order to solve an |