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 | 2 |
|---|---|
| status | working |
Reproduction of Comellas and Yebra's 12-point configuration
This route reproduces the published construction to the project's ten decimal places. It is not a new record or a proof of optimality.
Source and construction
F. Comellas and J. L. A. Yebra, New lower bounds for Heilbronn numbers, Electronic Journal of Combinatorics 9 (2002), R6, page 7, "Twelve points": article, PDF. Accessed 2026-11-12; the formula and coordinate table were also checked visually on the original PDF page.
Write t = (27 + 3 sqrt(57))^(1/3), x = 1 - (t^2 + 6)/(6t), and y = 2x^2 - 3x + 1/2. The 12 points are, in the paper's order: (x,0), (1-x,0), (0,x), (1,x), (1/2,y), (y,1/2), (1-y,1/2), (1/2,1-y), (0,1-x), (1,1-x), (x,1), (1-x,1).
generate.py uses Python's standard-library Decimal with 100 significant digits
for its default output, Newton iteration for the positive cube root, and 60
digits after the decimal point for each coordinate. It never uses binary floats
to calculate coordinates. This is deterministic evaluation of the published
formula, not a search; a seed does not apply.
Reproduce and check
From the repository root, with Python 3 and no extra dependencies:
python3 routes/codex/n12-reproduction/generate.py > routes/codex/n12-reproduction/n12.txt
python3 verify.py routes/codex/n12-reproduction/
Local run on 2026-11-12, Python 3.9.6: generation took less than 0.001 seconds. The unchanged project verifier enumerated all 220 triangles with exact rational arithmetic and printed:
n12.txt: 12 points in the unit square, smallest triangle 0.0325988586, on lines 1, 5 and 7
n = 12: 0.0325988586
n12.txt SHA-256:
fec1694bab8c1864318ae2f83928aca6b871b94a7b03721202a59e32945f2a43.
Regenerating the file reproduced its bytes exactly. The submitted decimal points
are rational approximations to irrational coordinates; the exact check is of
these submitted rationals. Matching ten displayed decimals does not assert exact
equality with the algebraic construction's area.
Precision experiment and limitations
The same generator, changing only --digits, gave these exact-check displays:
| Decimal places | Smallest triangle, cut to ten decimals |
|---|---|
| 6 | 0.0325987100 |
| 10 | 0.0325988586 |
| 30 | 0.0325988586 |
| 60 (submitted) | 0.0325988586 |
Six-decimal output is valid but misses the reproduction target. Ten decimals
already match its displayed value in this run; 60 are retained to preserve a much
closer approximation. Rounding also changes which near-tied triangle is smallest.
The logs and generation timings are in reproduction.json. Only n12.txt is
submitted as the route's configuration; the lower-precision files were temporary.
Next
Read the remote verify status on the commit holding these coordinates. If it reports n = 12: 0.0325988586, submit this reproduction for maintainer review; the maintainer can then use the verified route as evidence for the n = 12 entry in KNOWN.md. Improving the published value would be a separate search, not a result of this reproduction.