Jumping Foxes
Every Red Fox must jump to an adjacent square (left, right, up or down).
What is the largest number of squares that could become completely empty?
Show solution
A solid first strategy is to have every fox in rows 1, 3 & 5 jump up or down, and the row 2 & 4 foxes simply jump sideways.
That empties rows 1, 3 & 5 completely: 15 squares.
But it turns out there's a nifty way to get one more empty square, like this:
