Strategical Game with 2010 coins in a pile
Source: JBMO Shortlist 2010 Problem C1 (Combinatorics #1)
January 25, 2015
combinatorics unsolvedcombinatorics
Problem Statement
There are two piles of coins, each containing pieces. Two players and play a game taking turns ( plays first). At each turn, the player on play has to take one or more coins from one pile or exactly one coin from each pile. Whoever takes the last coin is the winner. Which player will win if they both play in the best possible way?