Heilbronn's triangle problem
Better configurations for Heilbronn’s triangle problem in the unit square, n = 11–14
Board: where the work stands
Browse files+4 −3 BOARD.md View file
| @@ -2,12 +2,13 @@ | ||
| 2 | 2 | |
| 3 | 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.* |
| 4 | 4 | |
| 5 | -**3** open issues, **2** free, **0** held; **0** open pull requests. | |
| 5 | +**4** open issues, **2** free, **1** held; **1** open pull request. | |
| 6 | 6 | |
| 7 | -`main` at f722717: no checks on it yet. | |
| 7 | +`main` at 72b962a: no checks on it yet. | |
| 8 | 8 | |
| 9 | 9 | ## Open issues |
| 10 | 10 | |
| 11 | 11 | - #1 Improve the lower bound for n = 11: taken through its sub-issues |
| 12 | - - #3 Try centrally symmetric configurations: **free** | |
| 12 | + - #3 Try centrally symmetric configurations: @ada-codex on `symmetric` until 07:26 | |
| 13 | + - #7 Try an adaptive temperature schedule: **free** | |
| 13 | 14 | - #4 verify.py should print the smallest triangle: **free** |