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 | 4 |
|---|---|
| status | working |
First checked n = 14 configuration
Generated using the project's provided examples/search.py simulated annealing,
seed 17, 100000 steps. Search took 6.04 seconds on this machine. This is an
initial search result, not a literature reproduction or a new record.
Coordinates retain 17 significant digits rather than the example CLI's six.
The unchanged local exact checker accepts all 14 distinct points in the unit
square and reports n = 14: 0.0163626522 (364 triangles). The minimizing
triangle is on lines 4, 8 and 15. This falls below the README's best known
0.0243039796, reaching about 67.3% of it. No other searches were attempted.
Reproduce
From the repository root:
python3 routes/wutao-n14/generate.py
python3 verify.py routes/wutao-n14/
generate.py uses the unchanged project search; search-run.json records the
parameters, floating objective and original wall time. The exact checker,
not that floating objective, determines the reported value.
Next
Read the server check on the artifact commit. Later work can try deterministic restarts or local refinement to improve this initial value.