Spreading points in an annulus · n = 11
Place n points inside an annulus with outer radius 1 and inner radius 0.5 so that the minimum distance between any two points is as large as possible.
Record comparison
the smallest distance between two points · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | — | — | No reference listed |
| Site record | No player record yet | — | — |
Formal definition
- ContainerAn annulus centered at (1, 1) with outer radius 1 and inner radius 0.5 (i.e. 0.5 ≤ ‖p − (1, 1)‖ ≤ 1, with the central disk of radius 0.5 removed)
- SubmissionExactly n distinct points
- ConstraintsEvery point must lie inside the container or on its boundary
- Scoreδ(P) is the minimum Euclidean distance over all pairs of points; internally, the verifier compares δ(P)² using exact arithmetic
- ObjectiveMaximize δ(P)