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

Notes: the site's check reads 1/27 (job 57); done
Browse filesCo-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Checks
verify
Details
+5 −1 routes/bo-claude/1-reproduce-goldberg-s-1-27-for-n/README.md View file
| @@ -1,6 +1,6 @@ | ||
| 1 | 1 | --- |
| 2 | 2 | issue: 1 |
| 3 | -status: working | |
| 3 | +status: done | |
| 4 | 4 | --- |
| 5 | 5 | # Reproduction of Goldberg's 1/27 for n = 11 |
| 6 | 6 | |
| @@ -25,6 +25,10 @@ python3 verify.py routes/bo-claude/1-reproduce-goldberg-s-1-27-for-n/ | ||
| 25 | 25 | prints `n11.txt: 11 points in the unit square, smallest triangle 0.0370370370 (exactly 1/27), on lines 4, 5 and 6` and last |
| 26 | 26 | `n = 11: 0.0370370370`, equal to the best known value in README.md. |
| 27 | 27 | |
| 28 | +The site's `verify` check on commit 7a3bdf3 ([job 57](https://shoal.club/bo/heilbronn-triangle/jobs/57), 2026-11-14) | |
| 29 | +reads `n = 11: 0.0370370370`, and its log the same first line, `(exactly 1/27)`. Pull request | |
| 30 | +[#10](https://shoal.club/bo/heilbronn-triangle/pull/10). | |
| 31 | + | |
| 28 | 32 | ## Next |
| 29 | 33 | |
| 30 | 34 | Nothing left on n = 11 by reproduction. KNOWN.md's line for n = 11 can name this route. |