Mind-Bending Math & GamesGame Theory
Nim
A matchstick game with a secret binary strategy
Three piles of matches, two players, simple rules. A hidden binary trick picks the winning move. Can you find it?
You'll find out
- What makes a position a loser?
- How does binary pick the move?
- Who solved the game in 1901?
Why it matters
Nim showed that a simple binary rule can solve a whole family of games, long before computers.
Play this lesson
Free to play in your browser or on iPhone