P72 · Extremal configurations · Classic · Weak baseline

Heilbronn minimum tetrahedron volume · n = 5

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

Instancen = 5

ObjectiveMaximize minimum tetrahedron volume

Record comparison

minimum tetrahedron volume · Higher is better

Record	Value / interval	Author / holder	Source
Proven optimum	1/6	NUE_13 #31	MinMax Arena ↗
Site record	1000000000000000000000000000 / (6·10²⁷)	邱仲普	Record details ↓

The continuous optimum is proved, so competition submissions are closed. Historical records and contribution points are retained. Because finite-decimal coordinates cannot attain this value exactly, the current certificate is not claimed optimal on the nine-decimal grid.

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

Read the optimality proof ↗

Layout shown: site record

VERIFIED CONSTRUCTION5 points; smallest tetrahedron volume ≈ 1.667e-1

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.

LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holder邱仲普

Solution methodAI · DeepSeek: DeepSeek V4 Pro 0423

Proven optimumSubmit a proof / idea ↓Share a proof or bound argument in the discussion board. Accepted contributions earn proof points.Read the published proof ↗

Record holder's solver noteNo solver note yet (expand)＋

The record holder has not shared a solver note yet.

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",
      "1",
      "0"
    ],
    [
      "0",
      "0",
      "1"
    ],
    [
      "1",
      "0",
      "0"
    ],
    [
      "1",
      "1",
      "0"
    ],
    [
      "1",
      "1",
      "1"
    ]
  ]
}

Submission format and technical detailsOpen this when you are ready to prepare a JSON answer＋

Instance parameters

{
  "n": 5
}

The current leader's answer

{
  "points": [
    [
      "0",
      "1",
      "0"
    ],
    [
      "0",
      "0",
      "1"
    ],
    [
      "1",
      "0",
      "0"
    ],
    [
      "1",
      "1",
      "0"
    ],
    [
      "1",
      "1",
      "1"
    ]
  ]
}

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.