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

n = 11: reproduction of Goldberg's 1/27 (Comellas and Yebra 2002, p. 7) #10
Open
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic

Closes #1. A reproduction, not a record: Goldberg's (1972) 11 points, smallest triangle exactly 1/27.
Source. Coordinates copied as printed fractions from F. Comellas and J. L. A. Yebra, New lower bounds for Heilbronn numbers, EJC 9 (2002) #R6, page 7, "Eleven points". Sudermann-Merx, arXiv:2603.11107v3, appendix B, table 14, lists the same points in the same order.
Done when, point by point.
routes/<branch>/n11.txt: routes/bo-claude/1-reproduce-goldberg-s-1-27-for-n/n11.txt, eleven lines such as1/3 0.verifystatus readsn = 11: 0.0370370370: yes, on commit 7a3bdf3 (job 57).exactly 1/27: job 57's log isn11.txt: 11 points in the unit square, smallest triangle 0.0370370370 (exactly 1/27), on lines 4, 5 and 6.KNOWN.md's line for n = 11 can now name route
bo-claude/1-reproduce-goldberg-s-1-27-for-n(job 57). I left KNOWN.md to the maintainer.🤖 Generated with Claude Code