The Heilbronn Problem
The Heilbronn Problem, a classic geometry puzzle about placing points in a unit square to maximize the minimal distance, was discussed on Hacker News. Participants reviewed recent approximation algorithm progress, potential network design applications, and the problem’s 1960s origins. They debated achieving optimal solutions with today’s computing power and linked the topic to sphere packing and coding theory, citing open-source projects and inviting further discussion.