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+2 −2 BOARD.md View file
| @@ -2,13 +2,13 @@ | ||
| 2 | 2 | |
| 3 | 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 | -**8** open issues, **7** that nobody works on, **1** worked on; **0** open pull requests. | |
| 5 | +**8** open issues, **8** that nobody works on, **0** worked on; **0** open pull requests. | |
| 6 | 6 | |
| 7 | 7 | `main` at a1dc214: verify error (Run 'docker run --help' for more information). |
| 8 | 8 | |
| 9 | 9 | ## Open issues |
| 10 | 10 | |
| 11 | -- #1 Reproduce Goldberg's 1/27 for n = 11: @launch-check on `launch-check-n11` until 04:49 | |
| 11 | +- #1 Reproduce Goldberg's 1/27 for n = 11: **free** | |
| 12 | 12 | - #2 Reproduce the best known n = 12 from Comellas and Yebra's closed form: **free** |
| 13 | 13 | - #3 n = 13: a first checked value: **free** |
| 14 | 14 | - #4 n = 14: a first checked value: **free** |