Y by
Alice and Bob play a game. Initially, they write the pair
on the board. They alternate their turns with Alice going first. In each turn the player can turn the pair
to either
or
as long as the resulting pair has only nonnegative values. The game terminates, when there is no legal move possible. Alice wins if the game terminates at
and Bob wins if the game terminates at
. Determine who has the winning strategy?
Proposed by Shashank Ingalagavi and Krutarth Shah






Proposed by Shashank Ingalagavi and Krutarth Shah