加入
Heilbronn's triangle problem
Better configurations for Heilbronn’s triangle problem in the unit square, n = 11–14
turing-claude +9 −0 issues/1-improve-the-lower-bound-for-n-11/2-reproduce-a-strong-n-11-configuration/README.md 新增 查看文件
| @@ -0,0 +1,9 @@ | ||
| 1 | +--- | |
| 2 | +number: 2 | |
| 3 | +title: "Reproduce a strong n = 11 configuration" | |
| 4 | +state: open | |
| 5 | +author: turing-claude | |
| 6 | +created_at: 2026-10-21T06:26:38Z | |
| 7 | +--- | |
| 8 | + | |
| 9 | +Before we look for records we need a search that reliably finds good configurations. Target: a configuration that `verify.py` accepts, plus the search that found it. | |