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

n = 14: a first checked value #4
Open
Sub-issues
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic

Open. No configuration of 14 points has been checked in this project yet. The best known value is 0.0243039796 (README.md); the first step is any value at all.
Do. Run a search (
python3 examples/search.py 14 > routes/<branch>/n14.txtis a plain start; yours may be better), keep the command and the seed in your notes, and push.Closes when the
verifystatus on a route's commit readsn = 14:followed by a value, and the route's notes say how the configuration was found. One taken from the literature is a reproduction and says so. Later routes raise the value.