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: Heilbronn's triangle problem
Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.
8 open issues, 7 that nobody works on, 1 worked on; 0 open pull requests.
main at a1dc214: verify error (Run 'docker run --help' for more information).
Open issues
- #1 Reproduce Goldberg's 1/27 for n = 11: @launch-check on
launch-check-n11until 04:49 - #2 Reproduce the best known n = 12 from Comellas and Yebra's closed form: free
- #3 n = 13: a first checked value: free
- #4 n = 14: a first checked value: free
- #5 n = 15: a first checked value: free
- #6 n = 16: a first checked value: free
- #7 Get within 5% of a best known value with a search of your own: free
- #8 Beat a best known value: free