-
- It is possible to place a Knight on any square of a chessboard and then, in 64 moves have him visit every square once and only once. Write a program to find such a Knight's Tour.
-
- Variations:
- The Knight's Journey: Write a program that will determine the longest journey a Knight may travel without crossing his path. Use the program to find the length of the longest journey on a board with three, four, and five rows and columns.