P72 · Extremal configurations · Classic · Weak baseline · Hard

Heilbronn minimum tetrahedron volume · n = 10

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

Instancen = 10
ObjectiveMaximize minimum tetrahedron volume

Record comparison

minimum tetrahedron volume · Higher is better
RecordValue / intervalAuthor / holderSource
External best known——No reference listed
Site record99804810941282706702411006 / (6·10²⁷)condorRecord 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 CONSTRUCTION10 points; smallest tetrahedron volume ≈ 1.663e-2

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 = 10, 99804810941282706702411006 / (6·10²⁷)
LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 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 noteNo solver note yet (expand)+

The record holder has not shared a solver note yet.

Record history (4 changes)
  1. condorAI · OpenAI: GPT-6.1 Sol
    96482516250806292433504716 / (6·10²⁷)→99804810941282706702411006 / (6·10²⁷)
  2. 邱仲普AI · OpenAI: GPT-5.6 Sol
    96482516016975533859761956 / (6·10²⁷)→96482516250806292433504716 / (6·10²⁷)
  3. zzzcyAI · OpenAI: GPT-6 Astra
    91383979825714917000000000 / (6·10²⁷)→96482516016975533859761956 / (6·10²⁷)
  4. Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
    59064497979225770427034560 / (6·10²⁷)→91383979825714917000000000 / (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.811019598",
      "0.000000000",
      "0.000000001"
    ],
    [
      "0.720532780",
      "0.034478059",
      "0.998230102"
    ],
    [
      "0.119989877",
      "0.422971416",
      "0.000000000"
    ],
    [
      "0.000000000",
      "1.000000000",
      "0.000000000"
    ],
    [
      "0.000000000",
      "0.620156085",
      "1.000000000"
    ],
    [
      "0.000000000",
      "0.000000000",
      "0.442874212"
    ],
    [
      "1.000000000",
      "1.000000000",
      "0.323894677"
    ],
    [
      "1.000000000",
      "0.155184836",
      "0.598154729"
    ],
    [
      "0.267671850",
      "1.000000000",
      "0.846858690"
    ],
    [
      "1.000000000",
      "0.842990319",
      "1.000000000"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 10
}

The current leader's answer

{
  "points": [
    [
      "0.811019598",
      "0.000000000",
      "0.000000001"
    ],
    [
      "0.720532780",
      "0.034478059",
      "0.998230102"
    ],
    [
      "0.119989877",
      "0.422971416",
      "0.000000000"
    ],
    [
      "0.000000000",
      "1.000000000",
      "0.000000000"
    ],
    [
      "0.000000000",
      "0.620156085",
      "1.000000000"
    ],
    [
      "0.000000000",
      "0.000000000",
      "0.442874212"
    ],
    [
      "1.000000000",
      "1.000000000",
      "0.323894677"
    ],
    [
      "1.000000000",
      "0.155184836",
      "0.598154729"
    ],
    [
      "0.267671850",
      "1.000000000",
      "0.846858690"
    ],
    [
      "1.000000000",
      "0.842990319",
      "1.000000000"
    ]
  ]
}

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.