Spreading points in a rectangle · n = 7
Place n points inside a 2 × 1 rectangle to maximize the minimum Euclidean distance between any two points.
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 | 0.788288881 | deeppig | Record details ↓ |
Formal definition
- ContainerA 2 × 1 rectangle [0, 2] × [0, 1], with lower-left corner (0, 0) and upper-right corner (2, 1)
- SubmissionExactly n distinct points
- ConstraintsEvery point lies inside the rectangle or on its boundary
- Scoreδ(P) is the minimum Euclidean distance over all point pairs (the verifier compares δ(P)² using exact arithmetic internally)
- ObjectiveMaximize the minimum pairwise distance δ(P)