Ian and Mike play a game where they start with a pile of n stones where 1 <= n <= 100. They take turns removing stones from the pile with Mike going first. On a turn, they are allowed to remove exactly 2, exactly 3, or exactly 4 stones from the pile. A player loses the game if they are unable to make a legal move. Determine all n for which Mike has a winning strategy.
Hi Expert, I believe the expert that answered this was misunderstood, the winner is the person who cannot make a legal move after the previous player pulls a number of stones, e.g N=5, if mike pulls 2 stones he loses as Ian can pull 3 and win, though if mike pulls 3 or 4 stones he wins. Can we update the solution accordingly?