An Infinite Knight's Tour

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.

THINGS TO TRY

SNAPSHOTS

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

DETAILS

Inspired by the "Open Knight's Tour–'To Infinity & Beyond!'" at Knight's Tour Art.
    • 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.