The Heilbronn Problem ---- - a day ago | 9 points | 1 comments - URL: https://math.tejstead.com/heilbronn/ - Discussions: https://news.ycombinator.com/item?id=49939637 - Summary: The Heilbronn Problem asks how to place n points in a unit-area region so that the smallest triangle formed by any three points has the largest possible area, denoted A(n). This site collects the best known configurations for three container shapes: squares, triangles, and optimal convex regions. Each entry provides exact coordinates, symmetry and congruence analysis, references to published proofs, and an in-browser rational arithmetic verifier. The site includes a table of recent record improvements (e.g., new values for triangle n=20 and square n=23 found in 2026), and a comprehensive table of best known values for n from 3 to 36 across the three container types, with values truncated to 8 decimals and ▲ marking entries proven optimal. All figures are regenerated from exactly verified coordinates, with methods and attribution documented.