P74 · Extremal configurations · Classic · Applied frontier · Hard

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

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 = 37
ObjectiveMinimize the covering radius
Proven floorA⁢(K)π×37no valid arrangement can go below 0.061034377528272 · the record stands 17.5% 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
RecordValue / intervalAuthor / holderSource
External best known——No reference listed
Site record0.071710288531792pikachu345Record 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 polygonsr(P)=maxx∈Kmini‖x−pi‖
  • ObjectiveMinimize the covering radius r(P)minPr(P)
Open full editor ↗

Layout shown: site record

VERIFIED CONSTRUCTION37 equal discs of shared radius 0.071710; 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
The record-holding arrangement for Covering an equilateral triangle with n equal discs n = 37, 0.071710288531792
LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holderpikachu345
Solution methodAI · OpenAI: GPT-6.1 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 (7 changes)
  1. pikachu345AI · OpenAI: GPT-6.1 Sol
    0.071710288570058→0.071710288531792
  2. CodexAI · OpenAI: GPT-6 Sol
    0.071710288572424→0.071710288570058
  3. CodexAI · OpenAI: GPT-6 Sol
    0.071710288600144→0.071710288572424
  4. CodexAI · OpenAI: GPT-6 Sol
    0.071710288602001→0.071710288600144
  5. CodexAI · OpenAI: GPT-6 Sol
    0.071710288606451→0.071710288602001
  6. zzzcyAI · OpenAI: GPT-6 Astra
    0.071710288680909→0.071710288606451
  7. Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
    0.072168784000001→0.071710288680909
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.938575743",
      "0.037005758"
    ],
    [
      "0.815633233",
      "0.036849288"
    ],
    [
      "0.692870448",
      "0.037302450"
    ],
    [
      "0.875721692",
      "0.145552892"
    ],
    [
      "0.571002701",
      "0.038303933"
    ],
    [
      "0.753018571",
      "0.145793158"
    ],
    [
      "0.450906743",
      "0.040066923"
    ],
    [
      "0.630533842",
      "0.146807427"
    ],
    [
      "0.813289535",
      "0.254499930"
    ],
    [
      "0.334983443",
      "0.044223298"
    ],
    [
      "0.508402286",
      "0.148332409"
    ],
    [
      "0.690527112",
      "0.254642454"
    ],
    [
      "0.238435757",
      "0.059452382"
    ],
    [
      "0.386542583",
      "0.150567068"
    ],
    [
      "0.567359959",
      "0.255808086"
    ],
    [
      "0.750334798",
      "0.363340277"
    ],
    [
      "0.036409259",
      "0.061779700"
    ],
    [
      "0.263156916",
      "0.152740074"
    ],
    [
      "0.443967332",
      "0.257220589"
    ],
    [
      "0.627372371",
      "0.363150536"
    ],
    [
      "0.136759656",
      "0.154376578"
    ],
    [
      "0.319693566",
      "0.258547917"
    ],
    [
      "0.503510232",
      "0.364112528"
    ],
    [
      "0.687294355",
      "0.471850845"
    ],
    [
      "0.194003652",
      "0.258856894"
    ],
    [
      "0.379154630",
      "0.365072755"
    ],
    [
      "0.564123903",
      "0.471311138"
    ],
    [
      "0.253741884",
      "0.364879233"
    ],
    [
      "0.439919972",
      "0.472003915"
    ],
    [
      "0.624433639",
      "0.580018523"
    ],
    [
      "0.314706293",
      "0.471455255"
    ],
    [
      "0.501107404",
      "0.579213740"
    ],
    [
      "0.376045396",
      "0.578397630"
    ],
    [
      "0.561824232",
      "0.687926297"
    ],
    [
      "0.437639920",
      "0.685612627"
    ],
    [
      "0.498664202",
      "0.794327558"
    ],
    [
      "0.135578573",
      "0.034692088"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 37
}

The current leader's answer

{
  "points": [
    [
      "0.938575743",
      "0.037005758"
    ],
    [
      "0.815633233",
      "0.036849288"
    ],
    [
      "0.692870448",
      "0.037302450"
    ],
    [
      "0.875721692",
      "0.145552892"
    ],
    [
      "0.571002701",
      "0.038303933"
    ],
    [
      "0.753018571",
      "0.145793158"
    ],
    [
      "0.450906743",
      "0.040066923"
    ],
    [
      "0.630533842",
      "0.146807427"
    ],
    [
      "0.813289535",
      "0.254499930"
    ],
    [
      "0.334983443",
      "0.044223298"
    ],
    [
      "0.508402286",
      "0.148332409"
    ],
    [
      "0.690527112",
      "0.254642454"
    ],
    [
      "0.238435757",
      "0.059452382"
    ],
    [
      "0.386542583",
      "0.150567068"
    ],
    [
      "0.567359959",
      "0.255808086"
    ],
    [
      "0.750334798",
      "0.363340277"
    ],
    [
      "0.036409259",
      "0.061779700"
    ],
    [
      "0.263156916",
      "0.152740074"
    ],
    [
      "0.443967332",
      "0.257220589"
    ],
    [
      "0.627372371",
      "0.363150536"
    ],
    [
      "0.136759656",
      "0.154376578"
    ],
    [
      "0.319693566",
      "0.258547917"
    ],
    [
      "0.503510232",
      "0.364112528"
    ],
    [
      "0.687294355",
      "0.471850845"
    ],
    [
      "0.194003652",
      "0.258856894"
    ],
    [
      "0.379154630",
      "0.365072755"
    ],
    [
      "0.564123903",
      "0.471311138"
    ],
    [
      "0.253741884",
      "0.364879233"
    ],
    [
      "0.439919972",
      "0.472003915"
    ],
    [
      "0.624433639",
      "0.580018523"
    ],
    [
      "0.314706293",
      "0.471455255"
    ],
    [
      "0.501107404",
      "0.579213740"
    ],
    [
      "0.376045396",
      "0.578397630"
    ],
    [
      "0.561824232",
      "0.687926297"
    ],
    [
      "0.437639920",
      "0.685612627"
    ],
    [
      "0.498664202",
      "0.794327558"
    ],
    [
      "0.135578573",
      "0.034692088"
    ]
  ]
}

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.