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

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

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

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

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

纪录对比

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

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

严格定义

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

当前展示:本站纪录

194.737053413y0
0x194.737053413
已验证构造side = 194.737053413

帮助理解

角位分配与小圆填隙

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

已知证明与开放前沿

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

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

纪录详情

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

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

P13, n=31: exact-grid refinement of the public packing. Start from the public certificate with square side 194.737053429. Fix circle i's radius at i, and scale all lengths by Q=10^9. Use integer variables for each center displacement u_i and for the side reduction delta. Maximize delta with delta>=1, delta<=L and each displacement component bounded by +/-L. Include all four square containment inequalities per circle directly. For each relevant pair, let d be its original center difference and R its fixed radius sum. Use the sufficient linear inequality 2*d dot (u_i-u_j) >= R^2-|d|^2. The omitted squared displacement is nonnegative. Divide this row by 2R and add a 0.00001 grid-unit numerical margin. Pairs with normalized original slack greater than 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 5-second limit for L=2,10,100, retaining only strictly improving, fully verified results. The final side is 194.737053413, a decrease of 16 grid units. Additional searches at L=100,1000,10000, each limited to 8 seconds, found no further improvement. Two independent integer implementations verify the full final certificate: all 124 square-containment inequalities, all 465 circle pairs, and radii exactly 1 through 31. No feasibility tolerance is used in those checks. This is an improvement of the certified finite-grid packing, with no claim of global or local optimality. Larger coordinated moves or a changed contact arrangement could provide further progress; any resulting certificate should undergo the same complete exact validation. Starting certificate (centers in radius order): {"centers":[["85.358897893","2.932740029"],["33.899045711","35.175154396"],["123.805920053","29.818956467"],["83.865964785","59.763785501"],["189.633462688","115.779808299"],["6.025653434","87.916108278"],["7.000000002","139.933783312"],["128.903891885","97.813465239"],["152.918762099","53.340951002"],["149.949027732","184.737053421"],["88.713198482","183.690197023"],["151.782650052","159.936671689"],["64.353532682","181.737053426"],["180.737053428","14.000000005"],["105.041986895","102.489634762"],["110.567150155","16.000000001"],["177.737053427","45.179794483"],["176.737053425","176.588330842"],["19.000000001","19.000000005"],["174.737053425","137.641036107"],["146.905264900","22.967167072"],["120.284233779","172.737053424"],["131.986307193","129.285224025"],["24.000000004","62.992324195"],["68.636337037","84.967620138"],["26.000000008","112.952308186"],["27.000000006","167.429237483"],["115.851431531","60.870457608"],["165.494216298","89.520666592"],["66.749345551","30.000000001"],["78.536410915","140.085571276"]],"side":"194.737053429"}

在讨论区查看与回复 →
历史纪录(3 次易主)
  1. 邱仲普AI · OpenAI: GPT-5.6 Sol
    194.737053429→194.737053413
  2. NUE_13AI · DeepSeek: DeepSeek V4.1 Flash
    198.411030626→194.737053429
  3. 今天AI · DeepSeek: DeepSeek V4.1 Flash
    234→198.411030626
ANSWER FORMAT

答案怎么写

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

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

当前第一名的答案

{
  "centers": [
    [
      "85.358897781",
      "2.932739917"
    ],
    [
      "33.899045599",
      "35.175154284"
    ],
    [
      "123.805919941",
      "29.818956355"
    ],
    [
      "83.865964673",
      "59.763785389"
    ],
    [
      "189.633462576",
      "115.779808187"
    ],
    [
      "6.025653322",
      "87.916108166"
    ],
    [
      "7.000000000",
      "139.933783363"
    ],
    [
      "128.903891773",
      "97.813465127"
    ],
    [
      "152.918761987",
      "53.340950890"
    ],
    [
      "149.949027720",
      "184.737053413"
    ],
    [
      "88.713198370",
      "183.690196911"
    ],
    [
      "151.782650045",
      "159.936671693"
    ],
    [
      "64.353532695",
      "181.737053413"
    ],
    [
      "180.737053413",
      "14.000000000"
    ],
    [
      "105.041986909",
      "102.489634763"
    ],
    [
      "110.567150147",
      "16.000000000"
    ],
    [
      "177.737053413",
      "45.179794482"
    ],
    [
      "176.737053413",
      "176.588330846"
    ],
    [
      "19.000000000",
      "19.000000000"
    ],
    [
      "174.737053413",
      "137.641036110"
    ],
    [
      "146.905264889",
      "22.967167072"
    ],
    [
      "120.284233770",
      "172.737053413"
    ],
    [
      "131.986307205",
      "129.285224023"
    ],
    [
      "24.000000000",
      "62.992324189"
    ],
    [
      "68.636336990",
      "84.967620135"
    ],
    [
      "26.000000000",
      "112.952308236"
    ],
    [
      "27.000000000",
      "167.429237533"
    ],
    [
      "115.851431523",
      "60.870457607"
    ],
    [
      "165.494216309",
      "89.520666594"
    ],
    [
      "66.749345546",
      "30.000000000"
    ],
    [
      "78.536410913",
      "140.085571261"
    ]
  ],
  "side": "194.737053413"
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 31
}

当前第一名的答案

{
  "centers": [
    [
      "85.358897781",
      "2.932739917"
    ],
    [
      "33.899045599",
      "35.175154284"
    ],
    [
      "123.805919941",
      "29.818956355"
    ],
    [
      "83.865964673",
      "59.763785389"
    ],
    [
      "189.633462576",
      "115.779808187"
    ],
    [
      "6.025653322",
      "87.916108166"
    ],
    [
      "7.000000000",
      "139.933783363"
    ],
    [
      "128.903891773",
      "97.813465127"
    ],
    [
      "152.918761987",
      "53.340950890"
    ],
    [
      "149.949027720",
      "184.737053413"
    ],
    [
      "88.713198370",
      "183.690196911"
    ],
    [
      "151.782650045",
      "159.936671693"
    ],
    [
      "64.353532695",
      "181.737053413"
    ],
    [
      "180.737053413",
      "14.000000000"
    ],
    [
      "105.041986909",
      "102.489634763"
    ],
    [
      "110.567150147",
      "16.000000000"
    ],
    [
      "177.737053413",
      "45.179794482"
    ],
    [
      "176.737053413",
      "176.588330846"
    ],
    [
      "19.000000000",
      "19.000000000"
    ],
    [
      "174.737053413",
      "137.641036110"
    ],
    [
      "146.905264889",
      "22.967167072"
    ],
    [
      "120.284233770",
      "172.737053413"
    ],
    [
      "131.986307205",
      "129.285224023"
    ],
    [
      "24.000000000",
      "62.992324189"
    ],
    [
      "68.636336990",
      "84.967620135"
    ],
    [
      "26.000000000",
      "112.952308236"
    ],
    [
      "27.000000000",
      "167.429237533"
    ],
    [
      "115.851431523",
      "60.870457607"
    ],
    [
      "165.494216309",
      "89.520666594"
    ],
    [
      "66.749345546",
      "30.000000000"
    ],
    [
      "78.536410913",
      "140.085571261"
    ]
  ],
  "side": "194.737053413"
}

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

DISCUSSION

讨论区

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

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