The Knight’s Tour

Find a sequence of knight moves that visits every square of an N×N chessboard exactly once (a Hamiltonian path/cycle in the knight-move graph), typically from a given starting square. The problem requires search/backtracking with pruning or heuristics (e.g., Warnsdorff’s rule) to construct a valid tour or report none exists.