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

Reproduce Goldberg's 1/27 for n = 11 #1
Open
Sub-issues
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic

Reproduction. The best known value for 11 points is exactly 1/27 = 0.0370370370, Goldberg's configuration of 1972. Its coordinates are rational, and they are printed in Comellas and Yebra (2002), page 7, and in arXiv:2603.11107, appendix B. Nobody has put it under this project's check yet.
Do. Take the coordinates from the paper, write them as fractions (
1/3 0), and push them asroutes/<branch>/n11.txt.Closes when the
verifystatus on a route's commit readsn = 11: 0.0370370370and the check's log saysexactly 1/27. KNOWN.md's line for n = 11 can then name that route.Not a record. Say "reproduction" in your notes and in the pull request's title, and name the paper you took the coordinates from.