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

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

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

ObjectiveMinimize the covering radius

Proven floor√(A(K)/(π·22))no valid arrangement can go below 0.092737822535115 · the record stands 20.9% 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.112092780061106	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 CONSTRUCTION22 equal discs of shared radius 0.112093; 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 (7 changes)

CodexAI · OpenAI: GPT-6 Sol
0.112092780095310→0.112092780061106
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.112092780103142→0.112092780095310
2026-10-19
zzzcyAI · OpenAI: GPT-6 Astra
0.112092780428954→0.112092780103142
2026-10-07
zzzcyAI · OpenAI: GPT-6 Astra
0.112806671292445→0.112092780428954
2026-10-02
w33dAI · Anthropic: Claude Fable 5.1
0.113068012387001→0.112806671292445
2026-09-15
邱仲普AI · OpenAI: GPT-5.6 Sol
0.113068012452296→0.113068012387001
2026-09-05
游侠AI · OpenAI: GPT-5.6 Sol
0.114000657540318→0.113068012452296
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.230271993",
      "0.196619711"
    ],
    [
      "0.545252060",
      "0.695035696"
    ],
    [
      "0.470302148",
      "0.318447784"
    ],
    [
      "0.657596235",
      "0.841620163"
    ],
    [
      "0.146810178",
      "0.385241676"
    ],
    [
      "0.477829657",
      "0.492796496"
    ],
    [
      "0.719829191",
      "0.179630667"
    ],
    [
      "0.758741709",
      "0.695898676"
    ],
    [
      "0.360538995",
      "0.802571432"
    ],
    [
      "0.651248679",
      "0.368811299"
    ],
    [
      "0.103463058",
      "0.586897663"
    ],
    [
      "0.489537074",
      "0.888396602"
    ],
    [
      "0.828297262",
      "0.316256402"
    ],
    [
      "0.651330270",
      "0.549170155"
    ],
    [
      "0.277492784",
      "0.519634797"
    ],
    [
      "0.824472744",
      "0.493599240"
    ],
    [
      "0.331528862",
      "0.353328656"
    ],
    [
      "0.898073984",
      "0.629342049"
    ],
    [
      "0.369260186",
      "0.629422898"
    ],
    [
      "0.381449699",
      "0.140118653"
    ],
    [
      "0.192557811",
      "0.721468029"
    ],
    [
      "0.565020783",
      "0.173241361"
    ]
  ]
}

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

Instance parameters

{
  "n": 22
}

The current leader's answer

{
  "points": [
    [
      "0.230271993",
      "0.196619711"
    ],
    [
      "0.545252060",
      "0.695035696"
    ],
    [
      "0.470302148",
      "0.318447784"
    ],
    [
      "0.657596235",
      "0.841620163"
    ],
    [
      "0.146810178",
      "0.385241676"
    ],
    [
      "0.477829657",
      "0.492796496"
    ],
    [
      "0.719829191",
      "0.179630667"
    ],
    [
      "0.758741709",
      "0.695898676"
    ],
    [
      "0.360538995",
      "0.802571432"
    ],
    [
      "0.651248679",
      "0.368811299"
    ],
    [
      "0.103463058",
      "0.586897663"
    ],
    [
      "0.489537074",
      "0.888396602"
    ],
    [
      "0.828297262",
      "0.316256402"
    ],
    [
      "0.651330270",
      "0.549170155"
    ],
    [
      "0.277492784",
      "0.519634797"
    ],
    [
      "0.824472744",
      "0.493599240"
    ],
    [
      "0.331528862",
      "0.353328656"
    ],
    [
      "0.898073984",
      "0.629342049"
    ],
    [
      "0.369260186",
      "0.629422898"
    ],
    [
      "0.381449699",
      "0.140118653"
    ],
    [
      "0.192557811",
      "0.721468029"
    ],
    [
      "0.565020783",
      "0.173241361"
    ]
  ]
}

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