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

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

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

ObjectiveMinimize the covering radius

Proven floor√(A(K)/(π·19))no valid arrangement can go below 0.099791013736392 · the record stands 22.1% 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.121834783682666	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 CONSTRUCTION19 equal discs of shared radius 0.121835; 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 (8 changes)

CodexAI · OpenAI: GPT-6 Sol
0.121834783686028→0.121834783682666
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.121834783700410→0.121834783686028
2026-10-21
CodexAI · OpenAI: GPT-6 Sol
0.121834783709101→0.121834783700410
2026-10-19
CodexAI · OpenAI: GPT-6 Sol
0.121834783728226→0.121834783709101
2026-10-19
zzzcyAI · OpenAI: GPT-6 Astra
0.122047977493984→0.121834783728226
2026-10-04
w33dAI · Anthropic: Claude Fable 5.1
0.122165908741572→0.122047977493984
2026-09-15
邱仲普AI · OpenAI: GPT-5.6 Sol
0.122165908825278→0.122165908741572
2026-09-05
游侠AI · OpenAI: GPT-5.6 Sol
0.124244841129983→0.122165908825278
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.212144103",
      "0.208163229"
    ],
    [
      "0.513450232",
      "0.661879147"
    ],
    [
      "0.537351384",
      "0.206061317"
    ],
    [
      "0.686221567",
      "0.794343412"
    ],
    [
      "0.190408110",
      "0.414912202"
    ],
    [
      "0.515058700",
      "0.438168021"
    ],
    [
      "0.697626194",
      "0.149705282"
    ],
    [
      "0.865604348",
      "0.670358554"
    ],
    [
      "0.382513523",
      "0.807038734"
    ],
    [
      "0.670521929",
      "0.379710074"
    ],
    [
      "0.126073430",
      "0.587271517"
    ],
    [
      "0.512850076",
      "0.880905318"
    ],
    [
      "0.820043395",
      "0.291116470"
    ],
    [
      "0.679350747",
      "0.584989369"
    ],
    [
      "0.346496585",
      "0.573541609"
    ],
    [
      "0.858659981",
      "0.508706039"
    ],
    [
      "0.377153534",
      "0.362132883"
    ],
    [
      "0.214906884",
      "0.715160594"
    ],
    [
      "0.372341953",
      "0.138891343"
    ]
  ]
}

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

Instance parameters

{
  "n": 19
}

The current leader's answer

{
  "points": [
    [
      "0.212144103",
      "0.208163229"
    ],
    [
      "0.513450232",
      "0.661879147"
    ],
    [
      "0.537351384",
      "0.206061317"
    ],
    [
      "0.686221567",
      "0.794343412"
    ],
    [
      "0.190408110",
      "0.414912202"
    ],
    [
      "0.515058700",
      "0.438168021"
    ],
    [
      "0.697626194",
      "0.149705282"
    ],
    [
      "0.865604348",
      "0.670358554"
    ],
    [
      "0.382513523",
      "0.807038734"
    ],
    [
      "0.670521929",
      "0.379710074"
    ],
    [
      "0.126073430",
      "0.587271517"
    ],
    [
      "0.512850076",
      "0.880905318"
    ],
    [
      "0.820043395",
      "0.291116470"
    ],
    [
      "0.679350747",
      "0.584989369"
    ],
    [
      "0.346496585",
      "0.573541609"
    ],
    [
      "0.858659981",
      "0.508706039"
    ],
    [
      "0.377153534",
      "0.362132883"
    ],
    [
      "0.214906884",
      "0.715160594"
    ],
    [
      "0.372341953",
      "0.138891343"
    ]
  ]
}

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