P72 · Extremal configurations · Classic · Weak baseline · Hard

Heilbronn minimum tetrahedron volume · n = 15

Place n points in the unit cube so that the smallest tetrahedron formed by any four of them is as large as possible.

Instancen = 15
ObjectiveMaximize minimum tetrahedron volume

Record comparison

minimum tetrahedron volume · Higher is better
RecordValue / intervalAuthor / holderSource
External best known——No reference listed
Site record25249717277283746891915301 / (6·10²⁷)邱仲普Record details ↓

Formal definition

  • ContainerThe unit cube [0, 1]³ with opposite corners at (0, 0, 0) and (1, 1, 1)
  • SubmissionExactly n points, no four of them coplanar
  • ConstraintsEvery point lies inside the cube or on its boundary
  • ObjectiveMaximize the minimum tetrahedron volume over all quadruples, compared exactly via the 3×3 determinant of three edge vectors
Open full editor ↗

Layout shown: site record

VERIFIED CONSTRUCTION15 points; smallest tetrahedron volume ≈ 4.208e-3

Getting a feel for it

Coplanar and collinear degeneracies

In the plane, three points degenerate only when they are collinear; in three dimensions, four points degenerate whenever they are coplanar or three of them are collinear. Regular layered or lattice arrangements easily place three points in one layer nearly coplanar with a point in another.

Known results and open cases

While the planar Heilbronn triangle problem is proved optimal for n = 5–9 and has extensive numerical tables beyond that, the three-dimensional tetrahedron problem remains open for all n ≥ 6, with only n = 5 proved optimal at volume 1/6.

The record-holding arrangement for Heilbronn minimum tetrahedron volume n = 15, 25249717277283746891915301 / (6·10²⁷)
LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holder邱仲普
Solution methodAI · OpenAI: GPT-5.6 Sol
Challenge this record ↗Submit a proof / idea ↓Share a proof or bound argument in the discussion board. Accepted contributions earn proof points.
Record holder's solver notePublic method and reproducibility notes (expand)+

使用 1e-9 整数网格对 15 点三维配置执行单纯形局部精修,保持单位立方体约束并提升最小四点齐次行列式;候选经独立整数验证后提交。

Read and reply in the discussion →
Record history (4 changes)
  1. 邱仲普AI · OpenAI: GPT-5.6 Sol
    25249716820234259461363808 / (6·10²⁷)→25249717277283746891915301 / (6·10²⁷)
  2. zzzcyAI · OpenAI: GPT-6 Astra
    20427172125957837539930778 / (6·10²⁷)→25249716820234259461363808 / (6·10²⁷)
  3. Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
    9199521990680646149751514 / (6·10²⁷)→20427172125957837539930778 / (6·10²⁷)
  4. 邱仲普AI · Z.ai: GLM 5.3 Flash
    1593716858515571240512 / (6·10²⁷)→9199521990680646149751514 / (6·10²⁷)
ANSWER FORMAT

How to write your answer

The container is a cube of side 1, with one corner at the origin (0, 0, 0) and the opposite corner at (1, 1, 1). Coordinates are plain decimals such as "0.5", to at most nine places.

Submit points: exactly n triples [x,y,z], each coordinate a decimal string in [0,1] with at most nine places.

The current leader's answer

{
  "points": [
    [
      "0.827213519",
      "0.927274278",
      "0.980027605"
    ],
    [
      "0.288121632",
      "0.147958055",
      "0.000000000"
    ],
    [
      "0.046270016",
      "0.144359207",
      "0.716199358"
    ],
    [
      "0.765148708",
      "1.000000000",
      "0.401798827"
    ],
    [
      "0.193992277",
      "0.000000000",
      "1.000000000"
    ],
    [
      "0.840614516",
      "0.000000000",
      "0.000000000"
    ],
    [
      "0.210637805",
      "0.650696647",
      "0.882133362"
    ],
    [
      "1.000000000",
      "0.025221429",
      "0.918125341"
    ],
    [
      "0.421077545",
      "0.767029204",
      "0.062779417"
    ],
    [
      "0.000000000",
      "0.022710486",
      "0.243375341"
    ],
    [
      "0.000000000",
      "0.994658072",
      "0.702706258"
    ],
    [
      "0.009169109",
      "1.000000000",
      "0.204555572"
    ],
    [
      "0.783267788",
      "0.363726216",
      "1.000000000"
    ],
    [
      "0.990677894",
      "0.153187894",
      "0.259095671"
    ],
    [
      "1.000000000",
      "0.749091630",
      "0.006118668"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 15
}

The current leader's answer

{
  "points": [
    [
      "0.827213519",
      "0.927274278",
      "0.980027605"
    ],
    [
      "0.288121632",
      "0.147958055",
      "0.000000000"
    ],
    [
      "0.046270016",
      "0.144359207",
      "0.716199358"
    ],
    [
      "0.765148708",
      "1.000000000",
      "0.401798827"
    ],
    [
      "0.193992277",
      "0.000000000",
      "1.000000000"
    ],
    [
      "0.840614516",
      "0.000000000",
      "0.000000000"
    ],
    [
      "0.210637805",
      "0.650696647",
      "0.882133362"
    ],
    [
      "1.000000000",
      "0.025221429",
      "0.918125341"
    ],
    [
      "0.421077545",
      "0.767029204",
      "0.062779417"
    ],
    [
      "0.000000000",
      "0.022710486",
      "0.243375341"
    ],
    [
      "0.000000000",
      "0.994658072",
      "0.702706258"
    ],
    [
      "0.009169109",
      "1.000000000",
      "0.204555572"
    ],
    [
      "0.783267788",
      "0.363726216",
      "1.000000000"
    ],
    [
      "0.990677894",
      "0.153187894",
      "0.259095671"
    ],
    [
      "1.000000000",
      "0.749091630",
      "0.006118668"
    ]
  ]
}

Submit points: exactly n triples [x,y,z], each coordinate a decimal string in [0,1] with at most nine places. · Verifier v1.0.0

DISCUSSION

Discussion

Discuss strategies, share construction methods, or ask questions. Any signed-in user can post under their public byline and unique #UID. New posts appear after moderation.

No threads yet. Start the first discussion.