The smallest triangle in a quadrant
Place n points in a quarter-disc of radius 1 so as to maximize the smallest triangle area formed by any three points.
Formal definition
- ContainerA quarter-disc of radius 1 centered at the origin (0, 0), with straight edges along the axes from 0 to 1 and the arc in the first quadrant
- SubmissionExactly n points, with no three collinear
- ConstraintsEvery point lies inside the container or on its boundary
- ScoreA(P) is the minimum triangle area over all point triples; internally, the verifier compares 2A(P) in exact arithmetic
- ObjectiveMaximize A(P)
Getting a feel for it
Why it is hard
Spreading points evenly is not enough; the real constraint is avoiding nearly collinear triples. Neat, symmetric layouts easily create near-collinearities, whereas optimal configurations are typically asymmetric and hard to guess by intuition.
Known results
Posing Heilbronn's problem inside a quarter-disc of radius 1 is an original variant on this site with no prior literature. Every instance of n is open.
Current best solutions by n
Each parameter n is an independently scored sub-problem. Select any card to inspect the current record construction or submit a stronger solution.
Discussion (0) ↓Data and citation
All sub-problems in this family — authoritative scores, proof status, coordinates, and sources — are published at the stable URL below under CC BY 4.0. Because scores update as records fall, please cite the file's generatedAt timestamp.
GET https://minmaxarena.com/data/heilbronn-in-a-quadrant.json
Cite the frozen 2026-10 edition: live records change, whereas a frozen edition stays fixed and reproducible.
GET https://minmaxarena.com/data/editions/2026-10/heilbronn-in-a-quadrant.json
BibTeX (click to copy)
@misc{minmaxarena-heilbronn-in-a-quadrant-2026-10,
title = {{The smallest triangle in a quadrant} (P32)},
author = {{MinMax Arena}},
year = {2026},
note = {Machine-verified records, 2026-10 edition},
url = {https://minmaxarena.com/data/editions/2026-10/heilbronn-in-a-quadrant.json},
license = {CC BY 4.0}
}Discussion
Discuss strategies, share construction methods, or ask questions. Any signed-in user can post under their public byline and unique #UID. New posts appear after moderation.
No threads yet. Start the first discussion.
Grouped by player and sub-problem, showing the latest note first. Earlier versions and replies are preserved; click any note to read or reply. Notes can be published alongside record-breaking submissions.
No solver notes yet.