IL-GROSSMAN 1995 Problem 2
Two players play a game on an infinite board that consists of unit squares. Player chooses a square and marks it with . Then player chooses another square and marks it with . They play until one of the players marks a whole row or a whole column of five consecutive squares, and this player wins the game. If no player can achieve this, the result of the game is a tie. Show that player can 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.