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 | # Provided simulated annealing; n=14 seed=17 steps=100000; full float precision |
| 2 | 0.022300449148831468 0.31704080482397506 |
| 3 | 0.27951696282205252 1 |
| 4 | 0.54173251437825354 0.76155318437428621 |
| 5 | 0.88761667640426545 0.27899433605736679 |
| 6 | 0.067385368886396971 0.94880261586064585 |
| 7 | 0.99991009341578796 0.99205222251640635 |
| 8 | 0.1599199914619753 0.49794093039007509 |
| 9 | 0.54547254466447159 0.21447809972425194 |
| 10 | 0.99842081050418907 0.51224371960937132 |
| 11 | 0.34066947121599073 0 |
| 12 | 0.17919318337043719 0.046418692789263583 |
| 13 | 0.91380560679345146 0.038176531356293952 |
| 14 | 0 0.73202362776408636 |
| 15 | 0.6790315730313301 0.94205805159755107 |