Heilbronn triangle problem in a square $H(18)$

The best known placement of 18 points in a square, with the smallest triangles they form shaded

The largest possible area of the smallest triangle formed by three of $18$ points in a unit square.

Lower bound: ${\approx}0.01552605994$ Checked construction
Upper bound: $\frac{1}{17}$ (≈0.05882353) Literature

History

Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.

Date Bound Discovery Best evidence
1972-05 $\le \frac{1}{17}$ (≈0.05882353) M. Goldberg, Maximizing the smallest triangle made by N points in a square, Mathematics Magazine 45(3) (1972) 135-144. Literature
2026-07-22 $\ge {\approx}0.01447$ W. Shanley, Heilbronn configuration for 18 points in the square (2026-07-22), as reported in Stead's Heilbronn tables.
[via T. Stead, The Heilbronn problem: square, tables of the best known configurations of n points in the unit square for n = 3 to 100, with their record histories (linked from Erich Friedman's Packing Center), retrieved 2026-11-21.]
Checked construction
via $\ge 0.01552605994$, heilbronn-square-18-lower-0p01552605994
2026-08 $\ge {\approx}0.01459$ N. Sudermann-Merx, Heilbronn configurations found by computer search (August 2026), as reported in Stead's Heilbronn tables.
[via T. Stead, The Heilbronn problem: square, tables of the best known configurations of n points in the unit square for n = 3 to 100, with their record histories (linked from Erich Friedman's Packing Center), retrieved 2026-11-21.]
Checked construction
via $\ge 0.01552605994$, heilbronn-square-18-lower-0p01552605994
2026-09 $\ge {\approx}0.01552605994$ Fable 5.1 with S. Zhang, Heilbronn configurations from a search campaign with symmetry-reduced basin hopping (September 2026), as reported in Stead's Heilbronn tables.
[via T. Stead, The Heilbronn problem: square, tables of the best known configurations of n points in the unit square for n = 3 to 100, with their record histories (linked from Erich Friedman's Packing Center), retrieved 2026-11-21.]
Checked construction
via $\ge 0.01552605994$, heilbronn-square-18-lower-0p01552605994