A knight's tour is a sequence of moves of a knight on a chessboard such that 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. A knight's tour problem is the mathematical problem of finding a knight's tour. 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) board.
While Brandon was on vacation, he steadily began to master the game theory involving chess. But when he was introduced to the knights tour, he realized this new level of expertise had more involvement than anything he encountered before.
by yyuryyubicuryy4me June 27, 2018