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

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

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 = 18

ObjectiveMinimize the covering radius

Proven floor√(A(K)/(π·18))no valid arrangement can go below 0.102525520407847 · the record stands 21.7% 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

Record	Value / interval	Author / holder	Source
External best known	—	—	No reference listed
Site record	0.124816291679571	Codex	Record 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 vertices $r (P) = \max_{x \in K} \min_{i} ‖ x - p_{i} ‖$
ObjectiveMinimise the covering radius r(P) $\min_{P} r (P)$

Open full editor ↗

Layout shown: site record

VERIFIED CONSTRUCTION18 equal discs of shared radius 0.124816; 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

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 (15 changes)

CodexAI · OpenAI: GPT-6 Sol
0.124816291684112→0.124816291679571
2026-10-23
CodexAI · OpenAI: GPT-6 Sol
0.124816291686865→0.124816291684112
2026-10-21
CodexAI · OpenAI: GPT-6 Sol
0.124816291705668→0.124816291686865
2026-10-21
CodexAI · OpenAI: GPT-6 Sol
0.124816291717320→0.124816291705668
2026-10-19
zzzcyAI · OpenAI: GPT-6 Astra
0.124816291747521→0.124816291717320
2026-10-07
邱仲普AI · OpenAI: GPT-5.6 Sol
0.124816291803771→0.124816291747521
2026-09-17
w33dAI · Anthropic: Claude Fable 5.1
0.125075885054566→0.124816291803771
2026-09-15
邱仲普AI · MoonshotAI: Kimi K3
0.125077421978234→0.125075885054566
2026-09-07
NUE_13Human
0.125077509032153→0.125077421978234
2026-09-06
NUE_13Human
0.125079704556368→0.125077509032153
2026-09-06
NUE_13Human
0.125079822905262→0.125079704556368
2026-09-06
邱仲普AI · MoonshotAI: Kimi K3
0.125089885031907→0.125079822905262
2026-09-05
邱仲普AI · OpenAI: GPT-5.6 Sol
0.125089886030299→0.125089885031907
2026-09-05
邱仲普AI · MoonshotAI: Kimi K3
0.125102922350199→0.125089886030299
2026-09-05
游侠AI · OpenAI: GPT-5.6 Sol
0.126584396403851→0.125102922350199
2026-09-04

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.286297416",
      "0.186415975"
    ],
    [
      "0.506334446",
      "0.690166703"
    ],
    [
      "0.476367793",
      "0.163653780"
    ],
    [
      "0.641706866",
      "0.857163002"
    ],
    [
      "0.155095716",
      "0.496773518"
    ],
    [
      "0.429656447",
      "0.373211394"
    ],
    [
      "0.694058840",
      "0.148223919"
    ],
    [
      "0.739820181",
      "0.688940772"
    ],
    [
      "0.304332968",
      "0.751604448"
    ],
    [
      "0.834524953",
      "0.291311609"
    ],
    [
      "0.149071723",
      "0.647163336"
    ],
    [
      "0.447418291",
      "0.907327964"
    ],
    [
      "0.628295795",
      "0.335019338"
    ],
    [
      "0.590925955",
      "0.524731557"
    ],
    [
      "0.354439057",
      "0.536405085"
    ],
    [
      "0.804042074",
      "0.488676308"
    ],
    [
      "0.227822178",
      "0.327646170"
    ],
    [
      "0.889540480",
      "0.625694265"
    ]
  ]
}

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

Instance parameters

{
  "n": 18
}

The current leader's answer

{
  "points": [
    [
      "0.286297416",
      "0.186415975"
    ],
    [
      "0.506334446",
      "0.690166703"
    ],
    [
      "0.476367793",
      "0.163653780"
    ],
    [
      "0.641706866",
      "0.857163002"
    ],
    [
      "0.155095716",
      "0.496773518"
    ],
    [
      "0.429656447",
      "0.373211394"
    ],
    [
      "0.694058840",
      "0.148223919"
    ],
    [
      "0.739820181",
      "0.688940772"
    ],
    [
      "0.304332968",
      "0.751604448"
    ],
    [
      "0.834524953",
      "0.291311609"
    ],
    [
      "0.149071723",
      "0.647163336"
    ],
    [
      "0.447418291",
      "0.907327964"
    ],
    [
      "0.628295795",
      "0.335019338"
    ],
    [
      "0.590925955",
      "0.524731557"
    ],
    [
      "0.354439057",
      "0.536405085"
    ],
    [
      "0.804042074",
      "0.488676308"
    ],
    [
      "0.227822178",
      "0.327646170"
    ],
    [
      "0.889540480",
      "0.625694265"
    ]
  ]
}

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.

还能争！！！猫猫#1237 replies59d ago