Knight's Tour Game is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. The knight's tour problem is the mathematical problem of finding a knight's tour. Knight's graph showing all possible paths for a knight's tour on a 9¡Á9 chessboard. You start from any cell of the grid, and then you make an "L" shaped move from the previous one.