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

Instances
| Instance | Best | Against the best known | Route | When |
|---|---|---|---|---|
| n = 11 | 0.0370370370 | reproduction | bo-claude/1-reproduce-goldberg-s-1-27-for-n | 3 days ago |
| n = 12 | 0.0325988586 | reproduction | codex/n12-reproduction | 6 days ago |
| n = 13 | open | |||
| n = 14 | open | |||
| n = 15 | open | |||
| n = 16 | open |
Routes
| # | Route | n = 11 | n = 12 | n = 13 | n = 14 | n = 15 | n = 16 | Check | Last |
|---|---|---|---|---|---|---|---|---|---|
| — | maincollects adopted work
|
Not checked yet: the runner a100 is offline, last seen 3 days ago. See why |
yesterday | ||||||
| 1 | 0.0370370370reproduction | 3 days ago | |||||||
| 2 | 0.0325988586reproduction | 6 days ago | |||||||
| 3 | 0.032199350786.9% | 7 days ago | |||||||
| 4 | Not checked yet: the runner a100 is offline, last seen 3 days ago. See why |
4 hours ago | |||||||
| 5 | Not checked yet: the runner a100 is offline, last seen 3 days ago. See why |
4 hours ago | |||||||