P01 · 装箱与覆盖 · 经典问题

单位正方形内的等圆装箱 · n = 24

在边长 1 的正方形内放置 n 个半径相同、互不重叠的圆，使共同半径尽可能大。

子题n = 24

目标最大化共同半径

已证明最优0.1013818值取自 Eckard Specht 的汇总表，粗体半径表示已证明最优

已完成已经有达到上限的答案，这道子题没有可争的了

严格定义

容器单位正方形：左下角是原点 (0, 0)，右上角是 (1, 1)
提交恰好 n 个圆：一个共同半径 radius 与 n 个圆心 centers
约束每个圆完整落在容器内；两两内部不重叠，相切允许
目标让共同半径尽可能大

打开编辑器看看 ↗

1y0

123456789101112131415161718192021222324

0x1

已验证构造r = 0.101381800

帮助理解

哪里有优化空间

最优构形是「卡死」的接触结构：圆彼此顶住、顶住边界，常出现斜排、错位、以及不碰任何邻居的游离圆。规整的网格摆法几乎从不最优。

前沿在哪里

这三十个 n 全部已证明，最优构形也已直接展示，整题作为已完成陈列，不再接受破纪录；csq 表往上收录到几百个 n，真正的前沿在那里。

查看来源

当前第一名

0.101381800

共同半径

已达最优最优值已证明，无法再提升

纪录保持者参考答案

解题方式—

挑战这个纪录 ↗

ANSWER FORMAT

答案怎么写

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

提交 radius 与 centers。每个数写成十进制字符串，例如 "0.25"。

当前第一名的答案

{
  "centers": [
    [
      "0.1013818",
      "0.1013818"
    ],
    [
      "0.304145401",
      "0.1013818"
    ],
    [
      "0.695854599",
      "0.1013818"
    ],
    [
      "0.8986182",
      "0.1013818"
    ],
    [
      "0.5",
      "0.153860882"
    ],
    [
      "0.1013818",
      "0.304145401"
    ],
    [
      "0.304145401",
      "0.304145401"
    ],
    [
      "0.695854599",
      "0.304145401"
    ],
    [
      "0.8986182",
      "0.304145401"
    ],
    [
      "0.5",
      "0.356624483"
    ],
    [
      "0.1013818",
      "0.506909002"
    ],
    [
      "0.304145401",
      "0.506909002"
    ],
    [
      "0.695854599",
      "0.506909002"
    ],
    [
      "0.8986182",
      "0.506909002"
    ],
    [
      "0.5",
      "0.559388084"
    ],
    [
      "0.153860882",
      "0.702763601"
    ],
    [
      "0.356624483",
      "0.702763601"
    ],
    [
      "0.643375517",
      "0.702763601"
    ],
    [
      "0.846139118",
      "0.702763601"
    ],
    [
      "0.5",
      "0.846139118"
    ],
    [
      "0.1013818",
      "0.8986182"
    ],
    [
      "0.304145401",
      "0.8986182"
    ],
    [
      "0.695854599",
      "0.8986182"
    ],
    [
      "0.8986182",
      "0.8986182"
    ]
  ],
  "radius": "0.1013818"
}

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

子题参数

{
  "n": 24
}

当前第一名的答案

{
  "centers": [
    [
      "0.1013818",
      "0.1013818"
    ],
    [
      "0.304145401",
      "0.1013818"
    ],
    [
      "0.695854599",
      "0.1013818"
    ],
    [
      "0.8986182",
      "0.1013818"
    ],
    [
      "0.5",
      "0.153860882"
    ],
    [
      "0.1013818",
      "0.304145401"
    ],
    [
      "0.304145401",
      "0.304145401"
    ],
    [
      "0.695854599",
      "0.304145401"
    ],
    [
      "0.8986182",
      "0.304145401"
    ],
    [
      "0.5",
      "0.356624483"
    ],
    [
      "0.1013818",
      "0.506909002"
    ],
    [
      "0.304145401",
      "0.506909002"
    ],
    [
      "0.695854599",
      "0.506909002"
    ],
    [
      "0.8986182",
      "0.506909002"
    ],
    [
      "0.5",
      "0.559388084"
    ],
    [
      "0.153860882",
      "0.702763601"
    ],
    [
      "0.356624483",
      "0.702763601"
    ],
    [
      "0.643375517",
      "0.702763601"
    ],
    [
      "0.846139118",
      "0.702763601"
    ],
    [
      "0.5",
      "0.846139118"
    ],
    [
      "0.1013818",
      "0.8986182"
    ],
    [
      "0.304145401",
      "0.8986182"
    ],
    [
      "0.695854599",
      "0.8986182"
    ],
    [
      "0.8986182",
      "0.8986182"
    ]
  ],
  "radius": "0.1013818"
}

提交 radius 与 centers。每个数写成十进制字符串，例如 "0.25"。 · 验证器 v1.0.0