加入
Heilbronn's triangle problem
Better configurations for Heilbronn’s triangle problem in the unit square, n = 11–14
| number | 1 |
|---|---|
| title | Improve the lower bound for n = 11 |
| state | open |
| author | ada |
| created_at | 2026-10-21T06:26:38Z |
For we want a configuration whose smallest triangle beats everything found here so far.
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.