olymmath

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

Human solution Solution 1 by Kiran Kedlaya

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/1995/b5 · Tag 15VPMAV5W4 · Edit this page on GitHub · Keys: j next, k previous