P74 · Extremal configurations · Classic · Applied frontier

Covering an equilateral triangle with n equal discs

VERIFIED CONSTRUCTION12 equal discs of shared radius 0.137362; the marked place is the hardest to reach, and it is what sets the radius
n = 12Current record · open

Place n centres in a unit equilateral triangle. Every centre has the same covering radius; every point of the triangle must lie in at least one disc, and that radius is minimised.

Formal definition

  • ContainerThe closed convex polygon with vertices (0,0), (1,0), and (0.5,0.866025404), the site's unambiguous nine-decimal representative of an equilateral triangle
  • SubmissionExactly n distinct points inside the container
  • ScoreTake the distance to the nearest centre at every place in the container, then the largest of those distances; rational Voronoi polygons make the verifier exactr(P)=maxxKminixpi
  • ObjectiveMake the covering radius as small as possibleminPr(P)

Getting a feel for it

Corners and interior compete for centres

The three sharp corners demand attention, but pushing every centre outward leaves a hole in the middle. The best configurations are usually not a simple equally spaced triangular grid.

Published records and verifiable constructions are included

Nurmela (2000) collected and extended high-precision constructions for n=2–36. The site reconstructs n=7–36 from the contact graphs in Figures 2–4, showing both the paper's continuous value and the verifier-exact nine-decimal certificate. The n=9 and n=10 rows are proved optimal; the other n≤36 rows remain challengeable known bests. The paper explicitly reports no searches beyond n=36, so n=37–40 ship only transparent site starts obtained by filling successive farthest holes of n=36, without invented external records.

Source
ONE LEADERBOARD PER n

Current best solutions by n

Each n is an independent record with a page of its own. Open any of them to inspect the current construction, then challenge it.

Discussion (0) ↓
n7
CURRENT RECORD0.185251085806292best known 0.1852510855786008545
Hard
Answer sourceHans Melissen
Solution methodPublished reference construction
View problem
n8
CURRENT RECORD0.176992666698618best known 0.1769926664029649641
Hard
Answer sourceHans Melissen
Solution methodPublished reference construction
View problem
n9
CURRENT RECORD0.166666667608464
Optimal
Answer sourceHans Melissen
Solution methodPublished reference construction
View problem
n10
CURRENT RECORD0.144337567736528
Optimal
Answer sourceHans Melissen
Solution methodPublished reference construction
View problem
n11
CURRENT RECORD0.141054458266309best known 0.1410544578570137366
Hard
Answer sourceHans Melissen
Solution methodPublished reference construction
View problem
n12
CURRENT RECORD0.137362186814468best known 0.1373236156889236662
Hard
Answer sourceHans Melissen
Solution methodPublished reference construction
View problem
n13
CURRENT RECORD0.132664386321532best known 0.1326643857765088351
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n14
CURRENT RECORD0.127516386733134best known 0.1275163863998600644
Hard
Answer sourceHans Melissen
Solution methodPublished reference construction
View problem
n15
CURRENT RECORD0.115470054378444best known 0.1154700538379251529
Hard
Answer sourceHans Melissen
Solution methodPublished reference construction
View problem
n16
CURRENT RECORD0.113712578894961best known 0.1137125784440782042
Hard
Answer sourceHans Melissen
Solution methodPublished reference construction
View problem
n17
CURRENT RECORD0.111394310447661best known 0.1113943099632405880
Hard
Answer sourceHans Melissen
Solution methodPublished reference construction
View problem
n18
CURRENT RECORD0.109108945604594best known 0.1091089451179961906
Hard
Answer sourceHans Melissen
Solution methodPublished reference construction
View problem
n19
CURRENT RECORD0.106273196730285best known 0.1061737927289732618
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n20
CURRENT RECORD0.103285256972763best known 0.1032272183417310354
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n21
CURRENT RECORD0.096225045409067best known 0.0962250448649376274
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n22
CURRENT RECORD0.095177235493676best known 0.0951772351261450917
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n23
CURRENT RECORD0.093985748465025best known 0.0937742911094478264
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n24
CURRENT RECORD0.092354138033469best known 0.0923541375945022204
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n25
CURRENT RECORD0.090618245263137best known 0.0906182448311340175
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n26
CURRENT RECORD0.088793207681238best known 0.0887829248953373781
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n27
CURRENT RECORD0.086891340232970best known 0.0868913397937031505
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n28
CURRENT RECORD0.082478610232732best known 0.0824786098842322521
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n29
CURRENT RECORD0.081804813824288best known 0.0818048133956910115
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n30
CURRENT RECORD0.080882850353180best known 0.0808828500258641436
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n31
CURRENT RECORD0.079897245252974best known 0.0798972448089536737
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n32
CURRENT RECORD0.078850623071391best known 0.0788506226168764215
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n33
CURRENT RECORD0.077652736458406best known 0.0776371221483728244
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n34
CURRENT RECORD0.076387454401372best known 0.0763874538343494465
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n35
CURRENT RECORD0.075163717460255best known 0.0751604548962267707
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n36
CURRENT RECORD0.072168784102553best known 0.0721687836487032206
Hard
Answer sourceKari J. Nurmela
Solution methodPublished reference construction
View problem
n37
CURRENT RECORD0.072168784000001
Hard
Answer sourceMinMax Arena
Solution methodMinMax Arena reference construction
View problem
n38
CURRENT RECORD0.072168783991019
Hard
Answer sourceMinMax Arena
Solution methodMinMax Arena reference construction
View problem
n39
CURRENT RECORD0.072168783991019
Hard
Answer sourceMinMax Arena
Solution methodMinMax Arena reference construction
View problem
n40
CURRENT RECORD0.072168783986528
Hard
Answer sourceMinMax Arena
Solution methodMinMax Arena reference construction
View problem

Data and citation

Every sub-problem in this family — authoritative scores, proof status, coordinates and sources — lives at the stable address below, published under CC BY 4.0. Scores move as records fall, so cite the generatedAt timestamp the file carries.

GET https://minmaxarena.com/data/circles-covering-an-equilateral-triangle.json

Cite the frozen 2026-08 edition: records move, a frozen edition never does, so the citation is still checkable years later.

GET https://minmaxarena.com/data/editions/2026-08/circles-covering-an-equilateral-triangle.json
BibTeX (click to copy)
@misc{minmaxarena-circles-covering-an-equilateral-triangle-2026-08,
  title  = {{Covering an equilateral triangle with n equal discs} (P74)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, 2026-08 edition},
  url    = {https://minmaxarena.com/data/editions/2026-08/circles-covering-an-equilateral-triangle.json},
  license = {CC BY 4.0}
}
DISCUSSION

Discussion

Talk strategy, share methods, ask why you are stuck. Posts carry your public byline, the same name your records use; the #number after it is the account's signup ordinal, so a name cannot be worn by someone else. The floor is earned: break a record once, anywhere, and it is yours for good. New posts appear after an automated review.

No threads yet. Be the first to talk about this problem?