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

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

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

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

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

纪录对比

正方形边长 · 越小越好
纪录数值 / 区间作者 / 持有人来源
外部已知最好[232.69205124835, 232.69205124845]André Müller2025-12Packomania ↗
本站纪录232.692051251邱仲普纪录详情 ↓

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

严格定义

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

当前展示:本站纪录

232.692051251y0
0x232.692051251
已验证构造side = 232.692051251

帮助理解

角位分配与小圆填隙

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

已知证明与开放前沿

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

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

纪录详情

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

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

P13, n=35: exact-grid refinement of the public packing. Start from the certificate below, whose square side is 232.692051268. 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 232.692051251, a reduction of 17 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 140 square-containment inequalities and all 595 circle pairs, with radii exactly 1 through 35 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":[["127.130919463","229.696568562"],["137.915249892","85.711281031"],["56.740013933","225.866926828"],["4.742260756","96.443750943"],["227.151389211","136.338155933"],["226.692051254","83.772793163"],["174.627766215","225.600083936"],["116.359588701","224.692051267"],["65.941125502","9.000000000"],["92.193340518","155.076818762"],["170.981576141","11.081501800"],["12.244407219","220.517649329"],["41.327151607","219.692051267"],["143.324154085","14.000000001"],["15.000000001","146.648603583"],["16.710413246","77.895295977"],["215.629518813","63.605966051"],["214.692051266","157.081409070"],["21.078618518","112.784265732"],["115.083771816","83.978674761"],["100.402006428","123.452102406"],["124.061615093","159.669038241"],["209.692051265","23.000000002"],["172.790093562","159.949499177"],["25.000000002","185.378437048"],["146.974769212","117.129305003"],["56.898971879","143.737219744"],["146.292847798","204.692051265"],["203.598125681","203.598125681"],["202.692051265","110.605608912"],["64.131733385","86.189959501"],["32.000000002","32.000000003"],["100.364019278","33.063756656"],["83.374743694","198.692051264"],["163.828275420","58.503719044"]],"side":"232.692051268"}

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

答案怎么写

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

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

当前第一名的答案

{
  "centers": [
    [
      "127.130919351",
      "229.696568450"
    ],
    [
      "137.915249780",
      "85.711280919"
    ],
    [
      "56.740013821",
      "225.866926716"
    ],
    [
      "4.742260644",
      "96.443750831"
    ],
    [
      "227.151389099",
      "136.338155821"
    ],
    [
      "226.692051156",
      "83.772793051"
    ],
    [
      "174.627766103",
      "225.600083824"
    ],
    [
      "116.359588692",
      "224.692051251"
    ],
    [
      "65.941125497",
      "9.000000000"
    ],
    [
      "92.193340406",
      "155.076818650"
    ],
    [
      "170.981576029",
      "11.081501688"
    ],
    [
      "12.244407107",
      "220.517649217"
    ],
    [
      "41.327151603",
      "219.692051250"
    ],
    [
      "143.324154074",
      "14.000000000"
    ],
    [
      "15.000000000",
      "146.648603566"
    ],
    [
      "16.710413134",
      "77.895295865"
    ],
    [
      "215.629518701",
      "63.605965939"
    ],
    [
      "214.692051250",
      "157.081409061"
    ],
    [
      "21.078618406",
      "112.784265620"
    ],
    [
      "115.083771808",
      "83.978674755"
    ],
    [
      "100.402006421",
      "123.452102397"
    ],
    [
      "124.061614981",
      "159.669038129"
    ],
    [
      "209.692051251",
      "23.000000000"
    ],
    [
      "172.790093549",
      "159.949499166"
    ],
    [
      "25.000000002",
      "185.378437028"
    ],
    [
      "146.974769203",
      "117.129304994"
    ],
    [
      "56.898971875",
      "143.737219733"
    ],
    [
      "146.292847786",
      "204.692051250"
    ],
    [
      "203.598125569",
      "203.598125569"
    ],
    [
      "202.692051250",
      "110.605608906"
    ],
    [
      "64.131733381",
      "86.189959494"
    ],
    [
      "32.000000000",
      "32.000000000"
    ],
    [
      "100.364019271",
      "33.063756653"
    ],
    [
      "83.374743687",
      "198.692051250"
    ],
    [
      "163.828275409",
      "58.503719039"
    ]
  ],
  "side": "232.692051251"
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 35
}

当前第一名的答案

{
  "centers": [
    [
      "127.130919351",
      "229.696568450"
    ],
    [
      "137.915249780",
      "85.711280919"
    ],
    [
      "56.740013821",
      "225.866926716"
    ],
    [
      "4.742260644",
      "96.443750831"
    ],
    [
      "227.151389099",
      "136.338155821"
    ],
    [
      "226.692051156",
      "83.772793051"
    ],
    [
      "174.627766103",
      "225.600083824"
    ],
    [
      "116.359588692",
      "224.692051251"
    ],
    [
      "65.941125497",
      "9.000000000"
    ],
    [
      "92.193340406",
      "155.076818650"
    ],
    [
      "170.981576029",
      "11.081501688"
    ],
    [
      "12.244407107",
      "220.517649217"
    ],
    [
      "41.327151603",
      "219.692051250"
    ],
    [
      "143.324154074",
      "14.000000000"
    ],
    [
      "15.000000000",
      "146.648603566"
    ],
    [
      "16.710413134",
      "77.895295865"
    ],
    [
      "215.629518701",
      "63.605965939"
    ],
    [
      "214.692051250",
      "157.081409061"
    ],
    [
      "21.078618406",
      "112.784265620"
    ],
    [
      "115.083771808",
      "83.978674755"
    ],
    [
      "100.402006421",
      "123.452102397"
    ],
    [
      "124.061614981",
      "159.669038129"
    ],
    [
      "209.692051251",
      "23.000000000"
    ],
    [
      "172.790093549",
      "159.949499166"
    ],
    [
      "25.000000002",
      "185.378437028"
    ],
    [
      "146.974769203",
      "117.129304994"
    ],
    [
      "56.898971875",
      "143.737219733"
    ],
    [
      "146.292847786",
      "204.692051250"
    ],
    [
      "203.598125569",
      "203.598125569"
    ],
    [
      "202.692051250",
      "110.605608906"
    ],
    [
      "64.131733381",
      "86.189959494"
    ],
    [
      "32.000000000",
      "32.000000000"
    ],
    [
      "100.364019271",
      "33.063756653"
    ],
    [
      "83.374743687",
      "198.692051250"
    ],
    [
      "163.828275409",
      "58.503719039"
    ]
  ],
  "side": "232.692051251"
}

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

DISCUSSION

讨论区

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

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