P57 · Packing and covering · Classic · Weak baseline · Medium

Sum of radii in the unit square · n = 4

Place n non-overlapping circles in the unit square, each with its own radius, making the sum of the radii as large as possible.

Instancen = 4

ObjectiveMaximize sum of the radii

Record comparison

sum of the radii · Higher is better

Record	Value / interval	Author / holder	Source
External best known	—	—	No reference listed
Site record	1.006788474	邱仲普	Record details ↓

Formal definition

ContainerA square of side 1, origin (0, 0) at the lower-left corner, (1, 1) at the upper-right
SubmissionExactly n circles, each a triple [x, y, r]: a centre plus its own radius
ConstraintsEvery circle lies entirely inside the square; no two overlap in their interiors, tangency allowed; every radius is positive
ObjectiveMake the sum of the radii as large as possible. Radii are nine-decimal numbers, and the sum is an exact integer sum

Open full editor ↗

Layout shown: site record

1y0

1234

0x1

VERIFIED CONSTRUCTIONscored by the sum of the radii

Getting a feel for it

Where the room for improvement is

Equal circles perform poorly here: filling the main space with a few large circles and tucking smaller ones into the corners and gaps yields a much larger total radius. Every corner trades one larger circle against several smaller ones, and good packings span a wide range of sizes.

Where the frontier is

This is Problem 6.36 from AlphaEvolve's mathematical discovery experiments. On EinsteinArena, n = 26 has been pushed to an exact KKT solution (known to 45 digits); almost no other n has a published value, and all of them are open.

Source

LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holder邱仲普

Solution methodAI · MoonshotAI: Kimi K3

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)

邱仲普AI · MoonshotAI: Kimi K3
1.006788473→1.006788474
2026-09-02
CphysicsHuman
1.00656305→1.006788473
2026-08-29
lirdHuman
1→1.00656305
2026-08-27
NUE_13Human
0.8→1
2026-08-27

ANSWER FORMAT

How to write your answer

The container is a square of side 1, with (0, 0) at the lower-left corner and (1, 1) at the upper-right. Coordinates and radii use the same length unit and are written as decimals such as "0.25", with at most nine decimal places.

Submit circles: exactly n triples [x, y, r], every number a decimal string such as "0.25".

The current leader's answer

{
  "circles": [
    [
      "0.210501019",
      "0.210501019",
      "0.210501019"
    ],
    [
      "0.789498981",
      "0.789498981",
      "0.210501019"
    ],
    [
      "0.292893218",
      "0.707106782",
      "0.292893218"
    ],
    [
      "0.707106782",
      "0.292893218",
      "0.292893218"
    ]
  ]
}

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

Instance parameters

{
  "n": 4
}

The current leader's answer

{
  "circles": [
    [
      "0.210501019",
      "0.210501019",
      "0.210501019"
    ],
    [
      "0.789498981",
      "0.789498981",
      "0.210501019"
    ],
    [
      "0.292893218",
      "0.707106782",
      "0.292893218"
    ],
    [
      "0.707106782",
      "0.292893218",
      "0.292893218"
    ]
  ]
}

Submit circles: exactly n triples [x, y, r], every number a decimal string such as "0.25". · 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.

问题等价NUE_13#310 replies32d ago