Sum of radii in the unit square · n = 1
Place n non-overlapping circles in the unit square, each with its own radius, making the sum of the radii as large as possible.
Record comparison
sum of the radii · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| Proven optimum | 1/2 | See source attribution | Proof / sourcewith one circle the inscribed circle is largest, r = 1/2 |
| Site record | No player record yet | — | — |
FinishedA construction reaching the theoretical ceiling is already published, leaving nothing further to improve
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