Problem Section #4 a) There is a $6 * 6$ grid, each square filled with a grasshopper. After the bell rings, each grasshopper jumps to an adjacent square (A square that shares a side). What is the maximum number of empty squares possible?
Source: Nepal Mathematics Olympiad
Tags: geometry
Problem Section #4 a) There is a $6 * 6$ grid, each square filled with a grasshopper. After the bell rings, each grasshopper jumps to an adjacent square (A square that shares a side). What is the maximum number of empty squares possible?