ISL 1994 C6
Two players play alternatively on an infinite square grid. The first player puts an in an empty cell and the second player puts an in an empty cell. The first player wins if he gets adjacent 's in a line - horizontally, vertically or diagonally. Show that the second player can always prevent the first 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.