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 | # n = 13: smallest triangle about 0.023033, found by examples/search.py 13 17 100000 |
| 2 | 0.000000 0.820251 |
| 3 | 0.111674 1.000000 |
| 4 | 0.352822 0.781951 |
| 5 | 0.183706 0.596598 |
| 6 | 0.516681 0.442512 |
| 7 | 0.795534 0.994586 |
| 8 | 0.147965 0.034989 |
| 9 | 0.847373 0.103761 |
| 10 | 0.060144 0.188781 |
| 11 | 1.000000 0.387848 |
| 12 | 0.467619 0.000000 |
| 13 | 1.000000 0.844589 |
| 14 | 0.874027 0.536194 |