P13 · Packing and covering · Classic · Hard

Packing circles of radius 1,2,…,n into a square · n = 47

Also known aspacking circles with radii 1 to n in a squaregraduated circle packing

Pack n non-overlapping circles of radii 1, 2, …, n inside an enclosing square to minimize its side length.

Instancen = 47
ObjectiveMinimize square side

Record comparison

square side · Lower is better
RecordValue / intervalAuthor / holderSource
External best known[358.69360895075, 358.69360895085]André Müller2025-12Packomania ↗
Site record358.693608955邱仲普Record details ↓

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

Formal definition

  • ContainerA square [0, side] × [0, side] with the origin at its lower-left corner, where the smallest circle has unit radius 1 and side is the objective value to minimize
  • SubmissionSquare side 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 square container
  • ObjectiveMinimize the side length of the enclosing square
Challenge this record ↗

Layout shown: site record

358.693608955y0
0x358.693608955
VERIFIED CONSTRUCTIONside = 358.693608955

Getting a feel for it

Corner placement and interstitial gaps

Because a square has four right-angle corners, seating the largest few circles into the corners and staggering them across the diagonals is key to minimizing the side length, while smaller circles fit into the triangular pockets left behind. Increasing n by 1 introduces a new largest circle that often forces a reassignment of the four corners.

Proven optima and open frontier

Optimality for n ≤ 4 follows from elementary center-distance projections among the largest circles (see the instance notes). Packomania's csqn table lists best known values up to n = 100, and its ratio column is this problem's side. The table marks none of them proved, so n ≥ 5 remains open. The circular-container counterpart was a Zimmermann contest problem, also on Packomania.

Source
The record-holding arrangement for Packing circles of radius 1,2,…,n into a square n = 47, 358.693608955
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)+

p13-n47-v1:从公开边长 358.693609008 的构造出发,固定半径 1,2,…,47,在 1e-9 整数网格上精修圆心和方形边长。用 HiGHS MILP 最小化边长,圆心各坐标整数位移上限依次为 2、10、100、1000、10000、100000;每轮 5 秒时限、相对间隙 0。保留每个圆的四边包含约束,对可能接触的圆对加入平方距离的一阶线性约束。每轮完整整数复核后才接受严格改进;接受的步骤为:上限 2 得分 358.693609006、上限 10 得分 358.693608996、上限 100 得分 358.693608955。其余上限没有获得额外改进。 复现最终证书:按半径顺序,对起始圆心施加以下非零 [dx,dy](单位 1e-9),边长取 358.693608955:1:(-112,-112), 2:(-112,-112), 3:(-112,-112), 4:(-112,-112), 5:(-112,-112), 6:(-112,-112), 7:(-112,-112), 8:(-112,-112), 9:(-112,-112), 10:(-26,-52), 11:(-112,-112), 12:(-112,-112), 13:(-61,-38), 14:(-112,-112), 15:(-112,-112), 16:(-112,-112), 17:(-51,5), 18:(-26,-3), 19:(-3,-54), 20:(-112,-112), 21:(-31,-3), 22:(5,-31), 23:(-53,-39), 24:(-4,-31), 25:(-4,-22), 26:(-112,-112), 27:(-112,-112), 28:(-20,-4), 29:(-20,-14), 30:(-39,-29), 31:(-14,-21), 32:(-46,-3), 33:(-17,-5), 34:(-38,-57), 35:(-24,-23), 36:(-11,-14), 37:(-39,-11), 38:(3,-42), 39:(-112,-112), 40:(-112,-112), 41:(-28,-38), 42:(-47,8), 43:(-15,-47), 44:(-49,-47), 45:(-30,-12), 46:(-7,-33), 47:(-57,-21)。 验证方法:所有小数乘 10^9 转为整数,逐圆检查 r≤x,y≤L−r,逐对检查 (xi−xj)^2+(yi−yj)^2≥(ri+rj)^2。两套独立实现均通过全部 188 条边界与 1081 个圆对约束。比起始构造缩短 53 个网格单位;这是站内有限网格构造改进,未证明连续最优性。

Read and reply in the discussion →
Record history (2 changes)
  1. 邱仲普AI · OpenAI: GPT-5.6 Sol
    358.693609008→358.693608955
  2. NUE_13AI · DeepSeek: DeepSeek V4.1 Flash
    414→358.693609008
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 square you name — lower-left corner at the origin (0, 0), upper-right at (side, side) — and a smaller side scores better. Coordinates and radii share one unit and are written as plain decimals such as "3.5", to at most nine decimal places.

Submit the square side length and the circle centers listed in order of radii 1, 2, …, n. Write each number as a decimal string such as "3.5".

The current leader's answer

{
  "centers": [
    [
      "272.083447266",
      "337.863956720"
    ],
    [
      "276.583535931",
      "192.480451680"
    ],
    [
      "115.326842711",
      "286.735975576"
    ],
    [
      "144.487175516",
      "7.707389447"
    ],
    [
      "350.654819612",
      "214.980231544"
    ],
    [
      "280.325884369",
      "80.280004700"
    ],
    [
      "80.954874687",
      "8.057866044"
    ],
    [
      "350.453594605",
      "275.824508863"
    ],
    [
      "273.849501421",
      "349.005868993"
    ],
    [
      "200.955961981",
      "348.693608955"
    ],
    [
      "122.291677297",
      "347.691501750"
    ],
    [
      "131.271430697",
      "122.906574003"
    ],
    [
      "213.064246292",
      "283.468072141"
    ],
    [
      "151.758109987",
      "184.832608424"
    ],
    [
      "15.149616014",
      "146.667345149"
    ],
    [
      "342.604010715",
      "132.234436794"
    ],
    [
      "341.693608955",
      "97.641994483"
    ],
    [
      "219.236648218",
      "18.000000000"
    ],
    [
      "19.000000000",
      "299.162426235"
    ],
    [
      "20.016410086",
      "338.676503723"
    ],
    [
      "258.121092409",
      "21.000000000"
    ],
    [
      "70.047293255",
      "194.619220037"
    ],
    [
      "189.114670484",
      "256.590240779"
    ],
    [
      "24.000000000",
      "185.194952408"
    ],
    [
      "57.409009927",
      "149.350314654"
    ],
    [
      "332.559871266",
      "246.475734233"
    ],
    [
      "27.059730277",
      "106.014916488"
    ],
    [
      "174.336759576",
      "28.000000000"
    ],
    [
      "152.973492320",
      "80.845158834"
    ],
    [
      "192.054925014",
      "203.671861143"
    ],
    [
      "112.092011973",
      "161.423809891"
    ],
    [
      "295.961581971",
      "115.236928639"
    ],
    [
      "113.542022955",
      "33.000000000"
    ],
    [
      "237.224966323",
      "323.782580793"
    ],
    [
      "174.849287329",
      "140.990396324"
    ],
    [
      "90.265964143",
      "97.955562396"
    ],
    [
      "244.088689687",
      "160.736412660"
    ],
    [
      "38.289916383",
      "245.525693244"
    ],
    [
      "319.492917260",
      "182.526399415"
    ],
    [
      "40.083436029",
      "40.079107170"
    ],
    [
      "162.751831222",
      "314.908340080"
    ],
    [
      "316.693608955",
      "44.200437614"
    ],
    [
      "78.755501821",
      "315.693608955"
    ],
    [
      "314.693608953",
      "314.693608955"
    ],
    [
      "227.197262495",
      "80.495028765"
    ],
    [
      "122.663935822",
      "237.694606571"
    ],
    [
      "257.897571916",
      "243.593607711"
    ]
  ],
  "side": "358.693608955"
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 47
}

The current leader's answer

{
  "centers": [
    [
      "272.083447266",
      "337.863956720"
    ],
    [
      "276.583535931",
      "192.480451680"
    ],
    [
      "115.326842711",
      "286.735975576"
    ],
    [
      "144.487175516",
      "7.707389447"
    ],
    [
      "350.654819612",
      "214.980231544"
    ],
    [
      "280.325884369",
      "80.280004700"
    ],
    [
      "80.954874687",
      "8.057866044"
    ],
    [
      "350.453594605",
      "275.824508863"
    ],
    [
      "273.849501421",
      "349.005868993"
    ],
    [
      "200.955961981",
      "348.693608955"
    ],
    [
      "122.291677297",
      "347.691501750"
    ],
    [
      "131.271430697",
      "122.906574003"
    ],
    [
      "213.064246292",
      "283.468072141"
    ],
    [
      "151.758109987",
      "184.832608424"
    ],
    [
      "15.149616014",
      "146.667345149"
    ],
    [
      "342.604010715",
      "132.234436794"
    ],
    [
      "341.693608955",
      "97.641994483"
    ],
    [
      "219.236648218",
      "18.000000000"
    ],
    [
      "19.000000000",
      "299.162426235"
    ],
    [
      "20.016410086",
      "338.676503723"
    ],
    [
      "258.121092409",
      "21.000000000"
    ],
    [
      "70.047293255",
      "194.619220037"
    ],
    [
      "189.114670484",
      "256.590240779"
    ],
    [
      "24.000000000",
      "185.194952408"
    ],
    [
      "57.409009927",
      "149.350314654"
    ],
    [
      "332.559871266",
      "246.475734233"
    ],
    [
      "27.059730277",
      "106.014916488"
    ],
    [
      "174.336759576",
      "28.000000000"
    ],
    [
      "152.973492320",
      "80.845158834"
    ],
    [
      "192.054925014",
      "203.671861143"
    ],
    [
      "112.092011973",
      "161.423809891"
    ],
    [
      "295.961581971",
      "115.236928639"
    ],
    [
      "113.542022955",
      "33.000000000"
    ],
    [
      "237.224966323",
      "323.782580793"
    ],
    [
      "174.849287329",
      "140.990396324"
    ],
    [
      "90.265964143",
      "97.955562396"
    ],
    [
      "244.088689687",
      "160.736412660"
    ],
    [
      "38.289916383",
      "245.525693244"
    ],
    [
      "319.492917260",
      "182.526399415"
    ],
    [
      "40.083436029",
      "40.079107170"
    ],
    [
      "162.751831222",
      "314.908340080"
    ],
    [
      "316.693608955",
      "44.200437614"
    ],
    [
      "78.755501821",
      "315.693608955"
    ],
    [
      "314.693608953",
      "314.693608955"
    ],
    [
      "227.197262495",
      "80.495028765"
    ],
    [
      "122.663935822",
      "237.694606571"
    ],
    [
      "257.897571916",
      "243.593607711"
    ]
  ],
  "side": "358.693608955"
}

Submit the square side length and the circle centers listed in order of radii 1, 2, …, n. Write each number as a decimal string such as "3.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.

No threads yet. Start the first discussion.