TOT 2000 Spring AJ4 100 coins game
Source:
May 10, 2020
combinatoricsgamegame strategy
Problem Statement
Give and Take divide coins between themselves as follows. In each step, Give chooses a handful of coins from the heap, and Take decides who gets this handful. This is repeated until all coins have been taken, or one of them has handfuls. In the latter case, the other gets all the remaining coins. What is the largest number of coins that Give can be sure of getting no matter what Take does?(A Shapovalov)