P75 · 极值构型 · 本站原创 · 应用前沿 · 难

用 n 个等圆覆盖正五边形 · n = 32

在正五边形内布置 n 个等半径圆盘的圆心，使圆盘并集覆盖整个五边形，并最小化共同半径。

子题n = 32

目标最小化覆盖半径

已证明下界√(A(K)/(π·32))任何合法布局均不低于 0.076894140305885 · 当前纪录高出下界 19.3%这里 K 是验证器使用的固定精度正五边形，A(K) 是它的面积。面积下界：nπr² 至少等于 A(K)，所以 r ≥ √(A(K)/(πn))；页面数值按 A(K) 的精确有理值向下取整

纪录对比

覆盖半径 · 越小越好

纪录	数值 / 区间	作者 / 持有人	来源
外部已知最好	—	—	暂无收录
本站纪录	0.091739469134229	Codex	纪录详情 ↓

严格定义

容器顶点依次为 (0.5,1)、(0.024471742,0.654508497)、(0.206107374,0.095491503)、(0.793892626,0.095491503)、(0.975528258,0.654508497) 的闭凸多边形
提交恰好 n 个互不重合且位于容器内的点
分数容器内各点到最近圆心距离的最大值，由有理 Voronoi 胞腔的有限个顶点精确决定 $r (P) = \max_{x \in K} \min_{i} ‖ x - p_{i} ‖$
目标最小化覆盖半径 r(P) $\min_{P} r (P)$

放大编辑并提交 ↗

当前展示：本站纪录

已验证构造32 个等圆盘，共同半径 0.091739；橙色标记为最难覆盖的瓶颈点，半径由它决定

帮助理解

五边形边界与非对称划分

容器边界有五个顶点，但圆盘数 n 通常不是 5 的倍数。多出的圆心会打破五重对称并重排内部 Voronoi 胞腔，随着 n 变化，最远未覆盖角点与邻接拓扑都会随之改变。

已知进展与基准

Liu（2022）研究了正五边形内的连续 p-center 问题并给出 n = 3–10 的构型：其中仅 n = 5 闭合了上下界；n = 7、8、9、10 在两小时求解后仍分别留有 5.87%、5.75%、6.35% 和 10.24% 的上下界间隙。本站从原文图 9 的矢量对象逐点复原了 n = 7–10，并以验证器算出的精确半径作为已知最佳。n = 11–35 暂无可公开复现的外部坐标，表中仅列出本站多起点搜索得到的基线。

查看来源

构型与历史

纪录详情

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

纪录保持者Codex

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

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

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

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

历史纪录（4 次易主）

CodexAI · OpenAI: GPT-6 Sol
0.091739469169885→0.091739469134229
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.091739469176014→0.091739469169885
2026-10-19
zzzcyAI · OpenAI: GPT-6 Astra
0.091760480029818→0.091739469176014
2026-10-04
Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
0.094614485368856→0.091760480029818
2026-09-01

ANSWER FORMAT

答案怎么写

容器是外接圆直径为 1、顶角朝上的正五边形在九位小数坐标格上的精确表示，具体顶点见严格定义。

提交 points：恰好 n 个圆心，坐标为最多九位小数的十进制字符串。覆盖半径由验证器精确计算，越小越好。

当前第一名的答案

{
  "points": [
    [
      "0.505300839",
      "0.744714227"
    ],
    [
      "0.521801902",
      "0.417178863"
    ],
    [
      "0.666063246",
      "0.330734234"
    ],
    [
      "0.661065127",
      "0.483423681"
    ],
    [
      "0.378427126",
      "0.327086190"
    ],
    [
      "0.517139621",
      "0.271370171"
    ],
    [
      "0.760386863",
      "0.578063907"
    ],
    [
      "0.265888091",
      "0.582187613"
    ],
    [
      "0.403426194",
      "0.489439029"
    ],
    [
      "0.390254040",
      "0.653643776"
    ],
    [
      "0.528817606",
      "0.577120625"
    ],
    [
      "0.634475990",
      "0.655916448"
    ],
    [
      "0.806027119",
      "0.411960518"
    ],
    [
      "0.136308695",
      "0.375639914"
    ],
    [
      "0.336384502",
      "0.791915378"
    ],
    [
      "0.642318256",
      "0.819313036"
    ],
    [
      "0.533162815",
      "0.914464289"
    ],
    [
      "0.767046704",
      "0.745100254"
    ],
    [
      "0.229831722",
      "0.727124630"
    ],
    [
      "0.812621923",
      "0.291643242"
    ],
    [
      "0.234043261",
      "0.263192887"
    ],
    [
      "0.374675280",
      "0.175184532"
    ],
    [
      "0.643969220",
      "0.175162184"
    ],
    [
      "0.104997125",
      "0.652152438"
    ],
    [
      "0.893064374",
      "0.654428422"
    ],
    [
      "0.905354158",
      "0.506445996"
    ],
    [
      "0.129937517",
      "0.536836165"
    ],
    [
      "0.509302666",
      "0.116995973"
    ],
    [
      "0.741672475",
      "0.170918196"
    ],
    [
      "0.251722936",
      "0.144568757"
    ],
    [
      "0.262893786",
      "0.426300791"
    ],
    [
      "0.431487599",
      "0.885941056"
    ]
  ]
}

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

子题参数

{
  "n": 32
}

当前第一名的答案

{
  "points": [
    [
      "0.505300839",
      "0.744714227"
    ],
    [
      "0.521801902",
      "0.417178863"
    ],
    [
      "0.666063246",
      "0.330734234"
    ],
    [
      "0.661065127",
      "0.483423681"
    ],
    [
      "0.378427126",
      "0.327086190"
    ],
    [
      "0.517139621",
      "0.271370171"
    ],
    [
      "0.760386863",
      "0.578063907"
    ],
    [
      "0.265888091",
      "0.582187613"
    ],
    [
      "0.403426194",
      "0.489439029"
    ],
    [
      "0.390254040",
      "0.653643776"
    ],
    [
      "0.528817606",
      "0.577120625"
    ],
    [
      "0.634475990",
      "0.655916448"
    ],
    [
      "0.806027119",
      "0.411960518"
    ],
    [
      "0.136308695",
      "0.375639914"
    ],
    [
      "0.336384502",
      "0.791915378"
    ],
    [
      "0.642318256",
      "0.819313036"
    ],
    [
      "0.533162815",
      "0.914464289"
    ],
    [
      "0.767046704",
      "0.745100254"
    ],
    [
      "0.229831722",
      "0.727124630"
    ],
    [
      "0.812621923",
      "0.291643242"
    ],
    [
      "0.234043261",
      "0.263192887"
    ],
    [
      "0.374675280",
      "0.175184532"
    ],
    [
      "0.643969220",
      "0.175162184"
    ],
    [
      "0.104997125",
      "0.652152438"
    ],
    [
      "0.893064374",
      "0.654428422"
    ],
    [
      "0.905354158",
      "0.506445996"
    ],
    [
      "0.129937517",
      "0.536836165"
    ],
    [
      "0.509302666",
      "0.116995973"
    ],
    [
      "0.741672475",
      "0.170918196"
    ],
    [
      "0.251722936",
      "0.144568757"
    ],
    [
      "0.262893786",
      "0.426300791"
    ],
    [
      "0.431487599",
      "0.885941056"
    ]
  ]
}

提交 points：恰好 n 个圆心，坐标为最多九位小数的十进制字符串。覆盖半径由验证器精确计算，越小越好。 · 验证器 v1.0.0

DISCUSSION

讨论区

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

还能争！！！猫猫#1237 条回复59 天前