A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly 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 exact number of open tours on an 8x8 chessboard is still unknown.
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.
Read more about Knight's Tour: Theory, History, Number of Closed Tours, Which Boards Have Tours
Famous quotes containing the words knight and/or tour:
“Nae living man I’ll love again,
Since that my lovely knight is slain.
Wi ae lock of his yellow hair
I’ll chain my heart for evermair.”
—Unknown. The Lament of the Border Widow (l. 25–28)
“Do you know I believe that [William Jennings] Bryan will force his nomination on the Democrats again. I believe he will either do this by advocating Prohibition, or else he will run on a Prohibition platform independent of the Democrats. But you will see that the year before the election he will organize a mammoth lecture tour and will make Prohibition the leading note of every address.”
—William Howard Taft (1857–1930)