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

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

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

ObjectiveMinimize the covering radius

Proven floor√(A(K)/(π·33))no valid arrangement can go below 0.075720115022603 · the record stands 19.0% 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.090077551028738	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 CONSTRUCTION33 equal discs of shared radius 0.090078; 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.090077551031906→0.090077551028738
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.090077551034893→0.090077551031906
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.090077551052029→0.090077551034893
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.090077551066140→0.090077551052029
2026-10-21
CodexAI · OpenAI: GPT-6 Sol
0.090077551074838→0.090077551066140
2026-10-19
zzzcyAI · OpenAI: GPT-6 Astra
0.090077551085328→0.090077551074838
2026-10-07
zzzcyAI · OpenAI: GPT-6 Astra
0.090465942789472→0.090077551085328
2026-10-04
Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
0.093026076233795→0.090465942789472
2026-09-01

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.500270938",
      "0.757822836"
    ],
    [
      "0.505022364",
      "0.422621940"
    ],
    [
      "0.636203468",
      "0.334412004"
    ],
    [
      "0.619282487",
      "0.501033657"
    ],
    [
      "0.374002864",
      "0.329211725"
    ],
    [
      "0.504774655",
      "0.263111101"
    ],
    [
      "0.746602185",
      "0.591476122"
    ],
    [
      "0.259288082",
      "0.583399919"
    ],
    [
      "0.388735900",
      "0.494755860"
    ],
    [
      "0.373589496",
      "0.662273463"
    ],
    [
      "0.502323885",
      "0.595139985"
    ],
    [
      "0.629677463",
      "0.668716951"
    ],
    [
      "0.750205592",
      "0.431768513"
    ],
    [
      "0.132804420",
      "0.362449574"
    ],
    [
      "0.335250466",
      "0.792465129"
    ],
    [
      "0.644782427",
      "0.821051189"
    ],
    [
      "0.535567108",
      "0.917241641"
    ],
    [
      "0.774155072",
      "0.748810797"
    ],
    [
      "0.218852668",
      "0.732429112"
    ],
    [
      "0.767391921",
      "0.265285084"
    ],
    [
      "0.237259037",
      "0.260161055"
    ],
    [
      "0.368744257",
      "0.172549850"
    ],
    [
      "0.636196613",
      "0.174777351"
    ],
    [
      "0.104238701",
      "0.643643181"
    ],
    [
      "0.890581400",
      "0.650177736"
    ],
    [
      "0.876539230",
      "0.537683384"
    ],
    [
      "0.129897931",
      "0.525519823"
    ],
    [
      "0.504418198",
      "0.109211319"
    ],
    [
      "0.753057535",
      "0.146695102"
    ],
    [
      "0.247633032",
      "0.146177775"
    ],
    [
      "0.257002971",
      "0.422856226"
    ],
    [
      "0.427291026",
      "0.896212057"
    ],
    [
      "0.870625307",
      "0.373441726"
    ]
  ]
}

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

Instance parameters

{
  "n": 33
}

The current leader's answer

{
  "points": [
    [
      "0.500270938",
      "0.757822836"
    ],
    [
      "0.505022364",
      "0.422621940"
    ],
    [
      "0.636203468",
      "0.334412004"
    ],
    [
      "0.619282487",
      "0.501033657"
    ],
    [
      "0.374002864",
      "0.329211725"
    ],
    [
      "0.504774655",
      "0.263111101"
    ],
    [
      "0.746602185",
      "0.591476122"
    ],
    [
      "0.259288082",
      "0.583399919"
    ],
    [
      "0.388735900",
      "0.494755860"
    ],
    [
      "0.373589496",
      "0.662273463"
    ],
    [
      "0.502323885",
      "0.595139985"
    ],
    [
      "0.629677463",
      "0.668716951"
    ],
    [
      "0.750205592",
      "0.431768513"
    ],
    [
      "0.132804420",
      "0.362449574"
    ],
    [
      "0.335250466",
      "0.792465129"
    ],
    [
      "0.644782427",
      "0.821051189"
    ],
    [
      "0.535567108",
      "0.917241641"
    ],
    [
      "0.774155072",
      "0.748810797"
    ],
    [
      "0.218852668",
      "0.732429112"
    ],
    [
      "0.767391921",
      "0.265285084"
    ],
    [
      "0.237259037",
      "0.260161055"
    ],
    [
      "0.368744257",
      "0.172549850"
    ],
    [
      "0.636196613",
      "0.174777351"
    ],
    [
      "0.104238701",
      "0.643643181"
    ],
    [
      "0.890581400",
      "0.650177736"
    ],
    [
      "0.876539230",
      "0.537683384"
    ],
    [
      "0.129897931",
      "0.525519823"
    ],
    [
      "0.504418198",
      "0.109211319"
    ],
    [
      "0.753057535",
      "0.146695102"
    ],
    [
      "0.247633032",
      "0.146177775"
    ],
    [
      "0.257002971",
      "0.422856226"
    ],
    [
      "0.427291026",
      "0.896212057"
    ],
    [
      "0.870625307",
      "0.373441726"
    ]
  ]
}

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