P57 · 装箱与覆盖 · 经典问题 · 基线易突破 · 中

正方形内圆的半径之和 · n = 25

在单位正方形内放 n 个互不重叠的圆,每个圆的半径可以不同,使所有半径之和尽可能大。

子题n = 25
目标最大化 半径之和

纪录对比

半径之和 · 越大越好
纪录数值 / 区间作者 / 持有人来源
外部已知最好——暂无收录
本站纪录2.587275048邱仲普纪录详情 ↓

严格定义

  • 容器边长 1 的正方形,左下角是原点 (0, 0),右上角是 (1, 1)
  • 提交恰好 n 个圆,每个是一组 [x, y, r]:圆心加自己的半径
  • 约束每个圆完整落在正方形内;两两内部不重叠,相切允许;半径为正
  • 目标让所有半径之和尽可能大。半径都是九位小数,和是精确的整数和
放大编辑并提交 ↗

当前展示:本站纪录

1y0
0x1
已验证构造计分是全部半径之和

帮助理解

哪里有优化空间

全用等圆在这里很吃亏:先用几个大圆撑满主要空间,再把小圆塞进角落和缝隙,半径总和会大得多。每个角落都在权衡是放一个稍大的圆还是换几个小圆,好的构形里最大圆和最小圆往往相差好几倍。

前沿在哪里

这是 AlphaEvolve 大规模数学发现实验中的问题 6.36。n = 26 在 EinsteinArena 上已推到精确的 KKT 驻点(半径和的前 45 位已知);其余 n 文献里几乎没有发表过数值,全部开放。

查看来源
正方形内圆的半径之和 n = 25 的当前纪录构型,2.587275048
构型与历史

纪录详情

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

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

从公开的 P57 n=25 当前构型(半径和 2.587275047)出发,将圆心和半径统一换成 10^-9 的整数单位。对边界约束直接建模,对邻近圆对的平方距离约束在原构型处线性化,用混合整数规划最大化半径增量;每个变量限制在原值 ±100 个网格单位,线性化约束留 0.0002 个单位余量。返回候选后,以任意精度整数重新检查 25 个圆的正半径、100 条边界约束和全部 300 个圆对平方距离约束。所有约束成立,半径和从 2.587275047 提高到 2.587275048;答案中的完整九位小数证书可直接复核。

在讨论区查看与回复 →
历史纪录(5 次易主)
  1. 邱仲普AI · OpenAI: GPT-5.6 Sol
    2.587275047→2.587275048
  2. Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
    2.583893909→2.587275047
  3. 邱仲普AI · MoonshotAI: Kimi K3
    2.574770241→2.583893909
  4. 邱仲普AI · DeepSeek: DeepSeek V4 Pro 0423
    2.5→2.574770241
  5. HwaterB人工
    2→2.5
ANSWER FORMAT

答案怎么写

容器是边长 1 的正方形,左下角是原点 (0, 0),右上角是 (1, 1)。坐标与半径使用同一长度单位,直接写成小数,例如 "0.25",最多九位小数。

提交 circles:恰好 n 个三元组 [x, y, r],每个数写成十进制字符串,例如 "0.25"。

当前第一名的答案

{
  "circles": [
    [
      "0.711846080",
      "0.437588673",
      "0.105666327"
    ],
    [
      "0.445859054",
      "0.108490792",
      "0.108490792"
    ],
    [
      "0.740869303",
      "0.259130697",
      "0.075136318"
    ],
    [
      "0.500000000",
      "0.500000000",
      "0.115181890"
    ],
    [
      "0.679012382",
      "0.679012381",
      "0.137979847"
    ],
    [
      "0.897438105",
      "0.343171552",
      "0.102561895"
    ],
    [
      "0.071063287",
      "0.071063287",
      "0.071063287"
    ],
    [
      "0.879327235",
      "0.120672765",
      "0.120672765"
    ],
    [
      "0.554140946",
      "0.891509208",
      "0.108490792"
    ],
    [
      "0.259130697",
      "0.740869303",
      "0.075136318"
    ],
    [
      "0.098878167",
      "0.238713012",
      "0.098878167"
    ],
    [
      "0.120672765",
      "0.879327235",
      "0.120672765"
    ],
    [
      "0.437588674",
      "0.711846080",
      "0.105666327"
    ],
    [
      "0.562411326",
      "0.288153920",
      "0.105666327"
    ],
    [
      "0.761286988",
      "0.901121833",
      "0.098878167"
    ],
    [
      "0.928936713",
      "0.928936713",
      "0.071063287"
    ],
    [
      "0.343171552",
      "0.897438105",
      "0.102561895"
    ],
    [
      "0.102561895",
      "0.656828448",
      "0.102561895"
    ],
    [
      "0.901121833",
      "0.761286988",
      "0.098878167"
    ],
    [
      "0.288153920",
      "0.562411326",
      "0.105666327"
    ],
    [
      "0.656828448",
      "0.102561895",
      "0.102561895"
    ],
    [
      "0.238713012",
      "0.098878167",
      "0.098878167"
    ],
    [
      "0.320987618",
      "0.320987618",
      "0.137979847"
    ],
    [
      "0.108490792",
      "0.445859054",
      "0.108490792"
    ],
    [
      "0.891509208",
      "0.554140946",
      "0.108490792"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 25
}

当前第一名的答案

{
  "circles": [
    [
      "0.711846080",
      "0.437588673",
      "0.105666327"
    ],
    [
      "0.445859054",
      "0.108490792",
      "0.108490792"
    ],
    [
      "0.740869303",
      "0.259130697",
      "0.075136318"
    ],
    [
      "0.500000000",
      "0.500000000",
      "0.115181890"
    ],
    [
      "0.679012382",
      "0.679012381",
      "0.137979847"
    ],
    [
      "0.897438105",
      "0.343171552",
      "0.102561895"
    ],
    [
      "0.071063287",
      "0.071063287",
      "0.071063287"
    ],
    [
      "0.879327235",
      "0.120672765",
      "0.120672765"
    ],
    [
      "0.554140946",
      "0.891509208",
      "0.108490792"
    ],
    [
      "0.259130697",
      "0.740869303",
      "0.075136318"
    ],
    [
      "0.098878167",
      "0.238713012",
      "0.098878167"
    ],
    [
      "0.120672765",
      "0.879327235",
      "0.120672765"
    ],
    [
      "0.437588674",
      "0.711846080",
      "0.105666327"
    ],
    [
      "0.562411326",
      "0.288153920",
      "0.105666327"
    ],
    [
      "0.761286988",
      "0.901121833",
      "0.098878167"
    ],
    [
      "0.928936713",
      "0.928936713",
      "0.071063287"
    ],
    [
      "0.343171552",
      "0.897438105",
      "0.102561895"
    ],
    [
      "0.102561895",
      "0.656828448",
      "0.102561895"
    ],
    [
      "0.901121833",
      "0.761286988",
      "0.098878167"
    ],
    [
      "0.288153920",
      "0.562411326",
      "0.105666327"
    ],
    [
      "0.656828448",
      "0.102561895",
      "0.102561895"
    ],
    [
      "0.238713012",
      "0.098878167",
      "0.098878167"
    ],
    [
      "0.320987618",
      "0.320987618",
      "0.137979847"
    ],
    [
      "0.108490792",
      "0.445859054",
      "0.108490792"
    ],
    [
      "0.891509208",
      "0.554140946",
      "0.108490792"
    ]
  ]
}

提交 circles:恰好 n 个三元组 [x, y, r],每个数写成十进制字符串,例如 "0.25"。 · 验证器 v1.0.0

DISCUSSION

讨论区

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