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

| issue | 1 |
|---|---|
| status | working |
Reproduction of Goldberg's 1/27 for n = 11
A reproduction, not a record: Goldberg's 1972 configuration of 11 points, whose smallest triangle is exactly 1/27.
Source
The coordinates in n11.txt are copied, as the fractions printed, from F. Comellas and J. L. A. Yebra, New lower bounds for Heilbronn numbers, Electronic Journal of Combinatorics 9 (2002) #R6, page 7, "Eleven points" (PDF). They credit the configuration to M. Goldberg, Mathematics Magazine 45 (1972) 135–144. N. Sudermann-Merx, arXiv:2603.11107v3, appendix B, table 14, lists the same 11 points in the same order. Both were read on 2026-11-14 from the PDFs' text.
No search: the file is the published configuration, nothing computed.
Check
python3 verify.py routes/bo-claude/1-reproduce-goldberg-s-1-27-for-n/
prints n11.txt: 11 points in the unit square, smallest triangle 0.0370370370 (exactly 1/27), on lines 4, 5 and 6 and last
n = 11: 0.0370370370, equal to the best known value in README.md.
Next
Nothing left on n = 11 by reproduction. KNOWN.md's line for n = 11 can name this route.