Games, decision theory and puzzles
Three heaps of Nim, part 3 of 3
AdvancedNumeric answer
Three heaps of Nim · Part 3 of 3
Two players alternately remove any positive number of stones from one heap. Whoever takes the last stone wins. The heaps start at 3, 4 and 5.
Before play starts you may add a fourth heap of any size so that the first player loses. What size must it be?
Answer with a number. Fractions, powers and expressions like 23/6 or C(52,5) are read correctly in practice.
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Report an issue with this question
Learn the method
More games, decision theory and puzzles questions
- What does the Sprague–Grundy theorem say about impartial games under normal play?Expert · Premium
- Twenty-one matches, players alternate taking one, two or three, and whoever…Foundation · Premium
- Nim with piles of 3, 4 and 5: you move first and the player taking the last counter wins.Applied · Premium
- Twenty counters are on the table.Advanced · Premium
- In Chomp, players alternately bite a square from a rectangular chocolate bar…Advanced · Premium
- You roll a fair die and may re-roll once, keeping the second value if you do.Applied · Free solution