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

n = 13: first checked configuration, 0.0230328961 #11
Open
No checks reported
This branch has no conflicts with the base branch
Addresses #3 with a deterministic simulated-annealing configuration generated by examples/search.py 13 17 100000. The unchanged exact checker accepts 13 distinct points in the square and reports smallest triangle area 0.0230328961. This is below the literature record; no record or reproduction is claimed. Method, seed, runtime and reproduction commands are in routes/linxinjie-n13/README.md.