Heilbronn Problem

A page on the Heilbronn Problem, a long-standing question in combinatorial geometry, is drawing attention on Hacker News. The problem, posed by Heinz Heilbronn in the 1950s, asks how to place points in a unit square to maximise the area of the smallest triangle they form. It remains an active topic in mathematics, with bounds on the answer improved only gradually over decades.

A write-up on the Heilbronn problem, a longstanding question in discrete geometry about how to place points to maximise the smallest triangle they form, is circulating among mathematicians and programmers. The problem, posed by Hans Heilbronn in the 20th century, remains only partially solved, and accessible explainers like this one keep drawing interest from people who enjoy unsolved mathematical puzzles.