P74 · Extremal configurations · Classic · Applied frontier · Hard

Covering an equilateral triangle with n equal discs · n = 40

Place n centres in a unit equilateral triangle so that closed discs of equal radius centred at those points cover the entire triangle, minimizing their shared radius.

Instancen = 40

ObjectiveMinimize the covering radius

Proven floor√(A(K)/(π·40))no valid arrangement can go below 0.058700984636067 · the record stands 18.7% above itHere K is the verifier's fixed-grid equilateral triangle and A(K) is its area. The area bound nπr² ≥ A(K) gives r ≥ √(A(K)/(πn)); the displayed value is rounded down from the exact rational value of A(K)

Record comparison

the covering radius · Lower is better

Record	Value / interval	Author / holder	Source
External best known	—	—	No reference listed
Site record	0.069681539722081	Codex	Record details ↓

Formal definition

ContainerThe closed convex polygon with vertices (0,0), (1,0), and (0.5,0.866025404), defining the unit equilateral triangle on the nine-decimal coordinate grid
SubmissionExactly n distinct points inside the container
ScoreThe maximum over the container of the distance to the nearest centre, computed exactly via rational Voronoi polygons $r (P) = \max_{x \in K} \min_{i} ‖ x - p_{i} ‖$
ObjectiveMinimize the covering radius r(P) $\min_{P} r (P)$

Open full editor ↗

Layout shown: site record

VERIFIED CONSTRUCTION40 equal discs of shared radius 0.069682; the marked bottleneck point is the furthest from its nearest center and determines the radius

Getting a feel for it

Balancing corners and interior

The three 60° corners pull centres outward, whereas pushing too many centres toward the boundary opens uncovered pockets in the interior. Outside special triangular numbers, optimal configurations depart from a uniform triangular grid.

Literature constructions and open cases

Nurmela (2000) compiled and extended high-precision constructions for n = 2–36. This benchmark reconstructs nine-decimal coordinate certificates for n = 7–36 from the contact graphs in Figures 2–4, displaying both the paper's continuous value and the certificate's exact score. Optimality is proved for n = 9 and n = 10, while the remaining n ≤ 36 cases represent best-known constructions; n = 37–40 extend beyond the published table with baseline initializations.

Source

LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holderCodex

Solution methodAI · OpenAI: GPT-6 Sol

Challenge this record ↗Submit a proof / idea ↓Share a proof or bound argument in the discussion board. Accepted contributions earn proof points.

Record holder's solver noteNo solver note yet (expand)＋

The record holder has not shared a solver note yet.

Record history (6 changes)

CodexAI · OpenAI: GPT-6 Sol
0.069681539724376→0.069681539722081
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.069681539728030→0.069681539724376
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.069681539762164→0.069681539728030
2026-10-21
CodexAI · OpenAI: GPT-6 Sol
0.069681539800218→0.069681539762164
2026-10-19
zzzcyAI · OpenAI: GPT-6 Astra
0.070090125743798→0.069681539800218
2026-10-04
Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
0.072168783986528→0.070090125743798
2026-09-01

ANSWER FORMAT

How to write your answer

The base runs from (0,0) to (1,0) with apex (0.5, 0.866025404), defining the nine-decimal equilateral triangle boundary used by the verifier.

Submit points: exactly n centres, with each coordinate a decimal string of at most nine places. The verifier computes the shared radius; smaller is better.

The current leader's answer

{
  "points": [
    [
      "0.452374944",
      "0.021357960"
    ],
    [
      "0.321805244",
      "0.026990247"
    ],
    [
      "0.696994026",
      "0.036253195"
    ],
    [
      "0.533028048",
      "0.382358062"
    ],
    [
      "0.758607977",
      "0.139262177"
    ],
    [
      "0.192341192",
      "0.024527739"
    ],
    [
      "0.121735773",
      "0.122412495"
    ],
    [
      "0.420799623",
      "0.207010837"
    ],
    [
      "0.700949868",
      "0.245365945"
    ],
    [
      "0.351679437",
      "0.310934478"
    ],
    [
      "0.400125328",
      "0.601180475"
    ],
    [
      "0.249537448",
      "0.120842394"
    ],
    [
      "0.640332638",
      "0.578125631"
    ],
    [
      "0.878670983",
      "0.137485487"
    ],
    [
      "0.571027952",
      "0.688300156"
    ],
    [
      "0.379773444",
      "0.117526505"
    ],
    [
      "0.638022268",
      "0.142377265"
    ],
    [
      "0.578094213",
      "0.036443795"
    ],
    [
      "0.820896338",
      "0.243398654"
    ],
    [
      "0.521932036",
      "0.589489596"
    ],
    [
      "0.817696270",
      "0.033328708"
    ],
    [
      "0.649520707",
      "0.363780215"
    ],
    [
      "0.939445170",
      "0.034476507"
    ],
    [
      "0.345628421",
      "0.510032831"
    ],
    [
      "0.063559605",
      "0.028560349"
    ],
    [
      "0.504952308",
      "0.796520069"
    ],
    [
      "0.174608496",
      "0.218150506"
    ],
    [
      "0.297746331",
      "0.211361570"
    ],
    [
      "0.704215719",
      "0.463467782"
    ],
    [
      "0.530898124",
      "0.209169398"
    ],
    [
      "0.410386725",
      "0.404729917"
    ],
    [
      "0.450641180",
      "0.696877805"
    ],
    [
      "0.589142997",
      "0.478932398"
    ],
    [
      "0.509365047",
      "0.114722111"
    ],
    [
      "0.469322458",
      "0.493409594"
    ],
    [
      "0.285343030",
      "0.416106373"
    ],
    [
      "0.598122139",
      "0.267913489"
    ],
    [
      "0.477314175",
      "0.300564038"
    ],
    [
      "0.229217187",
      "0.316291227"
    ],
    [
      "0.759862600",
      "0.349504638"
    ]
  ]
}

Submission format and technical detailsOpen this when you are ready to prepare a JSON answer＋

Instance parameters

{
  "n": 40
}

The current leader's answer

{
  "points": [
    [
      "0.452374944",
      "0.021357960"
    ],
    [
      "0.321805244",
      "0.026990247"
    ],
    [
      "0.696994026",
      "0.036253195"
    ],
    [
      "0.533028048",
      "0.382358062"
    ],
    [
      "0.758607977",
      "0.139262177"
    ],
    [
      "0.192341192",
      "0.024527739"
    ],
    [
      "0.121735773",
      "0.122412495"
    ],
    [
      "0.420799623",
      "0.207010837"
    ],
    [
      "0.700949868",
      "0.245365945"
    ],
    [
      "0.351679437",
      "0.310934478"
    ],
    [
      "0.400125328",
      "0.601180475"
    ],
    [
      "0.249537448",
      "0.120842394"
    ],
    [
      "0.640332638",
      "0.578125631"
    ],
    [
      "0.878670983",
      "0.137485487"
    ],
    [
      "0.571027952",
      "0.688300156"
    ],
    [
      "0.379773444",
      "0.117526505"
    ],
    [
      "0.638022268",
      "0.142377265"
    ],
    [
      "0.578094213",
      "0.036443795"
    ],
    [
      "0.820896338",
      "0.243398654"
    ],
    [
      "0.521932036",
      "0.589489596"
    ],
    [
      "0.817696270",
      "0.033328708"
    ],
    [
      "0.649520707",
      "0.363780215"
    ],
    [
      "0.939445170",
      "0.034476507"
    ],
    [
      "0.345628421",
      "0.510032831"
    ],
    [
      "0.063559605",
      "0.028560349"
    ],
    [
      "0.504952308",
      "0.796520069"
    ],
    [
      "0.174608496",
      "0.218150506"
    ],
    [
      "0.297746331",
      "0.211361570"
    ],
    [
      "0.704215719",
      "0.463467782"
    ],
    [
      "0.530898124",
      "0.209169398"
    ],
    [
      "0.410386725",
      "0.404729917"
    ],
    [
      "0.450641180",
      "0.696877805"
    ],
    [
      "0.589142997",
      "0.478932398"
    ],
    [
      "0.509365047",
      "0.114722111"
    ],
    [
      "0.469322458",
      "0.493409594"
    ],
    [
      "0.285343030",
      "0.416106373"
    ],
    [
      "0.598122139",
      "0.267913489"
    ],
    [
      "0.477314175",
      "0.300564038"
    ],
    [
      "0.229217187",
      "0.316291227"
    ],
    [
      "0.759862600",
      "0.349504638"
    ]
  ]
}

Submit points: exactly n centres, with each coordinate a decimal string of at most nine places. The verifier computes the shared radius; smaller is better. · Verifier v1.0.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.