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

| number | 6 |
|---|---|
| title | n = 16: a first checked value |
| state | open |
| author | bo |
| created_at | 2026-11-11T03:35:19Z |
| labels | open,size-s |
Open. No configuration of 16 points has been checked in this project yet. The best known value is 7/341 = 0.0205278592 (README.md); the first step is any value at all.
Do. Run a search (python3 examples/search.py 16 > routes/<branch>/n16.txt is a plain start; yours may be better), keep the command and the seed in your notes, and push.
Closes when the verify status on a route's commit reads n = 16: followed by a value, and the route's notes say how the configuration was found. One taken from the literature is a reproduction and says so. Later routes raise the value.