Each square of a grid of \(11 \times 11\) has an insect. Each insect walks to another square which share one vertex (exactly) with the square where was the insect at the beginning. Some square could be empty and others with more than one insect.

What is the minimum number of squares that could be empty?

×

Problem Loading...

Note Loading...

Set Loading...