4

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

Dmitry Kamenetsky
  • 35,897
  • 5
  • 66
  • 276

1 Answers1

3

May not be optimal but the best I can seem to get is

$7$ squares

With the following arrangement

enter image description here
That is, four of side length $1$, one of side length $2$ and two of side length $\sqrt{2}$.

hexomino
  • 135,910
  • 10
  • 384
  • 563