Difference between revisions of "2021 USAMO Problems/Problem 3"

Line 4: Line 4:
 
[*] If all cells in a column have a stone, you may remove all stones from that column.
 
[*] 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.
 
[*] If all cells in a row have a stone, you may remove all stones from that row.
[/list]
+
\begin{asy}
 
[asy]
 
[asy]
 
unitsize(20);
 
unitsize(20);
Line 12: Line 12:
 
draw((0,2)--(4,2));
 
draw((0,2)--(4,2));
 
draw((2,4)--(2,0));
 
draw((2,4)--(2,0));
[/asy]
+
\end{asy}
 
For which <math>n</math> is it possible that, after some non-zero number of moves, the board has no stones?
 
For which <math>n</math> is it possible that, after some non-zero number of moves, the board has no stones?

Revision as of 06:19, 18 July 2021

Let $n \geq 2$ be an integer. An $n \times n$ board is initially empty. Each minute, you may perform one of three moves: [list] [*] 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. Unknown environment 'asy' For which $n$ is it possible that, after some non-zero number of moves, the board has no stones?