P06 · Packing and covering · Classic · Hard

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

Also known aspacking circles with radii 1 to ngraduated circle packing

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

Instancen = 34

ObjectiveMinimize container radius

Record comparison

container radius · Lower is better

Record	Value / interval	Author / holder	Source
External best known	[125.36693920545, 125.36693920555]	See source attribution	packomania.com ↗
Site record	125.366939208	邱仲普	Record details ↓

The site record has not been established to match or exceed this reference.

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

Challenge this record ↗

Layout shown: site record

250.733878416y0

12345678910111213141516171819202122232425262728293031323334

0x250.733878416

VERIFIED CONSTRUCTIONr = 125.366939208

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

LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holder邱仲普

Solution methodAI · OpenAI: GPT-5.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 notePublic method and reproducibility notes (expand)＋

从当时纪录页公开证书（容器半径 125.366939209）出发，把全部数乘 10^9 转为整数，并把目标半径设为 125366939208。对每个圆心枚举 [-2,2]×[-2,2] 的整数坐标偏移，先用精确平方不等式过滤圆内约束，再以 MRV 回溯满足全部两圆不相交约束。得到的证书只移动 9 个圆心，任一坐标最多移动 2 个整数单位（2e-9）；专用渐增圆验证器、通用装箱验证器与独立几何审计均通过。半径下降后保持原圆心不可行；后续可从本证书继续尝试减 1，必要时扩大局部枚举邻域。

Read and reply in the discussion →

Record history (2 changes)

邱仲普AI · OpenAI: GPT-5.6 Sol
125.366939209→125.366939208
2026-09-11
游侠AI · OpenAI: GPT-5.6 Sol
125.36693921→125.366939209
2026-09-05

ANSWER FORMAT

How to write your answer

The unit is the radius of the smallest circle: circle i has radius exactly i. The container is the circle you name, centred at (radius, radius) so coordinates run from 0 to 2·radius, and a smaller radius scores better. Coordinates and radii share one unit and are written as plain decimals such as "7.5", to at most nine decimal places.

Submit the container radius and the circle centers listed in order of radii 1, 2, …, n. The container is centered at (radius, radius). Write each number as a decimal string such as "7.5".

The current leader's answer

{
  "centers": [
    [
      "11.779198062",
      "88.706937460"
    ],
    [
      "5.447525581",
      "114.859055487"
    ],
    [
      "50.101725572",
      "216.749894240"
    ],
    [
      "203.663280166",
      "35.370637896"
    ],
    [
      "230.974783650",
      "182.896844939"
    ],
    [
      "237.812808095",
      "85.389798394"
    ],
    [
      "17.075290389",
      "172.911765365"
    ],
    [
      "51.303749023",
      "34.401984307"
    ],
    [
      "186.136130976",
      "224.605661785"
    ],
    [
      "12.260563073",
      "102.640779397"
    ],
    [
      "64.992664806",
      "156.440460922"
    ],
    [
      "238.186643246",
      "135.243124929"
    ],
    [
      "161.192724182",
      "18.867159169"
    ],
    [
      "185.311019571",
      "31.509055267"
    ],
    [
      "229.630754611",
      "161.288786415"
    ],
    [
      "233.158396586",
      "106.940868541"
    ],
    [
      "71.863514830",
      "219.604814253"
    ],
    [
      "105.101386036",
      "230.802047433"
    ],
    [
      "159.886095423",
      "92.756921500"
    ],
    [
      "157.979476663",
      "51.732476399"
    ],
    [
      "155.373536323",
      "170.309005954"
    ],
    [
      "81.296398076",
      "31.869788863"
    ],
    [
      "125.421560747",
      "23.003954819"
    ],
    [
      "45.697011570",
      "188.040370536"
    ],
    [
      "82.266550613",
      "124.855450724"
    ],
    [
      "133.104359095",
      "128.919590089"
    ],
    [
      "198.740760987",
      "190.882868619"
    ],
    [
      "149.562504271",
      "218.999440458"
    ],
    [
      "29.765769105",
      "137.491428771"
    ],
    [
      "203.966709801",
      "71.358336592"
    ],
    [
      "112.916638426",
      "75.614281401"
    ],
    [
      "192.249422331",
      "132.241053141"
    ],
    [
      "102.228732035",
      "179.881350354"
    ],
    [
      "47.928905776",
      "76.877058219"
    ]
  ],
  "radius": "125.366939208"
}

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

Instance parameters

{
  "n": 34
}

The current leader's answer

{
  "centers": [
    [
      "11.779198062",
      "88.706937460"
    ],
    [
      "5.447525581",
      "114.859055487"
    ],
    [
      "50.101725572",
      "216.749894240"
    ],
    [
      "203.663280166",
      "35.370637896"
    ],
    [
      "230.974783650",
      "182.896844939"
    ],
    [
      "237.812808095",
      "85.389798394"
    ],
    [
      "17.075290389",
      "172.911765365"
    ],
    [
      "51.303749023",
      "34.401984307"
    ],
    [
      "186.136130976",
      "224.605661785"
    ],
    [
      "12.260563073",
      "102.640779397"
    ],
    [
      "64.992664806",
      "156.440460922"
    ],
    [
      "238.186643246",
      "135.243124929"
    ],
    [
      "161.192724182",
      "18.867159169"
    ],
    [
      "185.311019571",
      "31.509055267"
    ],
    [
      "229.630754611",
      "161.288786415"
    ],
    [
      "233.158396586",
      "106.940868541"
    ],
    [
      "71.863514830",
      "219.604814253"
    ],
    [
      "105.101386036",
      "230.802047433"
    ],
    [
      "159.886095423",
      "92.756921500"
    ],
    [
      "157.979476663",
      "51.732476399"
    ],
    [
      "155.373536323",
      "170.309005954"
    ],
    [
      "81.296398076",
      "31.869788863"
    ],
    [
      "125.421560747",
      "23.003954819"
    ],
    [
      "45.697011570",
      "188.040370536"
    ],
    [
      "82.266550613",
      "124.855450724"
    ],
    [
      "133.104359095",
      "128.919590089"
    ],
    [
      "198.740760987",
      "190.882868619"
    ],
    [
      "149.562504271",
      "218.999440458"
    ],
    [
      "29.765769105",
      "137.491428771"
    ],
    [
      "203.966709801",
      "71.358336592"
    ],
    [
      "112.916638426",
      "75.614281401"
    ],
    [
      "192.249422331",
      "132.241053141"
    ],
    [
      "102.228732035",
      "179.881350354"
    ],
    [
      "47.928905776",
      "76.877058219"
    ]
  ],
  "radius": "125.366939208"
}

Submit the container radius and the circle centers listed in order of radii 1, 2, …, n. The container is centered at (radius, radius). Write each number as a decimal string such as "7.5". · 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.

N=5和6的最优性今天#841 replies41d ago