MathDB
parameters guaranteeing a winning strategy (Serbia MO 2005 1st Grade P4)

Source:

April 11, 2021
gamecombinatorics

Problem Statement

There are cc red, pp blue, and bb white balls on a table. Two players AA and BB play a game by alternately making moves. In every move, a player takes two or three balls from the table. Player AA begins. A player wins if after his/her move at least one of the three colors no longer exists among the balls remaining on the table. For which values of c,p,bc,p,b does player AA have a winning strategy?