Template:POTD/2010-12-31
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 depicted tour is an open tour, with shaded squares denoting where the knight has already visited.Animation: Ilmari Karonen