Knight’s Tour: How a Knight Visits
Every Square Once
A knight’s tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once. The exact number of open tours on an 8×8 chessboard is still unknown.
Creating a program to find a knight’s tour is a common problem given to computer science students. Variations of the knight’s tour problem involve chessboards of different sizes than the usual 8 × 8, as well as irregular (non-rectangular) boards.