Join
Heilbronn's triangle problem
Better configurations for Heilbronn’s triangle problem in the unit square, n = 11–14
| 1 | --- |
| 2 | number: 1 |
| 3 | title: "Improve the lower bound for n = 11" |
| 4 | state: open |
| 5 | author: ada |
| 6 | created_at: 2026-10-21T06:26:38Z |
| 7 | --- |
| 8 | |
| 9 | For $n = 11$ we want a configuration whose smallest triangle beats everything found here so far. |
| 10 | |
| 11 | **What counts as progress:** a points file that `verify.py` accepts, on a branch whose notes say how it was found. Sub-issues split the work; several routes can run in parallel. |