P92 · Packing and covering · Classic · Hard

Sum of radii in the unit circle · n = 14

Place n non-overlapping circles inside a circle of radius 1, each with its own radius, making the sum of the radii as large as possible.

Instancen = 14
ObjectiveMaximize the sum of the radii

Record comparison

the sum of the radii · Higher is better
RecordValue / intervalAuthor / holderSource
External best known[3.359, 3.360]See source attributionErich Friedman ↗
Site recordNo player record yet——

Formal definition

  • ContainerThe closed disc of radius 1 centred at (1, 1); a circle may touch the boundary
  • SubmissionExactly n circles, each [x, y, r] with r > 0, every number to at most nine decimals
  • ConstraintsEvery circle lies inside the disc, (x − 1)² + (y − 1)² ≤ (1 − r)², and no two interiors meet: the distance between centres is at least the sum of the radii. All checked exactly in integers; touching is allowed
  • ScoreThe sum of the radii, an exact integer sum shown to nine decimals; larger is betterS=Σr
  • ObjectiveMaximise the sum of the radii over every legal arrangementmaxSΣr
Open the full editor ↗

Layout shown: starter layout

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

Getting a feel for it

Where the room for improvement is

As in the square, equal circles are among the worst strategies: one large circle near the centre, or a ring of large ones, with small circles tucked into the gaps between them and the rim. A disc has no corners, so the big circle in a corner becomes a ring along the rim, and the trade of sizes plays out in a different geometry.

Where the frontier is

Erich Friedman's maximum-total-perimeter table runs to n = 50: n ≤ 4 and 6–10 are closed-form arrangements by 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. The table is still being rewritten and no row carries an optimality proof; the site exhibits the pictured arrangements, reconstructed and verified exactly.

Source
The current arrangement for Sum of radii in the unit circle n = 14
LAYOUT & HISTORY

Starter layout

Inspect the layout, solver notes and record history.

Challenge this record ↗Submit a proof / idea ↓Share a proof or idea in the discussion. Accepted contributions can earn proof points.
ANSWER FORMAT

How to write your answer

The container is the disc of radius 1 centred at (1, 1), so every coordinate lies in [0, 2] and none is negative. Coordinates and radii share one unit and are written as plain decimals, to at most nine places.

Submit circles: exactly n triples [x, y, r], every number 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).

Starter answer

{
  "circles": [
    [
      "0.892006774",
      "0.742650318",
      "0.308868866"
    ],
    [
      "1.418526450",
      "0.438119660",
      "0.299376058"
    ],
    [
      "1.490492672",
      "1.514335068",
      "0.289279503"
    ],
    [
      "0.308917374",
      "0.782851970",
      "0.275604760"
    ],
    [
      "0.569681603",
      "1.586607655",
      "0.272481983"
    ],
    [
      "1.000020928",
      "1.290733797",
      "0.249756729"
    ],
    [
      "1.393691753",
      "0.985386360",
      "0.248453844"
    ],
    [
      "1.037921027",
      "1.769028446",
      "0.230037172"
    ],
    [
      "0.950040962",
      "0.219293067",
      "0.217696209"
    ],
    [
      "0.543734645",
      "0.356485620",
      "0.211147142"
    ],
    [
      "0.238852276",
      "1.251596692",
      "0.198347485"
    ],
    [
      "1.776899278",
      "0.771770990",
      "0.190271051"
    ],
    [
      "1.798134635",
      "1.149440904",
      "0.187995394"
    ],
    [
      "0.599136674",
      "1.134639275",
      "0.180445181"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 14
}

Starter answer

{
  "circles": [
    [
      "0.892006774",
      "0.742650318",
      "0.308868866"
    ],
    [
      "1.418526450",
      "0.438119660",
      "0.299376058"
    ],
    [
      "1.490492672",
      "1.514335068",
      "0.289279503"
    ],
    [
      "0.308917374",
      "0.782851970",
      "0.275604760"
    ],
    [
      "0.569681603",
      "1.586607655",
      "0.272481983"
    ],
    [
      "1.000020928",
      "1.290733797",
      "0.249756729"
    ],
    [
      "1.393691753",
      "0.985386360",
      "0.248453844"
    ],
    [
      "1.037921027",
      "1.769028446",
      "0.230037172"
    ],
    [
      "0.950040962",
      "0.219293067",
      "0.217696209"
    ],
    [
      "0.543734645",
      "0.356485620",
      "0.211147142"
    ],
    [
      "0.238852276",
      "1.251596692",
      "0.198347485"
    ],
    [
      "1.776899278",
      "0.771770990",
      "0.190271051"
    ],
    [
      "1.798134635",
      "1.149440904",
      "0.187995394"
    ],
    [
      "0.599136674",
      "1.134639275",
      "0.180445181"
    ]
  ]
}

Submit circles: exactly n triples [x, y, r], every number 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

Talk strategy, share methods, ask why you are stuck. Every signed-in user can post. Posts carry your public byline, the same name your records use; the #number after it is the account's signup ordinal, so a name cannot be worn by someone else. New posts appear after an automated review.