IL-GILLIS 2019 Problem 2
We are given a 5x5 square grid, divided to 1x1 tiles. Two tiles are called linked if they lie in the same row or column, and the distance between their centers is 2 or 3. For example, in the picture the gray tiles are the ones linked to the red tile.
Sammy wants to mark as many tiles in the grid as possible, such that no two of them are linked. What is the maximal number of tiles he can mark?
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.