olymmath

KöMaL 2006 B3926

    Ann and Bob are playing the following game: There are 10 heaps of pebbles in front of them. The first heap contains 1 pebble, the second one contains 2, the third one contains 3, and so on, the tenth heap contains 10 pebbles. They take turns in carrying out one of the following two moves: they either divide a heap into two smaller ones or remove one pebble from one heap. A player who cannot do so any more will lose the game. Determine which player has a winning strategy, given that Ann starts the game.

    Official text KöMaL. 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 hu-komal/2006/b3926 · Tag SAX9307WQ0 · Edit this page on GitHub · Keys: j next, k previous