MinMax Arena
中/EN
P03 · Extremal configurations · Classic

Heilbronn minimum triangle area · n = 5

Also known asHeilbronn triangle problemHeilbronn's problem in a square

Place n points in the unit square to maximize the minimum area among all triangles formed by three points.

Instancen = 5
ObjectiveMaximize minimum triangle area

Record comparison

minimum triangle area · Higher is better
RecordValue / intervalAuthor / holderSource
Proven optimum√3/9See source attributionarxiv.org ↗
Site record0.192450089729743335Reference answerRecord details ↓

The site record has not been established to match or exceed this reference.

FinishedA construction reaching the theoretical ceiling is already published, leaving nothing further to improve

Formal definition

  • ContainerThe unit square [0, 1] × [0, 1], with lower-left corner (0, 0) and upper-right corner (1, 1)
  • SubmissionExactly n points, with no three collinear
  • ConstraintsEvery point lies inside the unit square or on its boundary
  • ScoreA(P) is the minimum triangle area over all point triples (the verifier compares 2A(P) using exact integer arithmetic internally)A(P)=12min1≤i<j<k≤n|det(pj−pi,pk−pi)|
  • ObjectiveMaximize the minimum triangle area A(P)
Inspect in editor ↗

Layout shown: site record

1y0
0x1
VERIFIED CONSTRUCTIONthe smallest triangle

Getting a feel for it

Avoiding nearly collinear triples

Spreading points far apart does not by itself guarantee large triangles: whenever three points are nearly collinear, they span a sliver triangle of tiny area. Regular grids and symmetric layouts naturally create collinear or nearly collinear triples, so strong configurations are usually asymmetric and place many points on the boundary.

Proven optima and open frontier

Exact optima are proven for n = 5..9 (Yang, Zhang, Zeng, and Dress, 1991–1995). For n ≥ 10 only numerical lower bounds are known; see arXiv:2603.11107 for a recent survey and constructions, building on Goldberg's 1972 benchmark tables.

Source
The record-holding arrangement for Heilbronn minimum triangle area n = 5, 0.192450089729743335
LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Answer sourceReference answer
Solution method—
The optimum is proven; no further improvement is possibleSubmit 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 (23 changes)
  1. Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
    0.1924500897255719045→0.192450089729743335
  2. Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
    0.192450089718233512→0.1924500897255719045
  3. Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
    0.192450089705705531→0.192450089718233512
  4. Published referenceHuman
    0.192431612727415404→0.192450089705705531
  5. RJcxyHuman
    0.1898058072152032→0.192431612727415404
  6. FTHuman
    0.1897412909777557→0.1898058072152032
  7. FTHuman
    0.189621966318206→0.1897412909777557
  8. ZrchedcxenHuman
    0.187979611040238014→0.189621966318206
  9. xxxHuman
    0.186870547470267613→0.187979611040238014
  10. xxxHuman
    0.185734316612408607→0.186870547470267613
  11. ZrchedcxenHuman
    0.176701810414769484→0.185734316612408607
  12. ZrchedcxenHuman
    0.1766496683517080925→0.176701810414769484
  13. EraserHuman
    0.175403521146423756→0.1766496683517080925
  14. jiayaHuman
    0.175366952319450481→0.175403521146423756
  15. jiayaHuman
    0.175283999695641261→0.175366952319450481
  16. jiayaHuman
    0.168590314268914264→0.175283999695641261
  17. jiayaHuman
    0.167329942760149995→0.168590314268914264
  18. EraserHuman
    0.164291560073341701→0.167329942760149995
  19. jiayaHuman
    0.15541704693→0.164291560073341701
  20. jiayaHuman
    0.15534753983→0.15541704693
  21. jiayaHuman
    0.155000003→0.15534753983
  22. yomeHuman
    0.155→0.155000003
  23. qwertHuman
    0.02→0.155
ANSWER FORMAT

How to write your answer

The container is a square of side 1. Its lower-left corner is the origin (0, 0) and its upper-right corner is (1, 1). Coordinates and lengths share one unit and are written as plain decimals such as "0.5", to at most nine decimal places.

Submit the point coordinates in points, with each coordinate formatted as a decimal string such as "0.5".

The current leader's answer

{
  "points": [
    [
      "0.000000000",
      "0.333333698"
    ],
    [
      "0.577350585",
      "0.000000000"
    ],
    [
      "1.000000000",
      "0.422649415"
    ],
    [
      "0.666666302",
      "1.000000000"
    ],
    [
      "0.000000000",
      "1.000000000"
    ]
  ]
}
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.000000000",
      "0.333333698"
    ],
    [
      "0.577350585",
      "0.000000000"
    ],
    [
      "1.000000000",
      "0.422649415"
    ],
    [
      "0.666666302",
      "1.000000000"
    ],
    [
      "0.000000000",
      "1.000000000"
    ]
  ]
}

Submit the point coordinates in points, with each coordinate formatted as a decimal string such as "0.5". · 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.