Question 10
A chess horse attacks fields at distance $\sqrt{5}$. Let several horses be put on the board $12 \times 12$ such that every square of size $2 \times 2$ contains at least one horse. Find the maximal possible number of cells that are not under attack (a horse doesn't attack its own cell).
