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.