olymmath

CAPS 2022 Problem 1

    Let k≤2022k \leq 2022 be a positive integer. Alice and Bob play a game on a 2022×20222022 \times 2022 board. Initially, all cells are white. Alice starts and the players alternate. In her turn, Alice can either color one white cell in red or pass her turn. In his turn, Bob can either color a k×kk \times k square of white cells in blue or pass his turn. Once both players pass, the game ends and the person who colored more cells wins (a draw can occur). For each 1≤k≤20221 \leq k \leq 2022 , determine which player (if any) has a winning 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 caps/2022/p1 · Tag D8FNGTB7BX · Edit this page on GitHub · Keys: j next, k previous