Wiktionary
n. 1 A sequence of positions on a chess board, which sequence includes each square precisely once, and where successive positions are a knight's move away from one another. 2 A similar sequence on a board of any size or shape.
Wikipedia
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.
The 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) boards.
Usage examples of "knight's tour".
So that on a board 4 by 4 we can neither describe a knight's tour nor a complete knight's path.
McCann said now, 'Solitary, seeking diversion, I discovered the intricate delights of the knight's tour.