Insects walking down the grid
Each square of a grid of 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?
The answer is 11.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!