MathDB
2 piles of cards, one with n cards and the other with m cards

Source: 2005 Cuba MO 1.3

September 15, 2024
combinatoricswinning strategy

Problem Statement

There are two piles of cards, one with nn cards and the other with mm cards. AA and BB play alternately, performing one of the following actions in each turn. following operations: a) Remove a card from a pile. b) Remove one card from each pile. c) Move a card from one pile to the other. Player AA always starts the game and whoever takes the last one letter wins . Determine if there is a winning strategy based on mm and nn, so that one of the players following her can win always.