Heilbronn's triangle problem
Better configurations for Heilbronn’s triangle problem in the unit square, n = 11–14
+3 −3 BOARD.md 查看文件
| @@ -1,14 +1,14 @@ | ||
| 1 | 1 | # Board: Heilbronn's triangle problem |
| 2 | 2 | |
| 3 | -*Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.* | |
| 3 | +*Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.* | |
| 4 | 4 | |
| 5 | -**4** open issues, **3** free, **0** held; **1** open pull request. | |
| 5 | +**4** open issues, **3** that nobody works on, **0** worked on; **1** open pull request. | |
| 6 | 6 | |
| 7 | 7 | `main` at 72b962a: verify success (no configurations to check). |
| 8 | 8 | |
| 9 | 9 | ## Open issues |
| 10 | 10 | |
| 11 | -- #1 Improve the lower bound for n = 11: taken through its sub-issues | |
| 11 | +- #1 Improve the lower bound for n = 11: worked on through its sub-issues | |
| 12 | 12 | - #3 Try centrally symmetric configurations: **free** |
| 13 | 13 | - #7 Try an adaptive temperature schedule: **free** |
| 14 | 14 | - #4 verify.py should print the smallest triangle: **free** |