In an alternate form of the game of Nim, as in the example given in this section, there are two piles with n coins in each pile. As before, each player in turn must remove at least one coin from just one of the two piles, but in this version, the last player to remove a coin loses. Prove that for all n ≥ 2, Player 2 has a winning strategy for this game.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.