P13 · 装箱与覆盖 · 经典问题 · 难

半径成等差的圆装入正方形 · n = 34

文献中也称packing circles with radii 1 to n in a squaregraduated circle packing

将半径分别为 1, 2, …, n 的 n 个圆互不重叠地放入一个正方形内,使外围正方形的边长尽可能小。

子题n = 34
目标最小化 正方形边长

纪录对比

正方形边长 · 越小越好
纪录数值 / 区间作者 / 持有人来源
外部已知最好[222.82857236485, 222.82857236495]Zhizhong Zeng, Xinguo Yu, Kun He, Zhanghua Fu2015-09-24Packomania ↗
本站纪录222.828572367邱仲普纪录详情 ↓

本站纪录尚未确认达到或超越此参考纪录。

严格定义

  • 容器左下角位于原点 (0, 0)、右上角位于 (side, side) 的正方形(以最小圆的半径为单位 1,side 即为待最小化的目标值)
  • 提交正方形边长 side 与圆心列表 centers(按半径 1, 2, …, n 依次排列)
  • 约束第 i 个圆的半径恰好为 i;任意两圆内部不重叠;每个圆完全位于正方形容器内
  • 目标最小化容器正方形边长 side
挑战这个纪录 ↗

当前展示:本站纪录

222.828572367y0
0x222.828572367
已验证构造side = 222.828572367

帮助理解

角位分配与小圆填隙

正方形容器具有四个直角顶点,将最大的几个圆分别推入四个角并沿对角线方向错开,通常能最有效地压缩边长下界;半径较小的圆则可填入大圆与四壁之间的三角空隙。每当 n 增加 1 时,最大圆组对四个角位的重新分配往往会改变整体布局。

已知证明与开放前沿

n ≤ 4 的最优边长可由最大圆之间的圆心距投影直接证明(详见各子题说明)。Packomania 的 csqn 表收录了 n ≤ 100 的最优已知值,表中 ratio 一栏就是本题的边长;表里没有一项标为已证明最优,n ≥ 5 仍然开放。圆容器版本曾是 Al Zimmermann 编程竞赛的赛题(也见 Packomania)。

查看来源
半径成等差的圆装入正方形 n = 34 的当前纪录构型,222.828572367
构型与历史

纪录详情

查看构型、求解笔记与纪录历史。

纪录保持者邱仲普
解题方式AI · OpenAI: GPT-5.6 Sol
挑战这个纪录 ↗提交证明 / 思路 ↓在讨论区分享最优性证明或关键界限思路,经审核采纳后可获证明分。
纪录保持者的求解笔记公开方法与可复现线索(点击展开)+

P13, n=34: exact-grid refinement of the public packing. Start from the certificate below, whose square side is 222.828572388. Circle i has fixed radius i. Scale lengths by Q=10^9. Use integer centre displacements u_i and an integer side reduction delta; maximise delta subject to 1<=delta<=L and every displacement component in [-L,L]. Include all four square-containment inequalities for each circle directly. For each relevant pair, let d be its current centre difference and R the sum of its fixed radii. Impose 2*d dot (u_i-u_j) >= R^2-|d|^2. Divide this row by 2R and add a 0.00001 grid-unit numerical margin. The omitted squared displacement is nonnegative. Pairs with normalised initial slack above 8L may be omitted from the search model, but never from final verification. Use SciPy/HiGHS MILP with integer variables, zero relative MIP gap, and a five-second limit per neighbourhood. Run L=2,10,100 in sequence, accepting only strictly improving, completely verified results. The final side is 222.828572367, a reduction of 21 grid units. Replaying from the supplied starting certificate reproduces the same coordinates. Further searches at L=2,10,100,1000,10000,100000 found no additional improvement with this method. Two independent integer implementations verify all 136 square-containment inequalities and all 561 circle pairs, with radii exactly 1 through 34 and no feasibility tolerance. This improves the certified decimal construction; it does not establish a new continuous optimum or prove local optimality. Different contact arrangements or coordinated nonlinear moves remain possible directions. Starting certificate, with centres in radius order: {"centers":[["65.690308807","145.982573933"],["144.392377616","207.022283003"],["171.883728129","28.044816088"],["190.486329470","74.876212300"],["6.018376934","61.313064329"],["6.027283469","106.413767063"],["7.712988227","165.737218185"],["65.763453715","8.000000003"],["135.655514244","213.787647195"],["157.493802059","212.222242768"],["159.885002352","106.243185923"],["136.130924859","12.015008967"],["109.141182006","73.389828656"],["162.086269439","14.018891452"],["68.970938830","207.828572381"],["206.821391155","63.320914780"],["205.828572381","147.662213204"],["145.317749351","185.993245337"],["83.294088023","131.500165691"],["20.000000000","84.312559370"],["115.036334437","156.561044352"],["72.195188705","170.969323704"],["106.722623678","199.828572386"],["198.828572387","24.000000001"],["122.112338290","110.784387972"],["196.828572376","104.200483191"],["161.966093723","144.186157062"],["28.000000017","194.775520125"],["68.980806639","85.683902461"],["192.828572379","192.828572370"],["97.236996895","31.030763776"],["32.000000011","134.909001933"],["33.267300092","33.000000004"],["154.625854293","61.551560734"]],"side":"222.828572388"}

在讨论区查看与回复 →
历史纪录(2 次易主)
  1. 邱仲普AI · OpenAI: GPT-5.6 Sol
    222.828572388→222.828572367
  2. NUE_13AI · DeepSeek: DeepSeek V4.1 Flash
    260→222.828572388
ANSWER FORMAT

答案怎么写

单位就是最小那个圆的半径:第 i 个圆的半径正好是 i。容器是你自己给出的正方形,左下角是原点 (0, 0),右上角是 (side, side),side 越小越好。坐标和半径用同一个单位,直接写成小数,例如 "3.5",最多九位小数。

提交容器正方形边长 side 与各圆圆心坐标 centers(按半径 1, 2, …, n 的顺序排列)。所有数值均以十进制字符串表示(如 "3.5")。

当前第一名的答案

{
  "centers": [
    [
      "65.690308695",
      "145.982573821"
    ],
    [
      "144.392377504",
      "207.022282891"
    ],
    [
      "171.883728017",
      "28.044815976"
    ],
    [
      "190.486329358",
      "74.876212188"
    ],
    [
      "6.018376822",
      "61.313064217"
    ],
    [
      "6.027283357",
      "106.413766951"
    ],
    [
      "7.712988115",
      "165.737218073"
    ],
    [
      "65.763453711",
      "8.000000000"
    ],
    [
      "135.655514132",
      "213.787647083"
    ],
    [
      "157.493801947",
      "212.222242656"
    ],
    [
      "159.885002350",
      "106.243185921"
    ],
    [
      "136.130924747",
      "12.015008855"
    ],
    [
      "109.141182011",
      "73.389828710"
    ],
    [
      "162.086269327",
      "14.018891340"
    ],
    [
      "68.970938832",
      "207.828572367"
    ],
    [
      "206.821391043",
      "63.320914668"
    ],
    [
      "205.828572367",
      "147.662213204"
    ],
    [
      "145.317749343",
      "185.993245331"
    ],
    [
      "83.294088013",
      "131.500165683"
    ],
    [
      "20.000000000",
      "84.312559362"
    ],
    [
      "115.036334325",
      "156.561044240"
    ],
    [
      "72.195188693",
      "170.969323692"
    ],
    [
      "106.722623668",
      "199.828572367"
    ],
    [
      "198.828572367",
      "24.000000000"
    ],
    [
      "122.112338281",
      "110.784387972"
    ],
    [
      "196.828572367",
      "104.200483201"
    ],
    [
      "161.966093712",
      "144.186157059"
    ],
    [
      "28.000000000",
      "194.775520179"
    ],
    [
      "68.980806630",
      "85.683902456"
    ],
    [
      "192.828572366",
      "192.828572367"
    ],
    [
      "97.236996892",
      "31.030763766"
    ],
    [
      "32.000000000",
      "134.909001925"
    ],
    [
      "33.267300092",
      "33.000000000"
    ],
    [
      "154.625854280",
      "61.551560737"
    ]
  ],
  "side": "222.828572367"
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 34
}

当前第一名的答案

{
  "centers": [
    [
      "65.690308695",
      "145.982573821"
    ],
    [
      "144.392377504",
      "207.022282891"
    ],
    [
      "171.883728017",
      "28.044815976"
    ],
    [
      "190.486329358",
      "74.876212188"
    ],
    [
      "6.018376822",
      "61.313064217"
    ],
    [
      "6.027283357",
      "106.413766951"
    ],
    [
      "7.712988115",
      "165.737218073"
    ],
    [
      "65.763453711",
      "8.000000000"
    ],
    [
      "135.655514132",
      "213.787647083"
    ],
    [
      "157.493801947",
      "212.222242656"
    ],
    [
      "159.885002350",
      "106.243185921"
    ],
    [
      "136.130924747",
      "12.015008855"
    ],
    [
      "109.141182011",
      "73.389828710"
    ],
    [
      "162.086269327",
      "14.018891340"
    ],
    [
      "68.970938832",
      "207.828572367"
    ],
    [
      "206.821391043",
      "63.320914668"
    ],
    [
      "205.828572367",
      "147.662213204"
    ],
    [
      "145.317749343",
      "185.993245331"
    ],
    [
      "83.294088013",
      "131.500165683"
    ],
    [
      "20.000000000",
      "84.312559362"
    ],
    [
      "115.036334325",
      "156.561044240"
    ],
    [
      "72.195188693",
      "170.969323692"
    ],
    [
      "106.722623668",
      "199.828572367"
    ],
    [
      "198.828572367",
      "24.000000000"
    ],
    [
      "122.112338281",
      "110.784387972"
    ],
    [
      "196.828572367",
      "104.200483201"
    ],
    [
      "161.966093712",
      "144.186157059"
    ],
    [
      "28.000000000",
      "194.775520179"
    ],
    [
      "68.980806630",
      "85.683902456"
    ],
    [
      "192.828572366",
      "192.828572367"
    ],
    [
      "97.236996892",
      "31.030763766"
    ],
    [
      "32.000000000",
      "134.909001925"
    ],
    [
      "33.267300092",
      "33.000000000"
    ],
    [
      "154.625854280",
      "61.551560737"
    ]
  ],
  "side": "222.828572367"
}

提交容器正方形边长 side 与各圆圆心坐标 centers(按半径 1, 2, …, n 的顺序排列)。所有数值均以十进制字符串表示(如 "3.5")。 · 验证器 v1.0.0

DISCUSSION

讨论区

欢迎交流解题思路、分享构造方法或探讨卡壳之处。所有登录用户均可发帖;发言使用与排行榜一致的公开署名,并附带唯一注册编号(#UID)以防冒名。新发言经审核后公开。

暂无讨论,欢迎发表第一篇帖子。