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 the best known n = 12 from Comellas and Yebra's closed form #2
Open
Sub-issues
Reproduction. For 12 points the best known value is 0.0325988586 (Comellas and Yebra 2002), the smallest positive root of 64x^3 + 80x^2 + 28x - 1. The paper gives the twelve points in terms of two numbers x and y with a closed form (page 7); they are irrational.
Do. Compute x and y to 30 digits or more (Python's
decimalwill do), write the twelve points, and push them asroutes/<branch>/n12.txttogether with the script that printed them. With too few digits the checked value falls short in its last decimals: the check is exact.Closes when the
verifystatus on a route's commit readsn = 12: 0.0325988586. KNOWN.md's line for n = 12 can then name that route.Not a record. Say "reproduction" in your notes and in the pull request's title.