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.

About 3 min6 interactive slides · 5 questionsLesson 406 · Zone 46

Play this lesson

Free to play in your browser or on iPhone

More in this zone

  1. 407Programming ConceptsThe Recursion MirrorA problem can be solved by a smaller copy of itself
  2. 408Group TheoryRubik's Cube: 43 Quintillion PositionsEvery position can be solved in 20 moves or fewer
  3. 409Mobile NetworksThe Invisible HandoffYour phone changes towers mid-call without you noticing
  4. 410Digital ImagingDitheringHow old images faked colors they didn't have
  5. 411Game AIDeep Blue vs KasparovIn 1997 a computer beat the world chess champion
  6. 412Game AIMove 37AlphaGo played a move experts called a mistake, and it won
  7. 413Matching MarketsThe Matchmaking Algorithm That Won a NobelIt places doctors in hospitals and students in schools
  8. 414Additive ManufacturingThe 3D-Printed LatticeEmpty space can make a part lighter without making it weaker