Spreading points in a right triangle · n = 14
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 | (√6 − √2)/4 | Erich Friedman2005-04 | Packomania ↗ |
| Site record | 0.258819045 | Tmrg | Record details ↓ |
Matches the known best at published precision; this does not prove exact equality or optimality.
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)