Mind-Bending Math & GamesPuzzles
The Knight's Tour
Can a knight visit every square exactly once?
A chess knight hops in an L. Can it land on all 64 squares without landing anywhere twice? Most tries get stuck.
You'll find out
- Why are corners so dangerous?
- What simple rule finishes the tour?
- Why not just try every path?
Why it matters
Some problems are too big to search. A good rule of thumb, a heuristic, can still find an answer fast.
Play this lesson
Free to play in your browser or on iPhone