The Knight's Tour is a mathematical problem involving a knight on a chessboard. The knight is placed on the empty board and, moving according to the rules of chess, must visit each square exactly once. A knight's tour is called a closed tour if the knight ends on a square attacking the square from which it began (so that it may tour the board again immediately with the same path). Otherwise the tour is open. The exact number of open tours is still unknown. Creating a program to solve the 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.

http://en.wikipedia.org/wiki/Knight%27s_tour

Cool!

I remember Koltanowski doing this blinfolded with the names of cities in each square.  He looked at the board for several minutes and then turned his back to it.  Some one gave him the name of one of the cities and using that as a starting point he made the tour, naming each city on the landing square.

MAGIC ,,,,,,,,,,,,, OF THE KINGHT,