Problem #WSP-000473

Problems Discrete Mathematics Algorithm Theory Game theory Winning and loosing positions

Problem

Adi and Maxim play a game. There are \(100\) sweets in a bowl, and they each take in turns to take either \(2\), \(3\) or \(4\) sweets. Whoever cannot take any more sweets (since the bowl is empty, or there’s only \(1\) left) loses.

Maxim goes first - who has the winning strategy?