olymmath

NL-NWO 2006 Problem 5

    Player AA and player BB play the next game on an 88 by 88 square chessboard. They in turn color a field that is not yet colored. One player uses red and the other blue. Player AA starts. The winner is the first person to color the four squares of a square of 22 by 22 squares with his color somewhere on the board. Prove that player BB can always prevent player AA from winning.

    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 nl-nwo/2006/p5 · Tag WZ9ZGXMAJ1 · Edit this page on GitHub · Keys: j next, k previous