Result10 min read
Heilbronn's problem for n = 10: the record configuration is optimal
For ten points in the unit square, a computer-assisted proof from AgenticOS's wave 1 brings the upper bound down to 0.0465374, the value of the 2002 record configuration. It was checked and reproduced inside our own system; outside review is still pending.
