N-Queens

The N-Queens problem is a classic demonstration of constraint programming. The goal is to place queens on a chessboard such that no two queens attack one another. This problem is well suited to CSPs because validity checks are computationally inexpensive, and the problem exhibits significant symmetry, allowing large portions of the search space to be safely pruned. The animations below show depth-first backtracking searches for various board sizes.