Question 62
Antonio and Bernardo play the following game: they are given two stacks of tokens, one with $m$ tokens and the other with $n$ tokens. Each player takes turns choosing one of the following moves:
- take a token from one of the piles;
- take a token from each of the piles;
- move a token from one pile to another.
Whoever can no longer move loses. Antonio begins. Determine, based on $m$ and $n$, whether one of the two players has a winning strategy, and if so, specify which player it is.
- take a token from one of the piles;
- take a token from each of the piles;
- move a token from one pile to another.
Whoever can no longer move loses. Antonio begins. Determine, based on $m$ and $n$, whether one of the two players has a winning strategy, and if so, specify which player it is.