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

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

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

Lower bound: ${\approx}0.01077165681$ Checked construction
Upper bound: $\frac{1}{21}$ (≈0.04761905) 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}{21}$ (≈0.04761905) M. Goldberg, Maximizing the smallest triangle made by N points in a square, Mathematics Magazine 45(3) (1972) 135-144. Literature
2026-07 $\ge {\approx}0.009458$ T. Stead, Heilbronn configurations found by computer search (July 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.01077165680$, heilbronn-square-22-lower-0p01077165680
2026-08-03 $\ge {\approx}0.01047253440$ C. Nemri, Heilbronn configurations in the square found with AlphaEvolve (Google Cloud), 2026-08-03, github.com/cnemri/heilbronn-alphaevolve.
[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.01077165680$, heilbronn-square-22-lower-0p01077165680
2026-10 $\ge {\approx}0.01077165681$ N. Sudermann-Merx, Heilbronn configurations from a search campaign with basin hopping, ruin-and-recreate moves and seeding from neighboring records (October 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.01077165680$, heilbronn-square-22-lower-0p01077165680