$5$ rooks are placed on a $5$ by $5$ chessboard in such a way that no two rooks attack each other. How can I prove that there exists a $2$ by $2$ square on the chessboard which does not contain any of the rooks?
(A rook is defined to attack another rook if they are in the same row or column.)
I've noticed that a $5$ by $5$ chessboard can contain four $2$ by $2$ squares, but that doesn't prove anything.
One of the rooks must be in the bottom row, e.g.
Focus on the column this rook is in and one of the neighboring columns. If the neighboring rook is in the top or next to top row, there is a $2 \times 2$ empty square on the second and third rows, such as the following case:
Otherwise, the neighboring rook is in the second or third row and there is a $2 \times 2$ square in the fourth and fifth rows, such as the following case: