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

Claim issue 4 for a first checked n14 configuration
Browse files+11 −0 routes/wutao-n14/README.md added View file
| @@ -0,0 +1,11 @@ | ||
| 1 | +--- | |
| 2 | +issue: 4 | |
| 3 | +status: working | |
| 4 | +--- | |
| 5 | +# First checked n = 14 configuration | |
| 6 | + | |
| 7 | +Run the provided simulated annealing search with seed 17 and 100000 steps. | |
| 8 | + | |
| 9 | +## Next | |
| 10 | + | |
| 11 | +Generate and exactly check the configuration, then submit the artifact. | |