3 piles with matches, 100, 200, 300, winning strategy wanted
Source: All Russian MO 1994 ARO
July 29, 2018
game strategygameStrategycombinatorics
Problem Statement
There are three piles of matches on the table: one with matches, one with , and one with . Two players play the following game. They play alternatively, and a player on turn removes one of the piles and divides one of the remaining piles into two nonempty piles. The player who cannot make a legal move loses. Who has a winning strategy?(K. Kokhas’)