The 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 knight moves that visits each square exactly once. Start by placing the knight anywhere on the board, then drag the step slider to see a knight's tour, either as a broken line path or by numbering the squares in order.

Contributed by: Jay Warendorff (September 2018)
Open content licensed under CC BY-NC-SA


Details

Based on and extending a program at Knight's tour.


Snapshots



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