The classic Orchard planting problem asks for the maximum number of 3-point straight lines attainable from a configuration of $n$ points drawn on a plane.
Here we are interested in a variant of this problem. What is the maximum number of squares attainable from a configuration of 10 points drawn on a plane? Each corner of an attained square must contain a point.
Here is a similar puzzle for circles: Orchard planting problem for circles