Counting the Winning Nim Moves
Four piles of Nim contain 17, 26, 39 and 52 stones. Two players alternate; a move removes any positive number of stones from a single pile, and whoever takes the last stone wins (normal play). Two first moves are different if they act on different piles or remove different numbers of stones. How many first moves leave the opponent in a losing position? Give an integer.
Related problems & prerequisites
Worth solving first
- Nim 3-4-5 6.0/10
Source: Bouton's analysis of Nim (1901). Statement written for AxiomIQ.