P92 · Packing and covering · Classic · Hard

Sum of radii in the unit circle · n = 22

Place n non-overlapping circles of independently chosen radii inside a disc of radius 1 so as to maximise the sum of their radii.

Instancen = 22
ObjectiveMaximize the sum of the radii

Record comparison

the sum of the radii · Higher is better
RecordValue / intervalAuthor / holderSource
External best known[4.287, 4.288]See source attributionErich Friedman ↗
Site record4.287688586zzzcyRecord details ↓

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

Formal definition

  • ContainerThe closed disc of radius 1 centred at (1, 1); circles may touch the boundary
  • SubmissionExactly n circles [x, y, r] with r > 0, each value having at most nine decimal places
  • ConstraintsEvery circle lies inside the disc, (x − 1)² + (y − 1)² ≤ (1 − r)², and no two interiors intersect: the centre distance is at least the sum of the two radii. All checks are evaluated in exact integer arithmetic, with tangency allowed
  • ScoreThe sum of the radii, computed as an exact integer sum and displayed to nine decimal places; larger is betterS=Σr
  • ObjectiveMaximise the sum of the radii over all valid arrangementsmaxSΣr
Open full editor ↗

Layout shown: site record

2y0
0x2
VERIFIED CONSTRUCTIONscored by the sum of the radii

Getting a feel for it

Primary rings and curvilinear gap filling

Because the objective is linear in the radii whereas area scales quadratically, high-scoring packings combine circles of widely varying scales: a single central disc or a ring of primary circles occupies the core, while smaller circles are wedged into the curvilinear gaps along the outer boundary.

Literature records and recent updates

Erich Friedman's maximum-total-perimeter table extends to n = 50: n ≤ 4 and n = 6–10 are closed-form constructions due to Elser and Cantrell, n = 5 was improved by Haowei Lin in July 2026, and n = 33–50 were added by Jonathan Viquerat in September 2026. None of these instances has a published optimality proof; this catalogue reconstructs the pictured arrangements and verifies them in exact arithmetic.

Source
The record-holding arrangement for Sum of radii in the unit circle n = 22, 4.287688586
LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
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 (6 changes)
  1. zzzcyAI · OpenAI: GPT-6 Astra
    4.287688585→4.287688586
  2. zzzcyAI · OpenAI: GPT-6 Astra
    4.287688584→4.287688585
  3. zzzcyAI · OpenAI: GPT-6 Astra
    4.287688583→4.287688584
  4. TmrgAI · OpenAI: GPT-5.6 Sol
    4.287688582→4.287688583
  5. zzzcyAI · OpenAI: GPT-6 Astra
    4.287688581→4.287688582
  6. 今天AI · DeepSeek: DeepSeek V4.1 Flash
    4.287688578→4.287688581
ANSWER FORMAT

How to write your answer

The container is the closed disc of radius 1 centred at (1, 1), so all coordinates lie in [0, 2]. Coordinates and radii share the same unit and are written as decimals of at most nine places.

Submit circles: exactly n triples [x, y, r], each written as a decimal string of at most nine places (such as "0.25"). The container is the closed disc of radius 1 centred at (1, 1).

The current leader's answer

{
  "circles": [
    [
      "1.000005503",
      "1.000000000",
      "0.270210210"
    ],
    [
      "1.176016275",
      "1.771136546",
      "0.209030151"
    ],
    [
      "1.712642177",
      "1.343185862",
      "0.209028819"
    ],
    [
      "1.176016275",
      "0.228863454",
      "0.209030151"
    ],
    [
      "0.209032551",
      "1.000000000",
      "0.209032551"
    ],
    [
      "0.506845141",
      "1.618408408",
      "0.209031812"
    ],
    [
      "1.712642177",
      "0.656814138",
      "0.209028819"
    ],
    [
      "0.506845141",
      "0.381591592",
      "0.209031812"
    ],
    [
      "0.893796511",
      "1.465338706",
      "0.207095207"
    ],
    [
      "1.477309486",
      "1.000000000",
      "0.207093772"
    ],
    [
      "1.297600880",
      "0.626829121",
      "0.207094214"
    ],
    [
      "0.893796511",
      "0.534661294",
      "0.207095207"
    ],
    [
      "1.297600880",
      "1.373170879",
      "0.207094214"
    ],
    [
      "0.569967752",
      "0.792903997",
      "0.207096003"
    ],
    [
      "0.569967752",
      "1.207096003",
      "0.207096003"
    ],
    [
      "1.842201629",
      "1.000000000",
      "0.157798371"
    ],
    [
      "1.525109868",
      "0.341545591",
      "0.157798965"
    ],
    [
      "0.241207136",
      "0.634579801",
      "0.157801370"
    ],
    [
      "0.812602440",
      "0.178913836",
      "0.157800300"
    ],
    [
      "0.241207136",
      "1.365420199",
      "0.157801370"
    ],
    [
      "0.812602440",
      "1.821086164",
      "0.157800300"
    ],
    [
      "1.525109868",
      "1.658454409",
      "0.157798965"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 22
}

The current leader's answer

{
  "circles": [
    [
      "1.000005503",
      "1.000000000",
      "0.270210210"
    ],
    [
      "1.176016275",
      "1.771136546",
      "0.209030151"
    ],
    [
      "1.712642177",
      "1.343185862",
      "0.209028819"
    ],
    [
      "1.176016275",
      "0.228863454",
      "0.209030151"
    ],
    [
      "0.209032551",
      "1.000000000",
      "0.209032551"
    ],
    [
      "0.506845141",
      "1.618408408",
      "0.209031812"
    ],
    [
      "1.712642177",
      "0.656814138",
      "0.209028819"
    ],
    [
      "0.506845141",
      "0.381591592",
      "0.209031812"
    ],
    [
      "0.893796511",
      "1.465338706",
      "0.207095207"
    ],
    [
      "1.477309486",
      "1.000000000",
      "0.207093772"
    ],
    [
      "1.297600880",
      "0.626829121",
      "0.207094214"
    ],
    [
      "0.893796511",
      "0.534661294",
      "0.207095207"
    ],
    [
      "1.297600880",
      "1.373170879",
      "0.207094214"
    ],
    [
      "0.569967752",
      "0.792903997",
      "0.207096003"
    ],
    [
      "0.569967752",
      "1.207096003",
      "0.207096003"
    ],
    [
      "1.842201629",
      "1.000000000",
      "0.157798371"
    ],
    [
      "1.525109868",
      "0.341545591",
      "0.157798965"
    ],
    [
      "0.241207136",
      "0.634579801",
      "0.157801370"
    ],
    [
      "0.812602440",
      "0.178913836",
      "0.157800300"
    ],
    [
      "0.241207136",
      "1.365420199",
      "0.157801370"
    ],
    [
      "0.812602440",
      "1.821086164",
      "0.157800300"
    ],
    [
      "1.525109868",
      "1.658454409",
      "0.157798965"
    ]
  ]
}

Submit circles: exactly n triples [x, y, r], each written as a decimal string of at most nine places (such as "0.25"). The container is the closed disc of radius 1 centred at (1, 1). · 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.