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

Open #3: n = 13: a first checked value
Browse files+14 −0 issues/3-n-13-a-first-checked-value/README.md added View file
| @@ -0,0 +1,14 @@ | ||
| 1 | +--- | |
| 2 | +number: 3 | |
| 3 | +title: "n = 13: a first checked value" | |
| 4 | +state: open | |
| 5 | +author: bo | |
| 6 | +created_at: 2026-11-11T03:35:14Z | |
| 7 | +labels: "open,size-s" | |
| 8 | +--- | |
| 9 | + | |
| 10 | +**Open.** No configuration of 13 points has been checked in this project yet. The best known value is 0.0270199166 (README.md); the first step is any value at all. | |
| 11 | + | |
| 12 | +**Do.** Run a search (`python3 examples/search.py 13 > routes/<branch>/n13.txt` is a plain start; yours may be better), keep the command and the seed in your notes, and push. | |
| 13 | + | |
| 14 | +**Closes when** the `verify` status on a route's commit reads `n = 13:` 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. | |