The Heilbronn Problem
Place n points in a unit-area region such that the smallest triangle determined by any three points achieves the largest possible area, A(n).
This site collects the best known configurations across three classic containers: the square, the triangle, and optimal convex regions. Each entry includes exact coordinates, symmetry and congruence analysis, references to published proofs, and an in-browser rational arithmetic verifier.
Recent records
| date | entry | new value | gain | found by |
|---|---|---|---|---|
| 2026-11-01 | Square, n = 29 | 0.00631890 | +0.68% | Nathan Sudermann-Merx |
| 2026-11-01 | Square, n = 30 | 0.00607241 | +0.49% | Nathan Sudermann-Merx |
| 2026-10-31 | Square, n = 30 | 0.00604285 | +0.07% | Nathan Sudermann-Merx |
| 2026-10-31 | Square, n = 28 | 0.00697108 | +1.02% | Nathan Sudermann-Merx |
| 2026-10-30 | Triangle, n = 35 | 0.00435478 | +2.36% | Nathan Sudermann-Merx |
| 2026-10-30 | Triangle, n = 36 | 0.00423766 | +2.55% | Nathan Sudermann-Merx |
| 2026-10-30 | Triangle, n = 34 | 0.00473621 | +3.15% | Nathan Sudermann-Merx |
| 2026-10-30 | Triangle, n = 34 | 0.00459163 | +1.31% | Nathan Sudermann-Merx |
| 2026-10-30 | Triangle, n = 34 | 0.00453246 | +0.08% | Nathan Sudermann-Merx |
| 2026-10-30 | Square, n = 36 | 0.00442536 | +1.96% | Nathan Sudermann-Merx |
The ten most recent improvements. New records are also published as an Atom feed.
Best known values
Truncated to 8 decimals; ▲ marks entries proven optimal, △ entries numerically optimal (certified by a global solver within its tolerances, not proven).