P84 · Packing and covering · Classic

Equilateral triangles in a disc

VERIFIED CONSTRUCTIONVERIFIED CONSTRUCTION
n = 3Current record · open

Pack n unit-side equilateral triangles into a disc. Contact is allowed; interiors cannot overlap. Minimise the container circle radius.

Formal definition

  • ContainerThe editor and certificate normalise the container to the closed unit disc centred at (1,1), while public scores are reported in the literature's unit-piece scale. Boundary contact is allowed.
  • SubmissionSubmit {radius, placements:[{x,y,turn},…]}, with each value written as a decimal string of at most nine places. Here x, y are centre coordinates; circles require turn = 0 and polygons use turn = tan(θ/2). Coordinates and turn must lie in [−4, 4], with 0 < radius ≤ 4.
  • ConstraintsExactly n congruent pieces lie wholly inside the container with pairwise disjoint interiors. Polygons may rotate independently by arbitrary angles.
  • PrecisionInput decimals are parsed as exact rationals and regular-polygon vertices are defined algebraically, with zero floating-point tolerance in feasibility checks.
  • ObjectiveContainer circle radius = 1/(2 sin(π/3) r), where smaller is better. Pages, leaderboards, and literature records share this unit with automatic conversion.

Getting a feel for it

Literature targets and coordinate certificates

Literature targets are converted at their published precision, while nine-decimal coordinate certificates are stored and displayed alongside the source values.

Source
ONE LEADERBOARD PER n

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) ↓
n3
CURRENT RECORD0.953511737best known [0.953, 0.954)
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n4
CURRENT RECORD0.98059793best known [0.98, 0.981)
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n7
CURRENT RECORD1.152382439best known [1.152, 1.153)
Matches the best known
Answer sourceErich Friedman
Solution methodPublished reference construction
n8
CURRENT RECORD1.263359171best known [1.263, 1.264)
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n9
CURRENT RECORD1.314752194best known [1.314, 1.315)
Matches the best known
Answer sourceDavid W. Cantrell
Solution methodPublished reference construction
n10
CURRENT RECORD1.384681281best known [1.38468, 1.38469)
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n11
CURRENT RECORD1.466988269best known [1.466, 1.467)
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n12
CURRENT RECORD1.507145202best known [1.507, 1.508)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n13
CURRENT RECORD1.527525236best known [1.527, 1.528)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n14
CURRENT RECORD1.604489741best known [1.60448, 1.60449)
Matches the best known
Answer sourceJake Loyd
Solution methodPublished reference construction
n15
CURRENT RECORD1.636720714best known [1.636, 1.637)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n16
CURRENT RECORD1.687452414best known [1.687, 1.688)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n17
CURRENT RECORD1.730310721best known [1.73, 1.731)
Matches the best known
Answer sourceDavid W. Cantrell
Solution methodPublished reference construction
n18
CURRENT RECORD1.801764485best known [1.80176, 1.80177)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n19
CURRENT RECORD1.825741865best known [1.825, 1.826)
Matches the best known
Answer sourceHaym Hirsh
Solution methodPublished reference construction
n20
CURRENT RECORD1.874369578best known [1.874, 1.875)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n21
CURRENT RECORD1.910541292best known [1.91, 1.911)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n22
CURRENT RECORD1.94398837best known [1.943, 1.944)
Matches the best known
Answer sourceMaurizio Morandi
Solution methodPublished reference construction
n23
CURRENT RECORD1.984672742best known [1.98467, 1.98468)
Matches the best known
Answer sourceJake Loyd
Solution methodPublished reference construction
n25
CURRENT RECORD2.055249514best known [2.055, 2.056)
Matches the best known
Answer sourceDavid W. Cantrell
Solution methodPublished reference construction
n26
CURRENT RECORD2.106647674best known [2.10664, 2.10665)
Matches the best known
Answer sourceThomas Schadt
Solution methodPublished reference construction
n27
CURRENT RECORD2.138465229best known [2.138, 2.139)
Matches the best known
Answer sourceDavid W. Cantrell
Solution methodPublished reference construction
n28
CURRENT RECORD2.188057301best known [2.18805, 2.18806)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n29
CURRENT RECORD2.209353128best known [2.20935, 2.20936)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n30
CURRENT RECORD2.251247448best known [2.25124, 2.25125)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n31
CURRENT RECORD2.27261088best known [2.272, 2.273)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n32
CURRENT RECORD2.312955248best known [2.31295, 2.31296)
Matches the best known
Answer sourceThomas Schadt
Solution methodPublished reference construction
n33
CURRENT RECORD2.341693793best known [2.34169, 2.3417)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n34
CURRENT RECORD2.375042541best known [2.37504, 2.37505)
Matches the best known
Answer sourceThomas Schadt
Solution methodPublished reference construction
n35
CURRENT RECORD2.39906467best known [2.39906, 2.39907)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n36
CURRENT RECORD2.439690195best known [2.43969, 2.4397)
Matches the best known
Answer sourceThomas Schadt
Solution methodPublished reference construction
n37
CURRENT RECORD2.463494354best known [2.46349, 2.4635)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n38
CURRENT RECORD2.490030016best known [2.49002, 2.49003)
Hard
Answer sourceThomas Schadt
Solution methodPublished reference construction
n39
CURRENT RECORD2.519382938best known [2.51938, 2.51939)
Matches the best known
Record holderNUE_13
Solution methodAI · DeepSeek: DeepSeek V4.1 Flash
n40
CURRENT RECORD2.556750012best known [2.55674, 2.55675)
Hard
Answer sourceThomas Schadt
Solution methodPublished reference construction

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/triangles-in-disc.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/triangles-in-disc.json
BibTeX (click to copy)
@misc{minmaxarena-triangles-in-disc-2026-10,
  title  = {{Equilateral triangles in a disc} (P84)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, 2026-10 edition},
  url    = {https://minmaxarena.com/data/editions/2026-10/triangles-in-disc.json},
  license = {CC BY 4.0}
}
DISCUSSION

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.