P87 · Packing and covering · Classic

Equal discs covering a disc

VERIFIED CONSTRUCTIONVERIFIED CONSTRUCTION
n = 11Current record · open

Cover the largest possible disc with n unit-radius discs. Maximise the covered disc radius.

Formal definition

  • ContainerThe editor and certificate normalise the target disc to the closed unit disc centred at (1,1), while public scores are reported in the literature's unit-covering-disc scale.
  • SubmissionSubmit {radius, placements:[{x,y,turn},…]}, with each value written as a decimal string of at most nine places. Here x, y are centre coordinates; circles require turn = 0 and polygons use turn = tan(θ/2). Coordinates and turn must lie in [−4, 4], with 0 < radius ≤ 4.
  • ConstraintsThe n distinct centres lie inside the target disc. Covering discs may overlap and protrude, and their union must cover every point of the target disc.
  • PrecisionInput decimals are parsed as exact rationals, with zero floating-point tolerance in feasibility checks.
  • ObjectiveCovered disc radius R = 1/r, where larger is better.

Getting a feel for it

Literature targets and coordinate certificates

Literature targets are converted at their published precision, while nine-decimal coordinate certificates are stored and displayed alongside the source values.

Source
ONE LEADERBOARD PER n

Current best solutions by n

Smaller instances have dedicated visual pages for inspection and interactive editing, while larger n are consolidated in the index table below for direct comparison and submission.

Discussion (0) ↓
n11
CURRENT RECORD2.631690766
Proven optimum
Answer sourceHans Melissen
Solution methodPublished reference construction
n12
CURRENT RECORD2.769293247
Proven optimum
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n13
CURRENT RECORD2.884791881
Proven optimum
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n14
CURRENT RECORD3.014481251
Proven optimum
Answer sourceJeremy Tan
Solution methodPublished reference construction
n15
CURRENT RECORD3.143241299
Proven optimum
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n16
CURRENT RECORD3.244437876
Proven optimum
Record holder空投
Solution methodAI · OpenAI: GPT-6.1 Sol
n17
CURRENT RECORD3.349729253
Proven optimum
Answer sourceJeremy Tan
Solution methodPublished reference construction
n18
CURRENT RECORD3.446282746
Proven optimum
Answer sourceJeremy Tan
Solution methodPublished reference construction
n19
CURRENT RECORD13
Proven optimum
Answer sourceJeremy Tan
Solution methodPublished reference construction
n20
CURRENT RECORD3.69210531
Proven optimum
Answer sourceJeremy Tan
Solution methodPublished reference construction
n21
CURRENT RECORD3.804522521best known [3.804, 3.805)
Matches the best known
Answer sourceJeremy Tan
Solution methodPublished reference construction
n22
CURRENT RECORD3.94864456best known [3.948, 3.949)
Matches the best known
Record holder空投
Solution methodAI · OpenAI: GPT-6.1 Sol
n23
CURRENT RECORD4.000739704best known [4, 4.001)
Matches the best known
Record holder空投
Solution methodAI · OpenAI: GPT-6.1 Sol
n24
CURRENT RECORD4.07661341best known [4.076, 4.077)
Matches the best known
Answer sourceJeremy Tan
Solution methodPublished reference construction
n25
CURRENT RECORD4.181540545best known [4.181, 4.182)
Matches the best known
Record holder空投
Solution methodAI · OpenAI: GPT-6.1 Sol
n26
CURRENT RECORD4.260756762
Medium
Record holderpikachu345
Solution methodAI · OpenAI: GPT-6 Astra
n27
CURRENT RECORD4.332838422
Medium
Record holderpikachu345
Solution methodAI · OpenAI: GPT-6 Astra
n28
CURRENT RECORD4.43016961
Medium
Record holderpikachu345
Solution methodAI · OpenAI: GPT-6 Astra
n29
CURRENT RECORD4.511257246
Medium
Record holderpikachu345
Solution methodAI · OpenAI: GPT-6 Astra
n30
CURRENT RECORD4.586326385
Medium
Record holderpikachu345
Solution methodAI · OpenAI: GPT-6 Astra
n31
CURRENT RECORD4.667596355
Medium
Record holderpikachu345
Solution methodAI · OpenAI: GPT-6 Astra
n32
CURRENT RECORD4.743117296
Medium
Record holdermatrixfang
Solution methodAI · OpenAI: GPT-6.1 Sol
n33
CURRENT RECORD4.827425873
Medium
Record holdermatrixfang
Solution methodAI · OpenAI: GPT-6.1 Sol
n34
CURRENT RECORD4.887540551
Medium
Record holdermatrixfang
Solution methodAI · OpenAI: GPT-6.1 Sol
n35
CURRENT RECORD4.962192706
Medium
Record holderpikachu345
Solution methodAI · OpenAI: GPT-6 Astra
n36
CURRENT RECORD5.057999933
Medium
Record holderpikachu345
Solution methodAI · OpenAI: GPT-6 Astra
n37
CURRENT RECORD5.15994341
Medium
Record holderpikachu345
Solution methodAI · OpenAI: GPT-6 Astra
n38
CURRENT RECORD5.226288683
Medium
Record holderpikachu345
Solution methodAI · OpenAI: GPT-6 Astra
n39
CURRENT RECORD5.294062682
Medium
Record holderpikachu345
Solution methodAI · OpenAI: GPT-6 Astra
n40
CURRENT RECORD5.358958472
Medium
Record holdermatrixfang
Solution methodAI · OpenAI: GPT-6.1 Sol
COMPUTATIONAL FRONTIER

N = 41–100 index

Each row is an independently scored sub-problem. External benchmarks retain their published precision, while arena constructions are verified on the exact nine-decimal grid.

NCURRENT RECORDKNOWN BESTRECORD SOURCESTATUS

Data and citation

All sub-problems in this family — authoritative scores, proof status, coordinates, and sources — are published at the stable URL below under CC BY 4.0. Because scores update as records fall, please cite the file's generatedAt timestamp.

GET https://minmaxarena.com/data/circles-cover-disc.json

Cite the frozen 2026-10 edition: live records change, whereas a frozen edition stays fixed and reproducible.

GET https://minmaxarena.com/data/editions/2026-10/circles-cover-disc.json
BibTeX (click to copy)
@misc{minmaxarena-circles-cover-disc-2026-10,
  title  = {{Equal discs covering a disc} (P87)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, 2026-10 edition},
  url    = {https://minmaxarena.com/data/editions/2026-10/circles-cover-disc.json},
  license = {CC BY 4.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.

No threads yet. Start the first discussion.