OMCC 2005 Problem 4
- Day 2
Two players, Red and Blue, play in alternating turns on a 10x10 board. Blue goes first. In his turn, a player picks a row or column (not chosen by any player yet) and color all its squares with his own color. If any of these squares was already colored, the new color substitutes the old one.
The game ends after 20 turns, when all rows and column were chosen. Red wins if the number of red squares in the board exceeds at least by 10 the number of blue squares; otherwise Blue wins.
Determine which player has a winning strategy and describe this 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.
Similar problems
These problems have the most words in common with this statement.