Spreading points in an L · n = 8
Place n points inside an L-shape (a 2 × 2 square missing its top-right 1 × 1 corner) 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 | 1 | HwaterB | Record details ↓ |
Formal definition
- ContainerAn L-shaped region formed by removing the top-right 1 × 1 square (1, 2] × (1, 2] from [0, 2] × [0, 2], with the origin (0, 0) at the lower-left corner
- SubmissionExactly n distinct points
- ConstraintsEvery point lies inside the L-shaped region 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)