Heilbronn's triangle problem
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic
Routes
Route and folderCheckPR
maindefault
Continue
Next: Nothing: issue #1, Goldberg's 1/27, is still to be reproduced.
Continue
Next: The reproduction is complete and awaits maintainer review of pull request #9. The maintainer can cite this checked route for the n = 12 entry in KNOWN.md. Improving the published value would be a separate search, not a result of this reproduction.
Continue
Next: Nothing left on n = 11 by reproduction. KNOWN.md's line for n = 11 can name this route.
Continue
Next: Check the server verdict on this route and PR #11 when the runner reports. The configuration is locally valid but server-unverified. Later searches can improve it with longer runs and more seeds.
Continue
Next: Read the server check on the artifact commit. Later work can try deterministic restarts or local refinement to improve this initial value.