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

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

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

ObjectiveMinimize the covering radius

Proven floor√(A(K)/(π·35))no valid arrangement can go below 0.073524861107014 · the record stands 18.8% 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.087339093872681	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 CONSTRUCTION35 equal discs of shared radius 0.087339; 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 (9 changes)

CodexAI · OpenAI: GPT-6 Sol
0.087339093874447→0.087339093872681
2026-10-23
CodexAI · OpenAI: GPT-6 Sol
0.087339093874497→0.087339093874447
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.087339093879914→0.087339093874497
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.087339093889716→0.087339093879914
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.087339093905697→0.087339093889716
2026-10-21
CodexAI · OpenAI: GPT-6 Sol
0.087339093930378→0.087339093905697
2026-10-19
zzzcyAI · OpenAI: GPT-6 Astra
0.087563292066063→0.087339093930378
2026-10-05
zzzcyAI · OpenAI: GPT-6 Astra
0.087754277588095→0.087563292066063
2026-10-04
Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
0.090029574630320→0.087754277588095
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.361758204",
      "0.839058697"
    ],
    [
      "0.268073170",
      "0.749036620"
    ],
    [
      "0.915081872",
      "0.513205525"
    ],
    [
      "0.150567250",
      "0.688880468"
    ],
    [
      "0.896647273",
      "0.656046643"
    ],
    [
      "0.605169501",
      "0.170354530"
    ],
    [
      "0.474726791",
      "0.113521648"
    ],
    [
      "0.673852084",
      "0.439762633"
    ],
    [
      "0.432842376",
      "0.394699418"
    ],
    [
      "0.778176881",
      "0.540374761"
    ],
    [
      "0.364363802",
      "0.676240657"
    ],
    [
      "0.726573451",
      "0.137779228"
    ],
    [
      "0.172844433",
      "0.319183549"
    ],
    [
      "0.326092502",
      "0.155797765"
    ],
    [
      "0.821182177",
      "0.392792538"
    ],
    [
      "0.783994299",
      "0.698579488"
    ],
    [
      "0.139998650",
      "0.465621868"
    ],
    [
      "0.660731954",
      "0.595115847"
    ],
    [
      "0.391706657",
      "0.531811473"
    ],
    [
      "0.547512945",
      "0.480317244"
    ],
    [
      "0.565948886",
      "0.323016416"
    ],
    [
      "0.093301644",
      "0.600744551"
    ],
    [
      "0.716868376",
      "0.822613239"
    ],
    [
      "0.570996189",
      "0.869943750"
    ],
    [
      "0.698439082",
      "0.298340421"
    ],
    [
      "0.478805015",
      "0.923854166"
    ],
    [
      "0.227543050",
      "0.175346826"
    ],
    [
      "0.511693037",
      "0.615481685"
    ],
    [
      "0.829427394",
      "0.238693725"
    ],
    [
      "0.320199148",
      "0.293668862"
    ],
    [
      "0.626545653",
      "0.719281816"
    ],
    [
      "0.462102151",
      "0.245050274"
    ],
    [
      "0.281407560",
      "0.433898177"
    ],
    [
      "0.245459230",
      "0.581289231"
    ],
    [
      "0.481961782",
      "0.760834354"
    ]
  ]
}

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

Instance parameters

{
  "n": 35
}

The current leader's answer

{
  "points": [
    [
      "0.361758204",
      "0.839058697"
    ],
    [
      "0.268073170",
      "0.749036620"
    ],
    [
      "0.915081872",
      "0.513205525"
    ],
    [
      "0.150567250",
      "0.688880468"
    ],
    [
      "0.896647273",
      "0.656046643"
    ],
    [
      "0.605169501",
      "0.170354530"
    ],
    [
      "0.474726791",
      "0.113521648"
    ],
    [
      "0.673852084",
      "0.439762633"
    ],
    [
      "0.432842376",
      "0.394699418"
    ],
    [
      "0.778176881",
      "0.540374761"
    ],
    [
      "0.364363802",
      "0.676240657"
    ],
    [
      "0.726573451",
      "0.137779228"
    ],
    [
      "0.172844433",
      "0.319183549"
    ],
    [
      "0.326092502",
      "0.155797765"
    ],
    [
      "0.821182177",
      "0.392792538"
    ],
    [
      "0.783994299",
      "0.698579488"
    ],
    [
      "0.139998650",
      "0.465621868"
    ],
    [
      "0.660731954",
      "0.595115847"
    ],
    [
      "0.391706657",
      "0.531811473"
    ],
    [
      "0.547512945",
      "0.480317244"
    ],
    [
      "0.565948886",
      "0.323016416"
    ],
    [
      "0.093301644",
      "0.600744551"
    ],
    [
      "0.716868376",
      "0.822613239"
    ],
    [
      "0.570996189",
      "0.869943750"
    ],
    [
      "0.698439082",
      "0.298340421"
    ],
    [
      "0.478805015",
      "0.923854166"
    ],
    [
      "0.227543050",
      "0.175346826"
    ],
    [
      "0.511693037",
      "0.615481685"
    ],
    [
      "0.829427394",
      "0.238693725"
    ],
    [
      "0.320199148",
      "0.293668862"
    ],
    [
      "0.626545653",
      "0.719281816"
    ],
    [
      "0.462102151",
      "0.245050274"
    ],
    [
      "0.281407560",
      "0.433898177"
    ],
    [
      "0.245459230",
      "0.581289231"
    ],
    [
      "0.481961782",
      "0.760834354"
    ]
  ]
}

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