olymmath

IT-CESENATICO 1999 Problem 4

    Albert and Barbara play the following game. On a table there are 19991999 sticks, and each player in turn removes some of them: at least one stick, but at most half of the currently remaining sticks. The player who leaves just one stick on the table loses the game. Barbara moves first. Decide which player has a winning strategy and describe that strategy.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator it-cesenatico/1999/p4 · Tag F1XYJJHKMJ · Edit this page on GitHub · Keys: j next, k previous