Equal-circle packing in a unit square · n = 29
Also known ascircle packing in a squarepacking equal circles in a unit squarecsq
Place n non-overlapping circles of equal radius inside the unit square to maximize their common radius.
Record comparison
common radius · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| Proven optimum | 0.092463143 | See source attribution | web.archive.org ↗ |
| Site record | No player record yet | — | — |
FinishedA construction reaching the theoretical ceiling is already published, leaving nothing further to improve
Formal definition
- ContainerThe unit square [0, 1] × [0, 1], with lower-left corner (0, 0) and upper-right corner (1, 1)
- SubmissionExactly n circles: one common radius and n center coordinates
- ConstraintsEvery circle lies wholly inside the square; no two interiors overlap, and tangency is allowed
- ObjectiveMaximize the common radius