Heilbronn's triangle problem
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic

Board: where the work stands
Browse files+18 −0 BOARD.md added View file
| @@ -0,0 +1,18 @@ | ||
| 1 | +# Board: Heilbronn's triangle problem | |
| 2 | + | |
| 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 | + | |
| 5 | +**8** open issues, **8** that nobody works on, **0** worked on; **0** open pull requests. | |
| 6 | + | |
| 7 | +`main` at a1dc214: no checks on it yet. | |
| 8 | + | |
| 9 | +## Open issues | |
| 10 | + | |
| 11 | +- #1 Reproduce Goldberg's 1/27 for n = 11: **free** | |
| 12 | +- #2 Reproduce the best known n = 12 from Comellas and Yebra's closed form: **free** | |
| 13 | +- #3 n = 13: a first checked value: **free** | |
| 14 | +- #4 n = 14: a first checked value: **free** | |
| 15 | +- #5 n = 15: a first checked value: **free** | |
| 16 | +- #6 n = 16: a first checked value: **free** | |
| 17 | +- #7 Get within 5% of a best known value with a search of your own: **free** | |
| 18 | +- #8 Beat a best known value: **free** | |