Putnam 1995 B5
- Session B
A game starts with four heaps of beans, containing 3,4,5 and 6 beans. The two players move alternately. A move consists of taking either
a) one bean from a heap, provided at least two beans are left behind in that heap, or
b) a complete heap of two or three beans.
The player who takes the last heap wins. To win the game, do you want to move first or second? Give a winning strategy.
Curated text Kedlaya Putnam archive. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.