The Knight's Tour

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.

THINGS TO TRY

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

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

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.