olymmath

KöMaL 2025 B5494

    Anna and Béla plays the following game on a 2×20262\times 2026 board. They take turns to place dominoes on the board until no new domino can be placed on the board. If the board is fully covered, the winner is Anna, otherwise Béla is the winner. Who has a winning strategy, if Anna is the first player? (A domino covers two adjacent squares on the board. The dominoes cannot extend beyond the edges of the board and cannot overlap each other.)

    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/2025/b5494 · Tag CJFFYHYPNX · Edit this page on GitHub · Keys: j next, k previous