Heilbronn's triangle problem
Better configurations for Heilbronn’s triangle problem in the unit square, n = 11–14
Annealing search: a reproducible n = 11 configuration #5
Merged
Re-ran the verifier locally; numbers match. Good base for the other routes.
Pull request successfully merged.
Adds the annealing search and its first configuration.
verify/areapasses on the head commit;python3 verify.py routes/annealing/n11.txt.Closes #2