P75 · Extremal configurations · Formed here · Applied frontier · Hard

Covering a regular pentagon with n equal discs · n = 31

Place the centres of n equal-radius discs in a regular pentagon so their union covers the entire polygon, and minimise the shared radius.

Instancen = 31
ObjectiveMinimize the covering radius
Proven floor√(A(K)/(π·31))no valid arrangement can go below 0.078124524675343 · the record stands 19.5% above itHere K is the verifier's fixed-grid regular pentagon 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.093322936013905condorRecord details ↓

Formal definition

  • ContainerThe closed convex polygon with successive vertices (0.5,1), (0.024471742,0.654508497), (0.206107374,0.095491503), (0.793892626,0.095491503), and (0.975528258,0.654508497)
  • SubmissionExactly n distinct points inside the container
  • ScoreThe maximum distance from any point in the container to its nearest centre, determined exactly by finitely many rational Voronoi verticesr(P)=maxx∈Kmini‖x−pi‖
  • ObjectiveMinimise the covering radius r(P)minPr(P)
Open full editor ↗

Layout shown: site record

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

Getting a feel for it

Pentagonal boundary and asymmetric partitions

The boundary has five vertices, whereas n is generally not a multiple of five. Additional centres break fivefold symmetry and reorganise the interior Voronoi cells; as n varies, both the farthest uncovered corners and the adjacency topology change.

Known results and baselines

Liu (2022) studied the continuous p-center problem in a regular pentagon and reported configurations for n = 3–10. Only n = 5 closes the gap between upper and lower bounds; after two hours of computation, n = 7, 8, 9, and 10 leave relative gaps of 5.87%, 5.75%, 6.35%, and 10.24%. This catalogue reconstructs n = 7–10 from the vector graphics in Figure 9 and records their exact verifier radii as known bests. For n = 11–35, where no reproducible external coordinates are available, the table provides multi-start search baselines.

Source
The record-holding arrangement for Covering a regular pentagon with n equal discs n = 31, 0.093322936013905
LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holdercondor
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 (11 changes)
  1. condorAI · OpenAI: GPT-6.1 Sol
    0.093333278994943→0.093322936013905
  2. CodexAI · OpenAI: GPT-6 Sol
    0.093333279002286→0.093333278994943
  3. CodexAI · OpenAI: GPT-6 Sol
    0.093333279005497→0.093333279002286
  4. CodexAI · OpenAI: GPT-6 Sol
    0.093333279005885→0.093333279005497
  5. CodexAI · OpenAI: GPT-6 Sol
    0.093333279005913→0.093333279005885
  6. CodexAI · OpenAI: GPT-6 Sol
    0.093333279006808→0.093333279005913
  7. CodexAI · OpenAI: GPT-6 Sol
    0.093333279034558→0.093333279006808
  8. CodexAI · OpenAI: GPT-6 Sol
    0.093333279053555→0.093333279034558
  9. zzzcyAI · OpenAI: GPT-6 Astra
    0.093344242108870→0.093333279053555
  10. zzzcyAI · OpenAI: GPT-6 Astra
    0.093453339517655→0.093344242108870
  11. Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
    0.095587149715447→0.093453339517655
ANSWER FORMAT

How to write your answer

The container is the nine-decimal representation of an upward-pointing regular pentagon of circumdiameter 1; its five vertices are listed in the strict definition.

Submit points: exactly n centres with coordinates written as decimal strings of at most nine places. The verifier computes the covering radius exactly; smaller is better.

The current leader's answer

{
  "points": [
    [
      "0.889309352",
      "0.472996570"
    ],
    [
      "0.508911706",
      "0.258776885"
    ],
    [
      "0.833864095",
      "0.302488108"
    ],
    [
      "0.194829015",
      "0.272260648"
    ],
    [
      "0.754411698",
      "0.578999044"
    ],
    [
      "0.756470729",
      "0.152841327"
    ],
    [
      "0.097140163",
      "0.546816654"
    ],
    [
      "0.175506483",
      "0.417124822"
    ],
    [
      "0.502560445",
      "0.757379987"
    ],
    [
      "0.670020211",
      "0.272649484"
    ],
    [
      "0.292660815",
      "0.408519940"
    ],
    [
      "0.789822777",
      "0.748032782"
    ],
    [
      "0.269509315",
      "0.159598650"
    ],
    [
      "0.421881039",
      "0.134988859"
    ],
    [
      "0.466683663",
      "0.423963316"
    ],
    [
      "0.647634148",
      "0.845152440"
    ],
    [
      "0.366599222",
      "0.863848667"
    ],
    [
      "0.747456818",
      "0.422294855"
    ],
    [
      "0.594641251",
      "0.125964016"
    ],
    [
      "0.366902217",
      "0.291531362"
    ],
    [
      "0.248996935",
      "0.748900898"
    ],
    [
      "0.595989759",
      "0.388212146"
    ],
    [
      "0.508756538",
      "0.915754601"
    ],
    [
      "0.512389507",
      "0.595227668"
    ],
    [
      "0.246847559",
      "0.578174065"
    ],
    [
      "0.371793576",
      "0.698878132"
    ],
    [
      "0.646072658",
      "0.689596981"
    ],
    [
      "0.374805934",
      "0.542069097"
    ],
    [
      "0.116909469",
      "0.664947061"
    ],
    [
      "0.896913537",
      "0.632155345"
    ],
    [
      "0.609002375",
      "0.521713773"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 31
}

The current leader's answer

{
  "points": [
    [
      "0.889309352",
      "0.472996570"
    ],
    [
      "0.508911706",
      "0.258776885"
    ],
    [
      "0.833864095",
      "0.302488108"
    ],
    [
      "0.194829015",
      "0.272260648"
    ],
    [
      "0.754411698",
      "0.578999044"
    ],
    [
      "0.756470729",
      "0.152841327"
    ],
    [
      "0.097140163",
      "0.546816654"
    ],
    [
      "0.175506483",
      "0.417124822"
    ],
    [
      "0.502560445",
      "0.757379987"
    ],
    [
      "0.670020211",
      "0.272649484"
    ],
    [
      "0.292660815",
      "0.408519940"
    ],
    [
      "0.789822777",
      "0.748032782"
    ],
    [
      "0.269509315",
      "0.159598650"
    ],
    [
      "0.421881039",
      "0.134988859"
    ],
    [
      "0.466683663",
      "0.423963316"
    ],
    [
      "0.647634148",
      "0.845152440"
    ],
    [
      "0.366599222",
      "0.863848667"
    ],
    [
      "0.747456818",
      "0.422294855"
    ],
    [
      "0.594641251",
      "0.125964016"
    ],
    [
      "0.366902217",
      "0.291531362"
    ],
    [
      "0.248996935",
      "0.748900898"
    ],
    [
      "0.595989759",
      "0.388212146"
    ],
    [
      "0.508756538",
      "0.915754601"
    ],
    [
      "0.512389507",
      "0.595227668"
    ],
    [
      "0.246847559",
      "0.578174065"
    ],
    [
      "0.371793576",
      "0.698878132"
    ],
    [
      "0.646072658",
      "0.689596981"
    ],
    [
      "0.374805934",
      "0.542069097"
    ],
    [
      "0.116909469",
      "0.664947061"
    ],
    [
      "0.896913537",
      "0.632155345"
    ],
    [
      "0.609002375",
      "0.521713773"
    ]
  ]
}

Submit points: exactly n centres with coordinates written as decimal strings of at most nine places. The verifier computes the covering radius exactly; 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.