FROM THE LIFE CATALOG
The 1901 Harvard paper that solved Nim with binary arithmetic
VERIFIEDANALYSISTASTE
What it is
Three piles of counters. On your turn, take as many as you like, one or the whole pile, but from one pile only; whoever takes the last counter wins. Charles L. Bouton of Harvard published the complete winning method in the Annals of Mathematics (volume 3, 1901 to 1902) and proposed the name Nim. Write each pile in binary, line up the columns, and if every column adds to an even number you hold a safe combination. Leave one on the table and, with correct play, you win. His example: 9, 5 and 12. He noted forms of the game were played at a number of American colleges and fairs, where it had been called Fan-Tan.
Why it survived
The whole strategy fits in one rule you can check with a pencil, which makes it the rare game where the math and the fun arrive at the same moment.
Start here
Set out piles of 9, 5 and 12 coins, Bouton's own safe example, and let a friend move first; after each of their moves, restore even columns and watch the last coin come to you.
Nim is the best five-minute introduction to binary numbers for a ten-year-old and a grandparent at the same table. It turns an abstract rule about even columns into a win you can feel, which a worksheet can't.
GAME, far shelf: the primary paper, Bouton's 1901 to 1902 Annals of Mathematics article. Outside the loop.