Spreading points in a rectangle · n = 11
Place n points inside a 2 × 1 rectangle, maximizing the smallest distance between any two of them.
Formal definition
- ContainerThe container is a 2 × 1 rectangle, with the origin (0, 0) at its lower-left corner and (2, 1) at its upper-right.
- SubmissionExactly n points, no two coinciding
- ConstraintsEvery point lies inside the container or on its boundary
- ObjectiveMake the smallest pairwise distance as large as possible; compared internally by its square, exactly