Who wins the take-1-to-3 game from 1000 stones
Question
A pile of stones sits between two players. On each turn a player removes , or stones, and whoever removes the final stone wins. Assuming perfect play, which player is favoured: the one who moves first or the one who moves second?
Short answer
The second player. Facing a multiple of is a losing position: whatever stones the mover takes, the opponent takes and restores a multiple of 4. Since is divisible by , the second player keeps the count at multiples of 4 and takes the last stone.
Adapted from OpenQuant; question and answer rewritten by SelfMadeQuant.com.
See the hint and the full worked solution in the question bank (free account).
Open the worked solutionLessons behind this question
- Sample Spaces, Events, and the Probability Axioms
- Conditional Probability, Total Probability, and Bayes' Rule
Start with a free lesson: Probability Fundamentals is part of a free topic. Create a free account, no card needed, to read it in full with worked solutions.
Read it free