An Infinite Knight's Tour

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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


Snapshots


Details

Inspired by the "Open Knight's Tour–'To Infinity & Beyond!'" at Knight's Tour Art.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send