Spreading points in an L · n = 13
Place n points inside an L (a 2 × 2 square with its top-right 1 × 1 removed), maximizing the smallest distance between any two of them.
Formal definition
- ContainerThe container is a square of side 2 with its top-right 1 × 1 quarter removed: the origin (0, 0) is its lower-left corner and the missing piece is where x and y are both greater than 1.
- 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