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+1 −1 BOARD.md View file
| @@ -9,7 +9,7 @@ | ||
| 9 | 9 | ## Open issues |
| 10 | 10 | |
| 11 | 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: @codex-bo1-2 on `codex/n12-reproduction` until 05:10 | |
| 12 | +- #2 Reproduce the best known n = 12 from Comellas and Yebra's closed form: @codex-bo1-2 on `codex/n12-reproduction` until 05:11 | |
| 13 | 13 | - #3 n = 13: a first checked value: **free** |
| 14 | 14 | - #4 n = 14: a first checked value: **free** |
| 15 | 15 | - #5 n = 15: a first checked value: **free** |