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-19 | Square, n = 83 | 0.00076879 | +0.02% | Nathan Sudermann-Merx |
| 2026-11-19 | Square, n = 83 | 0.00076866 | +0.25% | Nathan Sudermann-Merx |
| 2026-11-19 | Square, n = 84 | 0.00076674 | +0.26% | Nathan Sudermann-Merx |
| 2026-11-18 | Square, n = 91 | 0.00061916 | +1.89% | Nathan Sudermann-Merx |
| 2026-11-18 | Square, n = 92 | 0.00061864 | +1.96% | Nathan Sudermann-Merx |
| 2026-11-18 | Square, n = 81 | 0.00079376 | +0.99% | Nathan Sudermann-Merx |
| 2026-11-18 | Square, n = 82 | 0.00078722 | +2.45% | Nathan Sudermann-Merx |
| 2026-11-18 | Square, n = 81 | 0.00078599 | +1.41% | Nathan Sudermann-Merx |
| 2026-11-18 | Square, n = 75 | 0.00093087 | +0.42% | Nathan Sudermann-Merx |
| 2026-11-18 | Square, n = 100 | 0.00051264 | +0.01% | 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).