Question 12
Initially each square of a $3\times3$ board contains one grasshopper. All grasshoppers simultaneously jump to an adjacent square. Several may land in the same square. What is the greatest possible number of empty squares after the jumps?
(Two squares are adjacent if they share an edge.)
(Two squares are adjacent if they share an edge.)