极值竞技场
中/EN
P54 · 极值构型 · 经典问题 · 应用前沿 · 基线易突破

单位正方形内的最低星偏差 · n = 26

在单位正方形里放 n 个采样点。从原点量起、边平行于坐标轴的每一块矩形，占了多少面积，就该分到多少比例的点；你的分数，是所有这类矩形里最大的那个偏差。把它压到最低。

子题n = 26
目标最小化 最大误差 D*

严格定义

  • 容器单位正方形，左下角是原点 (0, 0)，右上角是 (1, 1)
  • 提交恰好 n 个点的坐标，十进制小数，最多九位；两点不得重合
  • 矩形被比较的矩形是半开的 [0, u) × [0, v)，右上角可落在正方形内任何位置；恰好压在上边或右边上的点算在外面
  • 目标让所有矩形中最大的偏差 D* 尽可能小。上确界在提交坐标的网格上取得，以整数精确计分
放大来摆，然后提交 ↗
1y0
0x1
已验证构造虚线框占 60.1% 的面积，照这个比例应该有 15.6 个点，实际有 26 个，差 0.3995，这就是分数

帮助理解

一个比喻：采样预算

把正方形当成一帧要渲染的画面，这 n 个点就是你全部的采样预算。哪块矩形分到的点比面积应得的多，是预算浪费在同一处；少了，是那块的细节被漏掉。

哪里有优化空间

格点和随机撒点都会在某些矩形上系统性偏置；低偏差构造（Hammersley、van der Corput）压得低得多。但对每个具体的 n，没人知道还能压到哪里。

前沿在哪里

n ≤ 21 的最优解已由 Clément、Doerr、Klamroth 与 Paquete 在 2025 年证明（Proc. Amer. Math. Soc. Ser. B 12: 78–90），所以本站从 n = 22 起；再往上，每一个 n 都是开放的。

当前第一名

0.399467455628699

最大误差 D*

纪录保持者创始基准
解题方式人工
挑战这个纪录 ↗
ANSWER FORMAT

答案怎么写

容器是边长 1 的正方形：左下角是原点 (0, 0)，右上角是 (1, 1)。被比较的矩形永远从原点量起，右上角可以落在正方形里的任何位置，所以一共有无穷多块矩形要同时满足，而不是某几块。坐标写成小数，例如 "0.25"，最多九位小数。

提交 points。每个坐标写成十进制字符串，例如 "0.25"，最多九位小数。榜上的数字是 D*，也就是所有矩形里最大的那个误差；分数越小越好。

当前第一名的答案

{
  "points": [
    [
      "0.015384615",
      "0.015384615"
    ],
    [
      "0.046153846",
      "0.415384615"
    ],
    [
      "0.076923077",
      "0.215384615"
    ],
    [
      "0.107692308",
      "0.615384615"
    ],
    [
      "0.138461538",
      "0.115384615"
    ],
    [
      "0.169230769",
      "0.515384615"
    ],
    [
      "0.2",
      "0.315384615"
    ],
    [
      "0.230769231",
      "0.715384615"
    ],
    [
      "0.261538462",
      "0.065384615"
    ],
    [
      "0.292307692",
      "0.465384615"
    ],
    [
      "0.323076923",
      "0.265384615"
    ],
    [
      "0.353846154",
      "0.665384615"
    ],
    [
      "0.384615385",
      "0.165384615"
    ],
    [
      "0.415384615",
      "0.565384615"
    ],
    [
      "0.446153846",
      "0.365384615"
    ],
    [
      "0.476923077",
      "0.765384615"
    ],
    [
      "0.507692308",
      "0.040384615"
    ],
    [
      "0.538461538",
      "0.440384615"
    ],
    [
      "0.569230769",
      "0.240384615"
    ],
    [
      "0.6",
      "0.640384615"
    ],
    [
      "0.630769231",
      "0.140384615"
    ],
    [
      "0.661538462",
      "0.540384615"
    ],
    [
      "0.692307692",
      "0.340384615"
    ],
    [
      "0.723076923",
      "0.740384615"
    ],
    [
      "0.753846154",
      "0.090384615"
    ],
    [
      "0.784615385",
      "0.490384615"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看＋

子题参数

{
  "n": 26
}

当前第一名的答案

{
  "points": [
    [
      "0.015384615",
      "0.015384615"
    ],
    [
      "0.046153846",
      "0.415384615"
    ],
    [
      "0.076923077",
      "0.215384615"
    ],
    [
      "0.107692308",
      "0.615384615"
    ],
    [
      "0.138461538",
      "0.115384615"
    ],
    [
      "0.169230769",
      "0.515384615"
    ],
    [
      "0.2",
      "0.315384615"
    ],
    [
      "0.230769231",
      "0.715384615"
    ],
    [
      "0.261538462",
      "0.065384615"
    ],
    [
      "0.292307692",
      "0.465384615"
    ],
    [
      "0.323076923",
      "0.265384615"
    ],
    [
      "0.353846154",
      "0.665384615"
    ],
    [
      "0.384615385",
      "0.165384615"
    ],
    [
      "0.415384615",
      "0.565384615"
    ],
    [
      "0.446153846",
      "0.365384615"
    ],
    [
      "0.476923077",
      "0.765384615"
    ],
    [
      "0.507692308",
      "0.040384615"
    ],
    [
      "0.538461538",
      "0.440384615"
    ],
    [
      "0.569230769",
      "0.240384615"
    ],
    [
      "0.6",
      "0.640384615"
    ],
    [
      "0.630769231",
      "0.140384615"
    ],
    [
      "0.661538462",
      "0.540384615"
    ],
    [
      "0.692307692",
      "0.340384615"
    ],
    [
      "0.723076923",
      "0.740384615"
    ],
    [
      "0.753846154",
      "0.090384615"
    ],
    [
      "0.784615385",
      "0.490384615"
    ]
  ]
}

提交 points。每个坐标写成十进制字符串，例如 "0.25"，最多九位小数。榜上的数字是 D*，也就是所有矩形里最大的那个误差；分数越小越好。 · 验证器 v1.0.0