An Infinite Knight's Tour
Initializing live version
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
A classic chess problem is to find a sequence of moves for a knight to land on every square exactly once. With a knight initially positioned at the center of an infinite chess board, drag the slider to see a portion of an infinite knight's tour, either as a broken line path or by numbering the squares in order. You can change the size of the displayed portion of the board.
Contributed by: Jay Warendorff (March 2011)
Open content licensed under CC BY-NC-SA
Details
Inspired by the "Open Knight's Tour–'To Infinity & Beyond!'" at Knight's Tour Art.
Snapshots
Permanent Citation