MathDB
11 empty boxes and a pile of stones (2017 Auckland MO S4)

Source:

November 15, 2021
combinatoricsgamewinning strategy

Problem Statement

There are 1111 empty boxes and a pile of stones. Two players play the following game by alternating moves: In one move a player takes 1010 stones from the pile and places them into boxes, taking care to place no more than one stone in any box. The winner is the player after whose move there appear 2121 stones in one of the boxes for the first time. If a player wants to guarantee that they win the game, should they go first or second? Explain your reasoning.