Louise and James are playing a game with a pile of 15 coins. Each player alternates the turns by removing 1, 2 or 3 coins from the pile. Loses the game who remove the last coin. James start the game. If both play optimally, who have the winning strategy?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
James takes 2 coins on his first move, leaving 1 3 for Louise.
When Louise takes k ∈ { 1 , 2 , 3 } coins, James can respond by taking 4 − k ∈ { 1 , 2 , 3 } coins, leaving 1 3 − k − ( 4 − k ) = 1 3 − 4 = 9 coins for Louise. Then repeating this, Louise will have 5 coins on her next turn, and 1 coin on the turn after that, forcing Louise to take the last coin and making her lose.
Therefore James has the winning strategy.