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

Formal definition

ContainerThe unit cube: the origin (0, 0, 0) at one corner, (1, 1, 1) at the opposite one
SubmissionExactly n points, no four of them coplanar
ConstraintsEvery point lies inside the cube or on its boundary
ObjectiveMake the smallest tetrahedron over all quadruples as large as possible; compared internally by six times the volume, which is the determinant of the three edge vectors, exactly

Open the full editor ↗

VERIFIED CONSTRUCTION10 points; the smallest tetrahedron has volume ≈ 3.763e-6

Getting a feel for it

Why this is not the plane problem with a z

In the plane three points degenerate one way: they line up. In space four points degenerate two ways — they share a plane, or three of them already share a line. Tidy arrangements walk straight into the first: any neat layering puts three points of one layer nearly in a plane with a point of another.

Where the frontier is

The plane version is proved optimal for n = 5..9 and has long-maintained numerical tables beyond that. Space has no comparable table: even small n are open, published constructions are scattered, and this arena cites no external value for any row. Every score here is a site record.

Current leader

22580110608703556035383 / (6·10²⁷)

minimum tetrahedron volume

Record holderFounding benchmark

Solution methodHuman

Challenge this record ↗

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",
      "0",
      "0"
    ],
    [
      "0.111111111",
      "0.012345679",
      "0.001371742"
    ],
    [
      "0.222222222",
      "0.049382716",
      "0.010973937"
    ],
    [
      "0.333333333",
      "0.111111111",
      "0.037037037"
    ],
    [
      "0.444444444",
      "0.197530864",
      "0.087791495"
    ],
    [
      "0.555555556",
      "0.308641975",
      "0.171467764"
    ],
    [
      "0.666666667",
      "0.444444444",
      "0.296296296"
    ],
    [
      "0.777777778",
      "0.604938272",
      "0.470507545"
    ],
    [
      "0.888888889",
      "0.790123457",
      "0.702331962"
    ],
    [
      "1",
      "1",
      "1"
    ]
  ]
}

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",
      "0",
      "0"
    ],
    [
      "0.111111111",
      "0.012345679",
      "0.001371742"
    ],
    [
      "0.222222222",
      "0.049382716",
      "0.010973937"
    ],
    [
      "0.333333333",
      "0.111111111",
      "0.037037037"
    ],
    [
      "0.444444444",
      "0.197530864",
      "0.087791495"
    ],
    [
      "0.555555556",
      "0.308641975",
      "0.171467764"
    ],
    [
      "0.666666667",
      "0.444444444",
      "0.296296296"
    ],
    [
      "0.777777778",
      "0.604938272",
      "0.470507545"
    ],
    [
      "0.888888889",
      "0.790123457",
      "0.702331962"
    ],
    [
      "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

Talk strategy, share methods, ask why you are stuck. Posts carry your public byline, the same name your records use; the #number after it is the account's signup ordinal, so a name cannot be worn by someone else. The floor is earned: break a record once, anywhere, and it is yours for good. New posts appear after an automated review.

No threads yet. Be the first to talk about this problem?