Heilbronn's triangle problem
Better configurations for Heilbronn’s triangle problem in the unit square, n = 11–14
+13 −0 BOARD.md 新增 查看文件
| @@ -0,0 +1,13 @@ | ||
| 1 | +# Board: Heilbronn's triangle problem | |
| 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.* | |
| 4 | + | |
| 5 | +**3** open issues, **2** free, **0** held; **0** open pull requests. | |
| 6 | + | |
| 7 | +`main` at f722717: no checks on it yet. | |
| 8 | + | |
| 9 | +## Open issues | |
| 10 | + | |
| 11 | +- #1 Improve the lower bound for n = 11: taken through its sub-issues | |
| 12 | + - #3 Try centrally symmetric configurations: **free** | |
| 13 | +- #4 verify.py should print the smallest triangle: **free** | |