P66 · Packing and covering · Classic · Hard

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

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

Record comparison

the triangle area · Lower is better
RecordValue / intervalAuthor / holderSource
External best known42 + 52√3See source attributionErich Friedman ↗
Site record132.0666420093831393505condorRecord 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 CONSTRUCTION35 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 = 35, 132.0666420093831393505
LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Terra
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 (2 changes)
  1. condorAI · OpenAI: GPT-6.1 Terra
    132.066642035186220856→132.0666420093831393505
  2. 邱仲普AI · OpenAI: GPT-5.6 Sol
    132.066642043918271664→132.066642035186220856
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": [
    [
      "43.801936853",
      "48.442856522"
    ],
    [
      "41.810100688",
      "48.623379906"
    ],
    [
      "39.818264523",
      "48.803903290"
    ],
    [
      "37.826428358",
      "48.984426674"
    ],
    [
      "35.834592193",
      "49.164950058"
    ],
    [
      "33.842756028",
      "49.345473442"
    ],
    [
      "31.850919863",
      "49.525996826"
    ],
    [
      "42.649680934",
      "46.808137495"
    ],
    [
      "40.657844769",
      "46.988660879"
    ],
    [
      "38.666008604",
      "47.169184263"
    ],
    [
      "36.674172439",
      "47.349707647"
    ],
    [
      "34.682336274",
      "47.530231031"
    ],
    [
      "32.690500109",
      "47.710754415"
    ],
    [
      "30.698663944",
      "47.891277799"
    ],
    [
      "41.497425015",
      "45.173418468"
    ],
    [
      "39.505588850",
      "45.353941852"
    ],
    [
      "37.513752685",
      "45.534465236"
    ],
    [
      "35.521916520",
      "45.714988620"
    ],
    [
      "33.530080355",
      "45.895512004"
    ],
    [
      "31.538244190",
      "46.076035388"
    ],
    [
      "40.345169096",
      "43.538699441"
    ],
    [
      "38.353332931",
      "43.719222825"
    ],
    [
      "36.361496766",
      "43.899746209"
    ],
    [
      "34.369660601",
      "44.080269593"
    ],
    [
      "32.377824436",
      "44.260792977"
    ],
    [
      "39.192913177",
      "41.903980414"
    ],
    [
      "37.201077012",
      "42.084503798"
    ],
    [
      "35.209240847",
      "42.265027182"
    ],
    [
      "33.217404682",
      "42.445550566"
    ],
    [
      "38.040657258",
      "40.269261387"
    ],
    [
      "36.048821093",
      "40.449784771"
    ],
    [
      "34.056984928",
      "40.630308155"
    ],
    [
      "36.888401339",
      "38.634542360"
    ],
    [
      "34.896565174",
      "38.815065744"
    ],
    [
      "35.736145420",
      "36.999823333"
    ]
  ],
  "triangle": [
    [
      "45.617179264",
      "49.282436768"
    ],
    [
      "28.224364671",
      "50.858776129"
    ],
    [
      "35.555622036",
      "35.007987167"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 35
}

The current leader's answer

{
  "centers": [
    [
      "43.801936853",
      "48.442856522"
    ],
    [
      "41.810100688",
      "48.623379906"
    ],
    [
      "39.818264523",
      "48.803903290"
    ],
    [
      "37.826428358",
      "48.984426674"
    ],
    [
      "35.834592193",
      "49.164950058"
    ],
    [
      "33.842756028",
      "49.345473442"
    ],
    [
      "31.850919863",
      "49.525996826"
    ],
    [
      "42.649680934",
      "46.808137495"
    ],
    [
      "40.657844769",
      "46.988660879"
    ],
    [
      "38.666008604",
      "47.169184263"
    ],
    [
      "36.674172439",
      "47.349707647"
    ],
    [
      "34.682336274",
      "47.530231031"
    ],
    [
      "32.690500109",
      "47.710754415"
    ],
    [
      "30.698663944",
      "47.891277799"
    ],
    [
      "41.497425015",
      "45.173418468"
    ],
    [
      "39.505588850",
      "45.353941852"
    ],
    [
      "37.513752685",
      "45.534465236"
    ],
    [
      "35.521916520",
      "45.714988620"
    ],
    [
      "33.530080355",
      "45.895512004"
    ],
    [
      "31.538244190",
      "46.076035388"
    ],
    [
      "40.345169096",
      "43.538699441"
    ],
    [
      "38.353332931",
      "43.719222825"
    ],
    [
      "36.361496766",
      "43.899746209"
    ],
    [
      "34.369660601",
      "44.080269593"
    ],
    [
      "32.377824436",
      "44.260792977"
    ],
    [
      "39.192913177",
      "41.903980414"
    ],
    [
      "37.201077012",
      "42.084503798"
    ],
    [
      "35.209240847",
      "42.265027182"
    ],
    [
      "33.217404682",
      "42.445550566"
    ],
    [
      "38.040657258",
      "40.269261387"
    ],
    [
      "36.048821093",
      "40.449784771"
    ],
    [
      "34.056984928",
      "40.630308155"
    ],
    [
      "36.888401339",
      "38.634542360"
    ],
    [
      "34.896565174",
      "38.815065744"
    ],
    [
      "35.736145420",
      "36.999823333"
    ]
  ],
  "triangle": [
    [
      "45.617179264",
      "49.282436768"
    ],
    [
      "28.224364671",
      "50.858776129"
    ],
    [
      "35.555622036",
      "35.007987167"
    ]
  ]
}

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.