P06 · Packing and covering · Classic

Packing circles of radius 1,2,…,n into a circle

Also known aspacking circles with radii 1 to ngraduated circle packing

18.002795494y0
0x18.002795494
VERIFIED CONSTRUCTIONr = 9.001397747
n = 5Current record · open

Pack n non-overlapping circles of radii 1, 2, …, n inside an enclosing circle to minimize the container radius.

Formal definition

  • ContainerA circle of radius radius centered at (radius, radius), where the smallest circle has unit radius 1 and radius is the objective value to minimize
  • SubmissionContainer radius and centers, listed in order of radii 1, 2, …, n
  • ConstraintsCircle i has radius i; no two interiors overlap; every circle lies wholly inside the container circle
  • ObjectiveMinimize the container radius

Getting a feel for it

Large circles and interstitial gaps

The largest few circles determine the lower bound and primary geometry of the container, while the smaller circles fit into the interstices between large circles and the boundary. Increasing n by 1 adds a new largest circle that often changes the main contact graph and requires a different global layout.

Proven optima and open frontier

Packing circles of radii 1..n into the smallest enclosing circle was the subject of the 2005 Al Zimmermann programming contest. This problem imports Packomania's public best-known constructions up to n = 200; mathematical optimality remains open for n ≥ 5, and the larger instances are grouped into a single benchmark table.

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 (1) ↓
n1
CURRENT RECORD1
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n2
CURRENT RECORD3
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n3
CURRENT RECORD5
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n4
CURRENT RECORD7
Optimal
Answer sourcePackomania · Eckard Specht
Solution methodPublished reference construction
n5
CURRENT RECORD9.001397747best known [9.00139774605, 9.00139774615]
Hard
Record holder邱仲普
Solution methodAI · MoonshotAI: Kimi K3
n6
CURRENT RECORD11.0570404best known [11.05704039965, 11.05704039975]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n7
CURRENT RECORD13.462110678best known [13.46211067755, 13.46211067765]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n8
CURRENT RECORD16.221746677best known [16.22174667655, 16.22174667665]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n9
CURRENT RECORD19.233193909best known [19.23319390805, 19.23319390815]
Hard
Record holder邱仲普
Solution methodAI · MoonshotAI: Kimi K3
n10
CURRENT RECORD22.000193013best known [22.00019301265, 22.00019301275]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n11
CURRENT RECORD24.96063429best known [24.96063428885, 24.96063428895]
Hard
Record holder邱仲普
Solution methodAI · MoonshotAI: Kimi K3
n12
CURRENT RECORD28.371389438best known [28.37138943635, 28.37138943645]
Hard
Record holder邱仲普
Solution methodAI · MoonshotAI: Kimi K3
n13
CURRENT RECORD31.545867018best known [31.54586701755, 31.54586701765]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n14
CURRENT RECORD35.095647145best known [35.09564714355, 35.09564714365]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n15
CURRENT RECORD38.837995509best known [38.83799550815, 38.83799550825]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n16
CURRENT RECORD42.458116436best known [42.45811643565, 42.45811643575]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n17
CURRENT RECORD46.291342118best known [46.29134211715, 46.29134211725]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n18
CURRENT RECORD50.119762624best known [50.11976262345, 50.11976262355]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n19
CURRENT RECORD54.240293592best known [54.24029359135, 54.24029359145]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n20
CURRENT RECORD58.40056748best known [58.40056747895, 58.40056747905]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n21
CURRENT RECORD62.558877095best known [62.55887709385, 62.55887709395]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n22
CURRENT RECORD66.760286242best known [66.76028624135, 66.76028624145]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n23
CURRENT RECORD71.199461609best known [71.19946160785, 71.19946160795]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n24
CURRENT RECORD75.749142583best known [75.74914258185, 75.74914258195]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n25
CURRENT RECORD80.285864441best known [80.28586443995, 80.28586444005]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n26
CURRENT RECORD84.978191067best known [84.97819106565, 84.97819106575]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n27
CURRENT RECORD89.750962683best known [89.75096268195, 89.75096268205]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n28
CURRENT RECORD94.525877103best known [94.52587710145, 94.52587710155]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n29
CURRENT RECORD99.483111565best known [99.48311156355, 99.48311156365]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
n30
CURRENT RECORD104.540363767best known [104.54036376515, 104.54036376525]
Hard
Record holderSigmoid with Codex
Solution methodAI · OpenAI: GPT-5.6 Sol
COMPUTATIONAL FRONTIER

N = 31–200 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/graduated-circles-in-circle.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/graduated-circles-in-circle.json
BibTeX (click to copy)
@misc{minmaxarena-graduated-circles-in-circle-2026-10,
  title  = {{Packing circles of radius 1,2,…,n into a circle} (P06)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, 2026-10 edition},
  url    = {https://minmaxarena.com/data/editions/2026-10/graduated-circles-in-circle.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.