Sep 01 2009

The Knight’s Tour

The knight’s tour is an ancient puzzle, the object of which is to visit every square on a chessboard exactly once with a knight. It’s a somewhat famous puzzle because it was performed by the Mechanical Turk, and is used as an example in various computer science courses. There are two types of tour, Open and Closed. In a Closed tour, the knight returns to the first square it started from. In an Open tour it does not. The game calculates a score based on how long you took, and a multiplier based on the type of tour you complete.

You may play here or on Whirled. (The Whirled version will give you a trophy for completing either type of tour.) Depending on how much chess you may have played, you may find this puzzle difficult or extremely easy.

Read more »