Spreading points in a quadrant · n = 9
Place n points inside a quadrant (quarter-disc) of radius 1, maximizing the smallest distance between any two of them.
Formal definition
- ContainerThe container is a quarter-disc of radius 1: centred at the origin (0, 0), with its straight edges along the axes from 0 to 1 and the arc in the first quadrant.
- 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