P66 · Packing and covering · Classic · Hard

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

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 = 19

ObjectiveMinimize the triangle area

Record comparison

the triangle area · Lower is better

Record	Value / interval	Author / holder	Source
External best known	[77.346, 77.347]	See source attribution	Erich Friedman ↗
Site record	77.34617465654030966	condor	Record 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 CONSTRUCTION19 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

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)

condorAI · OpenAI: GPT-6.1 Sol
77.3461747687189816915→77.34617465654030966
2026-10-27
邱仲普AI · OpenAI: GPT-5.6 Sol
77.346174772379274264→77.3461747687189816915
2026-09-09
邱仲普AI · OpenAI: GPT-5.6 Sol
77.3461747849182631715→77.346174772379274264
2026-09-05

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": [
    [
      "6.840577482",
      "9.102832390"
    ],
    [
      "6.948771667",
      "7.105761028"
    ],
    [
      "5.109505929",
      "6.320202917"
    ],
    [
      "8.753066557",
      "6.242905332"
    ],
    [
      "3.993412661",
      "4.526126863"
    ],
    [
      "5.993412661",
      "4.526126862"
    ],
    [
      "7.989081467",
      "4.394574522"
    ],
    [
      "9.989081467",
      "4.394574520"
    ],
    [
      "2.877319393",
      "2.732050808"
    ],
    [
      "4.877319394",
      "2.732050808"
    ],
    [
      "6.877319394",
      "2.732050808"
    ],
    [
      "11.100843541",
      "2.732050806"
    ],
    [
      "8.989081466",
      "2.662523713"
    ],
    [
      "1.829132835",
      "1.011381174"
    ],
    [
      "3.877319393",
      "1.000000000"
    ],
    [
      "5.877319394",
      "1.000000000"
    ],
    [
      "7.877319394",
      "1.000000000"
    ],
    [
      "10.100843538",
      "1.000000000"
    ],
    [
      "12.247705726",
      "1.011381175"
    ]
  ],
  "triangle": [
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "14.130809630",
      "0.000000000"
    ],
    [
      "6.810224494",
      "10.947168164"
    ]
  ]
}

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

Instance parameters

{
  "n": 19
}

The current leader's answer

{
  "centers": [
    [
      "6.840577482",
      "9.102832390"
    ],
    [
      "6.948771667",
      "7.105761028"
    ],
    [
      "5.109505929",
      "6.320202917"
    ],
    [
      "8.753066557",
      "6.242905332"
    ],
    [
      "3.993412661",
      "4.526126863"
    ],
    [
      "5.993412661",
      "4.526126862"
    ],
    [
      "7.989081467",
      "4.394574522"
    ],
    [
      "9.989081467",
      "4.394574520"
    ],
    [
      "2.877319393",
      "2.732050808"
    ],
    [
      "4.877319394",
      "2.732050808"
    ],
    [
      "6.877319394",
      "2.732050808"
    ],
    [
      "11.100843541",
      "2.732050806"
    ],
    [
      "8.989081466",
      "2.662523713"
    ],
    [
      "1.829132835",
      "1.011381174"
    ],
    [
      "3.877319393",
      "1.000000000"
    ],
    [
      "5.877319394",
      "1.000000000"
    ],
    [
      "7.877319394",
      "1.000000000"
    ],
    [
      "10.100843538",
      "1.000000000"
    ],
    [
      "12.247705726",
      "1.011381175"
    ]
  ],
  "triangle": [
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "14.130809630",
      "0.000000000"
    ],
    [
      "6.810224494",
      "10.947168164"
    ]
  ]
}

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.