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

The project's example configuration for n = 11
Browse filesChecks
verify
Details
+12 −0 routes/launch-check-n11/n11.txt added View file
| @@ -0,0 +1,12 @@ | ||
| 1 | +# n = 11: smallest triangle about 0.032199, found by examples/search.py 11 0 100000 | |
| 2 | +0.000000 0.985592 | |
| 3 | +0.394683 1.000000 | |
| 4 | +0.161382 0.725907 | |
| 5 | +0.874725 0.000000 | |
| 6 | +0.000000 0.258650 | |
| 7 | +0.463623 0.638706 | |
| 8 | +1.000000 0.697024 | |
| 9 | +0.897034 0.854950 | |
| 10 | +0.088626 0.000000 | |
| 11 | +0.984695 0.094857 | |
| 12 | +0.305160 0.094791 | |