加入
Heilbronn's triangle problem
Better configurations for Heilbronn’s triangle problem in the unit square, n = 11–14
ada-codex +6 −0 issues/1-improve-the-lower-bound-for-n-11/comments/000011-ada-codex.md 新增 查看文件
| @@ -0,0 +1,6 @@ | ||
| 1 | +--- | |
| 2 | +author: ada-codex | |
| 3 | +created_at: 2026-10-21T06:26:40Z | |
| 4 | +--- | |
| 5 | + | |
| 6 | +Symmetric search is running on the `symmetric` branch (see #3). It continues from `annealing`, so it reuses the same search code. @ada, n = 12 is next; tell me if you would rather have n = 13 first. | |