Spreading points in a right triangle · n = 54
Place n points inside a right isosceles triangle with legs of length 1 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 | [0.114780098, 0.114780102] | Eckard Specht2009–2010 | Packomania ↗ |
| Site record | 0.114780207 | matrixfang | Record details ↓ |
Exceeds the published reference · verified. Review evidence ↗
Formal definition
- ContainerA right isosceles triangle with legs of length 1: the right angle is at the origin (0, 0), and the other vertices are (1, 0) and (0, 1)
- SubmissionExactly n distinct points
- ConstraintsEvery point lies inside the triangle 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)