Knight's tour

A knight's tour is a set of moves of a knight on a chessboard. The knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is "closed", otherwise it is "open".
The knight's tour problem is the mathematical problem of finding a knight's tour. Making 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 , as well as irregular (non-rectangular) boards.