Problem #PRU-35429

Problems Discrete Mathematics Algorithm Theory Game theory Symmetric strategies

Problem

There are two stacks of coins on a table: in one of them there are 30 coins, and in the other – 20. You can take any number of coins from one stack per move. The player who cannot make a move is the one that loses. Which player wins with the correct strategy?