knight's tour

(classic problem)

Definition: A series of moves of a chess knight that visits all squares on the board exactly once.

See also Hamiltonian cycle.

Note: The associated problem is to find such a series of moves. The problem can be generalized to an n × m rectangular chess board. Solutions may be found using backtracking.

Author: PEB


Oleg Kiselyov's derivation (Prolog)

More information

Dan Thomasson's Knight's Tour page, with application to prime numbers, tour on a cube's face, etc.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 6 June 2005.
HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:
Paul E. Black, "knight's tour", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 6 June 2005. (accessed TODAY) Available from: