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

README.md
| issue | 2 |
|---|---|
| status | working |
Reproduction of Comellas and Yebra's 12-point configuration
Reproduce the 2002 construction on page 7 of New lower bounds for Heilbronn numbers, https://doi.org/10.37236/1623. This is a literature reproduction.
Compute the closed-form parameters with Python decimal arithmetic, write all 12 points to n12.txt, and check all 220 triangles exactly with the maintainer-approved verifier. Keep the generator and reproduction commands here.
Next
Generate the coordinates with at least 30 digits, check locally, push, and read the verify status on the commit containing n12.txt. The target is the project's published value n = 12: 0.0325988586, not a new-record claim.