Ride the knight.
Visit every square once.
A knight's tour is the most famous puzzle on the board: move the horse so it lands on all 64 squares without ever repeating one. It is 1,200 years old, it hides inside a Sanskrit poem, and it is still hard. How far can you get?
Pick your gauntlet
Every mode is a complete game on its own. Start with a small tour, then go for a full 64-square run, a closed loop, or a 60-second sprint.
♞ Tour
The classic. Visit every square exactly once on a 5×5 up to 8×8 board. Add a timer or switch it off and think in peace. Try a closed tour to loop back to the start.
⚡ Rush
Sixty seconds of pure pattern-hunting. Collect as many distinct squares as you can before the clock stops; the path resets whenever you run out of legal hops. Chase your high score.
🎯 Path
Start at one square, reach the starred square in the shortest number of knight moves. Scored against the true optimum, so perfection is possible every time.
🏆 Campaign
Twenty hand-built levels that climb from a gentle five-by-five hop to a full grandmaster gauntlet. Earn up to three stars per level; your progress is saved.
💡 Hints that teach
Stuck? The hint system uses Warnsdorff's 1823 rule — jump to the square with the fewest onward moves — the same trick computers still use to tour huge boards.
🔗 Share the challenge
Every finished game produces a link that replays the exact same starting square, so a friend can attempt your tour — or your score — from their own phone.
The tour is older than chess itself
The earliest known knight's tour is hidden in a 9th-century Sanskrit poem, the Kavyalankara, as a poetic figure called turagapadabandha — “arrangement in the steps of a horse”. The reader moves through the syllables the way a knight moves through squares.
26,534,728,821,064
That is how many directed closed tours a standard 8×8 board contains — and there are 19,591,828,170,979,904 tours of all kinds. Mathematicians counted them; you just have to find one.