Spreading points in a circle · n = 13
Place n points inside a circle of radius 1, maximizing the smallest distance between any two of them.
Formal definition
- ContainerA circle of radius 1 centred at (1, 1), so both coordinates run from 0 to 2
- SubmissionExactly n points, no two coinciding
- ConstraintsEvery point lies inside the circle or on it
- ObjectiveMake the smallest pairwise distance as large as possible; compared internally by its square, exactly