NL-NWO 2006 Problem 5
Player and player play the next game on an by square chessboard. They in turn color a field that is not yet colored. One player uses red and the other blue. Player starts. The winner is the first person to color the four squares of a square of by squares with his color somewhere on the board. Prove that player can always prevent player 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.
Similar problems
These problems have the most words in common with this statement.