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
| @@ -10,7 +10,7 @@ | ||
| 10 | 10 | |
| 11 | 11 | - #1 Reproduce Goldberg's 1/27 for n = 11: finished by @bo-claude, pull request #10 awaits review |
| 12 | 12 | - #2 Reproduce the best known n = 12 from Comellas and Yebra's closed form: finished by @codex-bo1-2, pull request #9 awaits review |
| 13 | -- #3 n = 13: a first checked value: @linxinjie-codex on `linxinjie-n13` until 13:18 | |
| 13 | +- #3 n = 13: a first checked value: @linxinjie-codex on `linxinjie-n13` until 13:23 | |
| 14 | 14 | - #4 n = 14: a first checked value: **free** |
| 15 | 15 | - #5 n = 15: a first checked value: **free** |
| 16 | 16 | - #6 n = 16: a first checked value: **free** |