MathDB

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 (a)

\text{either}

one bean from a heap, provided at least two beans are left behind in that heap, (b)

\text{or}

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.

Problem Statement