A body to describe the N-Queens problem and its solution.
Move a knight across a chessboard visiting every square exactly once. Watch algorithms solve this classic problem using backtracking and heuristics.