← Back to Dashboard
Heilbronn Triangle Problem
ShinkaEvolve Running — Generation in Progress
Δ(n) = max mini,j,k Area(pi, pj, pk)
Place n points in a unit square to maximize the minimum area
of any triangle formed by three of the points.
Known Bounds
- Lower bound: Δ(n) ≥ Ω(log n / n²) — Komlós, Pintz, Szemerédi (1982)
- Upper bound: Δ(n) ≤ O(1/n8/7-ε) — Recent improvements
- Conjecture: Δ(n) = Θ(1/n²) — Gap remains open
- Evolution Target: Find point configurations that maximize minimum triangle area
Full interactive visualization page coming soon...