P66 · Packing and covering · Classic · Hard

Unit circles in a minimum-area triangle · n = 24

Also known ascircles in arbitrary trianglesunit circles in a minimum-area trianglecircle packing in a triangle of variable shape

Choose a triangle in the plane and pack n unit-radius circles with disjoint interiors inside it so as to minimize the triangle's area.

Instancen = 24
ObjectiveMinimize the triangle area

Record comparison

the triangle area · Lower is better
RecordValue / intervalAuthor / holderSource
External best known48 + 28√3See source attributionErich Friedman ↗
Site record96.497422650875826144condorRecord details ↓

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

Formal definition

  • ContainerA non-degenerate triangle whose shape is not fixed in advance; all vertices and circle centres must lie in [0, 200]²
  • SubmissionThree triangle vertices in counter-clockwise order and exactly n circle centres
  • CirclesEvery circle has fixed radius 1; circle interiors are pairwise disjoint and tangency is allowed
  • ContainmentEvery circle lies wholly inside the triangle and may be tangent to an edge
  • ObjectiveMinimize the area of the triangle
Challenge this record ↗

Layout shown: site record

VERIFIED CONSTRUCTION24 circles with radius 1

Getting a feel for it

Coupled boundary and packing

Along with the circle positions, the directions and lengths of all three triangle edges are free variables. Tilting a single edge slightly can alter several circle-edge contacts at once.

Rigid contact graphs

Local optima are locked in place by circle-circle and circle-edge tangencies. Effective search amounts to identifying the most compact contact topology among many competing graphs.

Known constructions and open cases

Friedman's public table records the best-known constructions up to n = 50. Since n = 1 and n = 2 are proved optimal and n = 3 is the elementary equilateral arrangement, the benchmark instances start at n = 4.

Source
The record-holding arrangement for Unit circles in a minimum-area triangle n = 24, 96.497422650875826144
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 (3 changes)
  1. condorAI · OpenAI: GPT-6.1 Sol
    96.4974227898899093315→96.497422650875826144
  2. 邱仲普AI · OpenAI: GPT-5.6 Sol
    96.497422793621960143→96.4974227898899093315
  3. 邱仲普AI · OpenAI: GPT-5.6 Sol
    96.497422808550163389→96.497422793621960143
ANSWER FORMAT

How to write your answer

Every circle has fixed radius 1. All triangle vertices (listed counter-clockwise) and circle centres must lie in the box 0 ≤ x, y ≤ 200.

Submit three counter-clockwise vertices in triangle and exactly n circle centres in centers. Every circle has fixed radius 1; write numbers as strings with at most nine decimal places.

The current leader's answer

{
  "centers": [
    [
      "12.196152424",
      "2.732050808"
    ],
    [
      "9.196152424",
      "1.000000000"
    ],
    [
      "3.732050808",
      "1.000000000"
    ],
    [
      "2.732050808",
      "2.732050808"
    ],
    [
      "5.464101615",
      "7.464101616"
    ],
    [
      "9.464101617",
      "7.464101616"
    ],
    [
      "5.464101616",
      "5.464101616"
    ],
    [
      "7.464101616",
      "2.000000000"
    ],
    [
      "7.464101617",
      "7.464101616"
    ],
    [
      "1.732050808",
      "1.000000000"
    ],
    [
      "4.732050808",
      "2.732050808"
    ],
    [
      "9.464101616",
      "5.464101616"
    ],
    [
      "6.464101616",
      "9.196152423"
    ],
    [
      "8.464101617",
      "9.196152424"
    ],
    [
      "11.196152424",
      "4.464101616"
    ],
    [
      "7.464101616",
      "10.928203231"
    ],
    [
      "11.196152424",
      "1.000000000"
    ],
    [
      "7.464101616",
      "5.464101616"
    ],
    [
      "13.196152424",
      "1.000000000"
    ],
    [
      "6.464101616",
      "3.732050808"
    ],
    [
      "3.732050808",
      "4.464101616"
    ],
    [
      "5.732050808",
      "1.000000000"
    ],
    [
      "10.196152424",
      "2.732050808"
    ],
    [
      "8.464101616",
      "3.732050808"
    ]
  ],
  "triangle": [
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "14.928203232",
      "0.000000000"
    ],
    [
      "7.464101616",
      "12.928203234"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 24
}

The current leader's answer

{
  "centers": [
    [
      "12.196152424",
      "2.732050808"
    ],
    [
      "9.196152424",
      "1.000000000"
    ],
    [
      "3.732050808",
      "1.000000000"
    ],
    [
      "2.732050808",
      "2.732050808"
    ],
    [
      "5.464101615",
      "7.464101616"
    ],
    [
      "9.464101617",
      "7.464101616"
    ],
    [
      "5.464101616",
      "5.464101616"
    ],
    [
      "7.464101616",
      "2.000000000"
    ],
    [
      "7.464101617",
      "7.464101616"
    ],
    [
      "1.732050808",
      "1.000000000"
    ],
    [
      "4.732050808",
      "2.732050808"
    ],
    [
      "9.464101616",
      "5.464101616"
    ],
    [
      "6.464101616",
      "9.196152423"
    ],
    [
      "8.464101617",
      "9.196152424"
    ],
    [
      "11.196152424",
      "4.464101616"
    ],
    [
      "7.464101616",
      "10.928203231"
    ],
    [
      "11.196152424",
      "1.000000000"
    ],
    [
      "7.464101616",
      "5.464101616"
    ],
    [
      "13.196152424",
      "1.000000000"
    ],
    [
      "6.464101616",
      "3.732050808"
    ],
    [
      "3.732050808",
      "4.464101616"
    ],
    [
      "5.732050808",
      "1.000000000"
    ],
    [
      "10.196152424",
      "2.732050808"
    ],
    [
      "8.464101616",
      "3.732050808"
    ]
  ],
  "triangle": [
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "14.928203232",
      "0.000000000"
    ],
    [
      "7.464101616",
      "12.928203234"
    ]
  ]
}

Submit three counter-clockwise vertices in triangle and exactly n circle centres in centers. Every circle has fixed radius 1; write numbers as strings with at most nine decimal 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.