Jump to content

Knight's tour

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 202.37.72.100 (talk) at 15:51, 25 February 2002. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Basic Idea: A chess knight has to make 63 consecutive knight moves on an empty chess board and thereby visit each square once.

Extensions: Many variations on this topic have been studied during the centuries:

  • differently sized boards
  • two-player games based on this idea
  • problems using slight variations on the way the knight moves.

External links

Retrieved from "https://en.wikipedia.org/w/index.php?title=Knight%27s_tour&oldid=79572"