Knight's tour
A knight's tour is a set of moves of a knight on a chessboard. 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. Making a program to find a knight's tour is a common problem given to computer science students.[1] Variations of the knight's tour problem involve chessboards of different sizes than the usual 8 × 8, as well as irregular (non-rectangular) boards.
Knight's Tour Media
An animation of an open knight's tour on a 5 × 5 board
Knight's graph showing all possible paths for a knight's tour on a standard 8 × 8 chessboard. The numbers on each node indicate the number of possible moves that can be made from that position.
The knight's tour as solved by the Turk, a chess-playing machine hoax. This particular solution is closed (circular), and can thus be completed from any point on the board.
A semimagic square (its diagonals do not sum to its magic constant, 260) also forming a knight's tour – no fully magic tours exist
A radially symmetric closed knight's tour
A very large (130 × 130) square open knight's tour created using Warnsdorff's Rule
Closed knight's tour on a 24 × 24 board solved by a neural network
References
- ↑ Deitel, H. M.; Deitel, P. J. (2003). Java How To Program Fifth Edition (5th ed.). Prentice Hall. pp. 326–328. ISBN 978-0131016217.
