P03 · Geometry

Heilbronn minimum triangle area

Place n points in the unit square and maximize the smallest area formed by any three of them.

Instancen = 6

ObjectiveMaximize minimum triangle area

Requirements

All points lie in the unit square
No three selected points are collinear
The score is the smallest triangle area

Challenge this record ↗

CURRENT LEADERLive answer visualization

n = 6

123456

VERIFIED CONSTRUCTIONmaximize the smallest triangle

Current leader

0.045000000

minimum triangle area

Record holderFounding benchmark

Solution methodHuman only

Challenge this record ↗

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

Instance parameters

{
  "n": 6,
  "size": 1000000000
}

Current leader certificate

{
  "points": [
    [
      0,
      0
    ],
    [
      1000000000,
      0
    ],
    [
      0,
      1000000000
    ],
    [
      1000000000,
      1000000000
    ],
    [
      200000000,
      300000000
    ],
    [
      700000000,
      600000000
    ]
  ]
}

Submit points. The verifier stores doubled area internally to avoid floating-point error. · Verifier v1.0.0