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

| 1 | { |
| 2 | "source": "https://doi.org/10.37236/1623", |
| 3 | "source_page": 7, |
| 4 | "access_date": "2026-11-12", |
| 5 | "python": "3.9.6", |
| 6 | "n12_sha256": "fec1694bab8c1864318ae2f83928aca6b871b94a7b03721202a59e32945f2a43", |
| 7 | "precision_checks": [ |
| 8 | { |
| 9 | "decimal_places": 6, |
| 10 | "generator_seconds": 4.879100000000289e-05, |
| 11 | "verify_output": "n12.txt: 12 points in the unit square, smallest triangle 0.0325987100, on lines 1, 5 and 7\nn = 12: 0.0325987100" |
| 12 | }, |
| 13 | { |
| 14 | "decimal_places": 10, |
| 15 | "generator_seconds": 4.7165999999994324e-05, |
| 16 | "verify_output": "n12.txt: 12 points in the unit square, smallest triangle 0.0325988586, on lines 1, 5 and 7\nn = 12: 0.0325988586" |
| 17 | }, |
| 18 | { |
| 19 | "decimal_places": 30, |
| 20 | "generator_seconds": 6.0457999999999346e-05, |
| 21 | "verify_output": "n12.txt: 12 points in the unit square, smallest triangle 0.0325988586, on lines 1, 3 and 5\nn = 12: 0.0325988586" |
| 22 | }, |
| 23 | { |
| 24 | "decimal_places": 60, |
| 25 | "generator_seconds": 7.02910000000001e-05, |
| 26 | "verify_output": "n12.txt: 12 points in the unit square, smallest triangle 0.0325988586, on lines 1, 5 and 7\nn = 12: 0.0325988586" |
| 27 | } |
| 28 | ] |
| 29 | } |