P66 · Packing and covering · Classic · Hard

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

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 = 34
ObjectiveMinimize the triangle area

Record comparison

the triangle area · Lower is better
RecordValue / intervalAuthor / holderSource
External best known[131.58592, 131.58593]See source attributionErich Friedman ↗
Site record131.585922831270990232condorRecord details ↓

Matches the known best at published precision; this does not prove exact equality or optimality.

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 CONSTRUCTION34 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 = 34, 131.585922831270990232
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
    131.585922932087549013→131.585922831270990232
  2. condorAI · OpenAI: GPT-6 Astra
    131.5859230372289960975→131.585922932087549013
  3. 邱仲普AI · OpenAI: GPT-5.6 Sol
    131.585923044651432295→131.5859230372289960975
  4. 邱仲普AI · OpenAI: GPT-5.6 Sol
    131.585923053515497916→131.585923044651432295
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": [
    [
      "8.864058525",
      "12.894307374"
    ],
    [
      "9.229697690",
      "10.928014414"
    ],
    [
      "7.325247604",
      "10.317219955"
    ],
    [
      "10.787278389",
      "9.673445816"
    ],
    [
      "7.867719626",
      "8.392194213"
    ],
    [
      "5.915720773",
      "7.956648026"
    ],
    [
      "9.812838948",
      "7.926886976"
    ],
    [
      "11.812622992",
      "7.956277084"
    ],
    [
      "4.864391964",
      "6.195959816"
    ],
    [
      "6.864391964",
      "6.195959816"
    ],
    [
      "8.864170500",
      "6.166197288"
    ],
    [
      "10.863954544",
      "6.195587396"
    ],
    [
      "12.863954544",
      "6.195587397"
    ],
    [
      "3.838716599",
      "4.478234107"
    ],
    [
      "13.889299146",
      "4.478418666"
    ],
    [
      "5.838506127",
      "4.449219538"
    ],
    [
      "7.838506127",
      "4.449219538"
    ],
    [
      "9.889515102",
      "4.449028558"
    ],
    [
      "11.889515102",
      "4.449028559"
    ],
    [
      "2.800435909",
      "2.739397927"
    ],
    [
      "4.800381245",
      "2.724608973"
    ],
    [
      "6.838506127",
      "2.717168730"
    ],
    [
      "8.863850729",
      "2.732050808"
    ],
    [
      "10.889515102",
      "2.716977750"
    ],
    [
      "12.927799835",
      "2.724702875"
    ],
    [
      "14.927746519",
      "2.739306416"
    ],
    [
      "1.778291872",
      "1.020322129"
    ],
    [
      "15.948686302",
      "1.011217219"
    ],
    [
      "3.787600967",
      "1.000000000"
    ],
    [
      "5.813161524",
      "1.000000000"
    ],
    [
      "7.863850729",
      "1.000000000"
    ],
    [
      "9.863850729",
      "1.000000000"
    ],
    [
      "11.915179475",
      "1.000000000"
    ],
    [
      "13.940420231",
      "1.000000000"
    ]
  ],
  "triangle": [
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "17.728131224",
      "0.000000000"
    ],
    [
      "8.864057765",
      "14.844872386"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 34
}

The current leader's answer

{
  "centers": [
    [
      "8.864058525",
      "12.894307374"
    ],
    [
      "9.229697690",
      "10.928014414"
    ],
    [
      "7.325247604",
      "10.317219955"
    ],
    [
      "10.787278389",
      "9.673445816"
    ],
    [
      "7.867719626",
      "8.392194213"
    ],
    [
      "5.915720773",
      "7.956648026"
    ],
    [
      "9.812838948",
      "7.926886976"
    ],
    [
      "11.812622992",
      "7.956277084"
    ],
    [
      "4.864391964",
      "6.195959816"
    ],
    [
      "6.864391964",
      "6.195959816"
    ],
    [
      "8.864170500",
      "6.166197288"
    ],
    [
      "10.863954544",
      "6.195587396"
    ],
    [
      "12.863954544",
      "6.195587397"
    ],
    [
      "3.838716599",
      "4.478234107"
    ],
    [
      "13.889299146",
      "4.478418666"
    ],
    [
      "5.838506127",
      "4.449219538"
    ],
    [
      "7.838506127",
      "4.449219538"
    ],
    [
      "9.889515102",
      "4.449028558"
    ],
    [
      "11.889515102",
      "4.449028559"
    ],
    [
      "2.800435909",
      "2.739397927"
    ],
    [
      "4.800381245",
      "2.724608973"
    ],
    [
      "6.838506127",
      "2.717168730"
    ],
    [
      "8.863850729",
      "2.732050808"
    ],
    [
      "10.889515102",
      "2.716977750"
    ],
    [
      "12.927799835",
      "2.724702875"
    ],
    [
      "14.927746519",
      "2.739306416"
    ],
    [
      "1.778291872",
      "1.020322129"
    ],
    [
      "15.948686302",
      "1.011217219"
    ],
    [
      "3.787600967",
      "1.000000000"
    ],
    [
      "5.813161524",
      "1.000000000"
    ],
    [
      "7.863850729",
      "1.000000000"
    ],
    [
      "9.863850729",
      "1.000000000"
    ],
    [
      "11.915179475",
      "1.000000000"
    ],
    [
      "13.940420231",
      "1.000000000"
    ]
  ],
  "triangle": [
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "17.728131224",
      "0.000000000"
    ],
    [
      "8.864057765",
      "14.844872386"
    ]
  ]
}

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.