olymmath

DK-GEORGMOHR 2016 Problem 4

    Alma and Bertha play the following game. There are 100100 round, 200200 triangular and 200200 square pieces on a table. In each move a player must remove two pieces, but it cannot be a triangle and a square. Alma starts, and one loses if one is unable to move or if there are no pieces left when it is one's turn. Which player has a winning strategy?

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: Georg Mohr Contest 2016 official paper, page 1.

    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 dk-georgmohr/2016/p4 · Tag TNSZMNWMS6 · Edit this page on GitHub · Keys: j next, k previous