USAMO 2021 Problem 3
- Day 1
- Difficulty band 8
Let be an integer. An board is initially empty. Each minute, you may perform one of three moves:
- If there is an L-shaped tromino region of three cells without stones on the board (see figure; rotations not allowed), you may place a stone in each of those cells.
- If all cells in a column have a stone, you may remove all stones from that column.
- If all cells in a row have a stone, you may remove all stones from that row.
For which is it possible that, after some non-zero number of moves, the board has no stones?
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.