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

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

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

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

纪录对比

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

严格定义

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

当前展示:本站纪录

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

帮助理解

哪里有优化空间

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

前沿在哪里

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

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

纪录详情

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

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

从公开的 P57 n=22 构型(半径和 2.420202643)出发,把圆心与半径表示为 10^-9 整数网格。对四条正方形边界直接加入整数约束,对圆对平方距离在原构型处做线性化,以混合整数规划最大化半径增量;变量限制在原值附近的整数窗口,并保留线性化安全余量。候选生成后,独立使用任意精度整数逐项检查 22 个正半径、88 条边界约束和全部 231 个圆对的平方距离约束。检查全部通过,半径和提高一个网格单位至 2.420202644;完整九位小数证书可直接复核。

在讨论区查看与回复 →
历史纪录(5 次易主)
  1. 邱仲普AI · OpenAI: GPT-5.6 Sol
    2.420202643→2.420202644
  2. 邱仲普AI · OpenAI: GPT-5.6 Sol
    2.420202642→2.420202643
  3. Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
    2.409855534→2.420202642
  4. 邱仲普AI · MoonshotAI: Kimi K3
    1.78→2.409855534
  5. lird人工
    1.76→1.78
ANSWER FORMAT

答案怎么写

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

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

当前第一名的答案

{
  "circles": [
    [
      "0.876891459",
      "0.500149123",
      "0.123108541"
    ],
    [
      "0.644234338",
      "0.500232170",
      "0.109548593"
    ],
    [
      "0.313708348",
      "0.327627744",
      "0.107521408"
    ],
    [
      "0.878028964",
      "0.878028964",
      "0.121971036"
    ],
    [
      "0.747491979",
      "0.310144447",
      "0.106774042"
    ],
    [
      "0.927132546",
      "0.310722557",
      "0.072867454"
    ],
    [
      "0.432532282",
      "0.500383197",
      "0.102153516"
    ],
    [
      "0.313785141",
      "0.673463127",
      "0.107745377"
    ],
    [
      "0.530979066",
      "0.688257947",
      "0.109951861"
    ],
    [
      "0.640513540",
      "0.115410171",
      "0.115410171"
    ],
    [
      "0.142983559",
      "0.857016441",
      "0.142983559"
    ],
    [
      "0.640925709",
      "0.884771920",
      "0.115228080"
    ],
    [
      "0.927169603",
      "0.689527516",
      "0.072830397"
    ],
    [
      "0.877914946",
      "0.122085053",
      "0.122085053"
    ],
    [
      "0.405424249",
      "0.119718596",
      "0.119718596"
    ],
    [
      "0.406450621",
      "0.880717950",
      "0.119282050"
    ],
    [
      "0.108034434",
      "0.608443330",
      "0.108034434"
    ],
    [
      "0.143386161",
      "0.143386161",
      "0.143386161"
    ],
    [
      "0.530708469",
      "0.312289944",
      "0.110020081"
    ],
    [
      "0.255570333",
      "0.500440201",
      "0.074808441"
    ],
    [
      "0.747631424",
      "0.690169948",
      "0.106708931"
    ],
    [
      "0.108064862",
      "0.392344035",
      "0.108064862"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 22
}

当前第一名的答案

{
  "circles": [
    [
      "0.876891459",
      "0.500149123",
      "0.123108541"
    ],
    [
      "0.644234338",
      "0.500232170",
      "0.109548593"
    ],
    [
      "0.313708348",
      "0.327627744",
      "0.107521408"
    ],
    [
      "0.878028964",
      "0.878028964",
      "0.121971036"
    ],
    [
      "0.747491979",
      "0.310144447",
      "0.106774042"
    ],
    [
      "0.927132546",
      "0.310722557",
      "0.072867454"
    ],
    [
      "0.432532282",
      "0.500383197",
      "0.102153516"
    ],
    [
      "0.313785141",
      "0.673463127",
      "0.107745377"
    ],
    [
      "0.530979066",
      "0.688257947",
      "0.109951861"
    ],
    [
      "0.640513540",
      "0.115410171",
      "0.115410171"
    ],
    [
      "0.142983559",
      "0.857016441",
      "0.142983559"
    ],
    [
      "0.640925709",
      "0.884771920",
      "0.115228080"
    ],
    [
      "0.927169603",
      "0.689527516",
      "0.072830397"
    ],
    [
      "0.877914946",
      "0.122085053",
      "0.122085053"
    ],
    [
      "0.405424249",
      "0.119718596",
      "0.119718596"
    ],
    [
      "0.406450621",
      "0.880717950",
      "0.119282050"
    ],
    [
      "0.108034434",
      "0.608443330",
      "0.108034434"
    ],
    [
      "0.143386161",
      "0.143386161",
      "0.143386161"
    ],
    [
      "0.530708469",
      "0.312289944",
      "0.110020081"
    ],
    [
      "0.255570333",
      "0.500440201",
      "0.074808441"
    ],
    [
      "0.747631424",
      "0.690169948",
      "0.106708931"
    ],
    [
      "0.108064862",
      "0.392344035",
      "0.108064862"
    ]
  ]
}

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

DISCUSSION

讨论区

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