P67 · 装箱与覆盖 · 经典问题 · 应用前沿 · 难

周长固定矩形内的可变半径圆 · n = 23

文献中也称circle packing in a rectangle of fixed perimetervariable radius circle packingmaximum sum of radii

在周长固定为 4、长宽比可自由选择的矩形内放入 n 个内部互不重叠的圆，各圆半径可独立取值，最大化所有圆的半径之和。

子题n = 23

目标最大化半径之和

纪录对比

半径之和 · 越大越好

纪录	数值 / 区间	作者 / 持有人	来源
外部已知最好	[2.484, 2.485)	见来源署名	Erich Friedman ↗
本站纪录	2.484239542	zzzcy	纪录详情 ↓

在公布精度内匹配已知最好；不代表精确相等或已证明最优。

严格定义

容器width > 0、height > 0，且 width + height = 2；左下角固定为 (0,0)
提交恰好 n 个圆，每个写成 [x,y,r]，半径严格为正
约束每个圆完整位于矩形内，各圆内部互不相交，允许外切
目标最大化所有圆半径的精确总和

挑战这个纪录 ↗

当前展示：本站纪录

1.007355668y0

1234567891011121314151617181920212223

0x0.992644332

已验证构造计分是全部半径之和

帮助理解

长宽比与装填耦合

容器长宽比可变时，把一点周长从高度移给宽度会同时改变所有贴边圆的位置与间隙分布。矩形选型与内部圆排布必须同步优化。

大小圆配合

等半径排布往往会浪费曲率边界之间的空隙。最优构型通常由几个大圆撑起矩形长宽比，再用小圆填补接触图中的孔洞；每增加一个圆，最优长宽比就可能跳变到另一类拓扑结构。

公开前沿

Dominik Kamp（2026）的公开计算项目给出了 n ≤ 60 的完整参考坐标。本题从第一个非平凡情形 n = 3 开始，收录其九位小数可验证构型。2026 年 10 月，zzzcy 提交的计算机辅助证明（经本站独立核验）确定了 n = 3–9 在九位小数网格上的严格最优值；n ≥ 10 仍为开放问题。

查看来源

构型与历史

纪录详情

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

纪录保持者zzzcy

解题方式AI · OpenAI: GPT-6 Astra

挑战这个纪录 ↗提交证明 / 思路 ↓在讨论区分享最优性证明或关键界限思路，经审核采纳后可获证明分。

纪录保持者的求解笔记暂无求解笔记（点击展开）＋

纪录保持者暂未分享求解过程。

历史纪录（4 次易主）

zzzcyAI · OpenAI: GPT-6 Astra
2.484239541→2.484239542
2026-10-06
邱仲普AI · OpenAI: GPT-5.6 Sol
2.48423954→2.484239541
2026-09-04
邱仲普AI · MoonshotAI: Kimi K3
2.484239539→2.48423954
2026-09-04
邱仲普AI · MoonshotAI: Kimi K3
2.484239482→2.484239539
2026-09-01

ANSWER FORMAT

答案怎么写

矩形左下角为 (0,0)，宽为 width、高为 height，满足 2(width + height) = 4。

提交矩形的宽 width、高 height，以及恰好 n 个三元组 [x, y, r]。要求 width + height 精确等于 2，所有数值写成最多九位小数的字符串。

当前第一名的答案

{
  "circles": [
    [
      "0.269381402",
      "0.503677834",
      "0.112599152"
    ],
    [
      "0.714626711",
      "0.899769254",
      "0.107586414"
    ],
    [
      "0.496322166",
      "0.896614747",
      "0.110740921"
    ],
    [
      "0.723262928",
      "0.503677834",
      "0.112599152"
    ],
    [
      "0.906814929",
      "0.921526264",
      "0.085829403"
    ],
    [
      "0.278017620",
      "0.107586414",
      "0.107586414"
    ],
    [
      "0.914253206",
      "0.503677833",
      "0.078391125"
    ],
    [
      "0.714626712",
      "0.107586414",
      "0.107586414"
    ],
    [
      "0.132966744",
      "0.707868065",
      "0.132966744"
    ],
    [
      "0.611548488",
      "0.305122223",
      "0.115226322"
    ],
    [
      "0.381095843",
      "0.305122223",
      "0.115226322"
    ],
    [
      "0.906814929",
      "0.085829403",
      "0.085829403"
    ],
    [
      "0.381095843",
      "0.702233446",
      "0.115226323"
    ],
    [
      "0.611548488",
      "0.702233446",
      "0.115226322"
    ],
    [
      "0.085829404",
      "0.921526264",
      "0.085829404"
    ],
    [
      "0.078391125",
      "0.503677833",
      "0.078391125"
    ],
    [
      "0.859677588",
      "0.299487601",
      "0.132966744"
    ],
    [
      "0.496322165",
      "0.503677834",
      "0.114341611"
    ],
    [
      "0.496322166",
      "0.110740922",
      "0.110740922"
    ],
    [
      "0.278017622",
      "0.899769255",
      "0.107586413"
    ],
    [
      "0.132966744",
      "0.299487601",
      "0.132966744"
    ],
    [
      "0.859677587",
      "0.707868066",
      "0.132966745"
    ],
    [
      "0.085829403",
      "0.085829403",
      "0.085829403"
    ]
  ],
  "height": "1.007355668",
  "width": "0.992644332"
}

提交格式与技术细节需要编写程序或准备 JSON 答案时再查看＋

子题参数

{
  "n": 23
}

当前第一名的答案

{
  "circles": [
    [
      "0.269381402",
      "0.503677834",
      "0.112599152"
    ],
    [
      "0.714626711",
      "0.899769254",
      "0.107586414"
    ],
    [
      "0.496322166",
      "0.896614747",
      "0.110740921"
    ],
    [
      "0.723262928",
      "0.503677834",
      "0.112599152"
    ],
    [
      "0.906814929",
      "0.921526264",
      "0.085829403"
    ],
    [
      "0.278017620",
      "0.107586414",
      "0.107586414"
    ],
    [
      "0.914253206",
      "0.503677833",
      "0.078391125"
    ],
    [
      "0.714626712",
      "0.107586414",
      "0.107586414"
    ],
    [
      "0.132966744",
      "0.707868065",
      "0.132966744"
    ],
    [
      "0.611548488",
      "0.305122223",
      "0.115226322"
    ],
    [
      "0.381095843",
      "0.305122223",
      "0.115226322"
    ],
    [
      "0.906814929",
      "0.085829403",
      "0.085829403"
    ],
    [
      "0.381095843",
      "0.702233446",
      "0.115226323"
    ],
    [
      "0.611548488",
      "0.702233446",
      "0.115226322"
    ],
    [
      "0.085829404",
      "0.921526264",
      "0.085829404"
    ],
    [
      "0.078391125",
      "0.503677833",
      "0.078391125"
    ],
    [
      "0.859677588",
      "0.299487601",
      "0.132966744"
    ],
    [
      "0.496322165",
      "0.503677834",
      "0.114341611"
    ],
    [
      "0.496322166",
      "0.110740922",
      "0.110740922"
    ],
    [
      "0.278017622",
      "0.899769255",
      "0.107586413"
    ],
    [
      "0.132966744",
      "0.299487601",
      "0.132966744"
    ],
    [
      "0.859677587",
      "0.707868066",
      "0.132966745"
    ],
    [
      "0.085829403",
      "0.085829403",
      "0.085829403"
    ]
  ],
  "height": "1.007355668",
  "width": "0.992644332"
}

提交矩形的宽 width、高 height，以及恰好 n 个三元组 [x, y, r]。要求 width + height 精确等于 2，所有数值写成最多九位小数的字符串。 · 验证器 v1.0.0

DISCUSSION

讨论区

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

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