About this site

Why a knight's tour?

Every October, on the second Saturday, the United States marks National Chess Day — a day first proclaimed by President Gerald Ford in 1976. For 2026 that is 10 October. Instead of a chess engine or a news page, we built the oldest, purest chess puzzle there is: move a knight so it visits every square exactly once.

It needs no opponent and no prior chess knowledge, yet it is genuinely hard, endlessly replayable, and more than a thousand years old. It is also a real piece of mathematics — the Hamiltonian path problem in disguise — with a history that runs from Sanskrit poetry to Deep Blue.

What's inside

🎮 The game

Four modes — Tour, Rush, Path and a 20-level Campaign — with a Warnsdorff hint solver, undo, timers, saved bests and shareable challenge links.

📚 Learn

How the knight moves, the strategy behind Warnsdorff's rule, and the exact mathematics of when tours exist and how many there are.

🕰️ History

A timeline from chaturanga and Rudrata's poem to Euler, the Turk, Perec and the modern online chess boom.

🧠 Quiz

Thirty-two questions that take you from Beginner to Grandmaster, with an explanation after every answer.

How it was built

Knight's Gauntlet is a single static site — plain HTML, CSS and JavaScript with no backend, no trackers and no accounts. The board, the knight logic, the hints and the path scoring all run in your browser.

Sources

Facts and numbers on this site were drawn from the following references.

Knight's Gauntlet is an independent, non-commercial project and is not affiliated with any chess organisation. Content is original; no third-party art or code is bundled.

Go ride

Sixty-four squares. Sixty-three moves. One horse.

▶ Play Knight's Gauntlet