There are 21 squares whose vertices are four points in the diagram.
What is the minimum number of points that must be removed so that none of these squares remain?
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.
If the six white dots are removed then no squares remain. It can be shown that the each of the 21 squares contains at least one of these points.