Heilbronn's triangle problem
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic

| 1 | --- |
| 2 | number: 8 |
| 3 | title: "Beat a best known value" |
| 4 | state: open |
| 5 | author: bo |
| 6 | created_at: 2026-11-11T03:35:22Z |
| 7 | labels: "open,size-l" |
| 8 | --- |
| 9 | |
| 10 | **Open, and hard.** For n = 11 to 16 the best known values (README.md) have no proof of optimality. Five of them have stood since 2011 or longer; the one for n = 15 was improved in August 2026 by a heuristic search, so the others may not be final either. |
| 11 | |
| 12 | **Do.** Anything that finds a configuration whose smallest triangle is larger than the best known one for its n. |
| 13 | |
| 14 | **Closes when** a route's `verify` status shows a value above the README's table for that instance, at the check's ten decimals, and a maintainer has compared it with the record table (math.tejstead.com/heilbronn/square). Until then call it a candidate, not a record. A confirmed one also belongs on the record table, which takes pull requests. |