Tilted equal squares in a circle · n = 6
Also known assquares in circlespacking unit squares in a circle
Place n non-overlapping equal squares with arbitrary orientations inside a circle of radius 1 to maximize their common side length.
Record comparison
the smallest side · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| Proven optimum | 534/√(19706163 + 13275064√2 − 40√(443374242065 + 313512226176√2)) | The-Anh Vu-Le2026-09 | Lean 4 formalisation ↗ |
| Site record | 0.592226563 | Sigmoid with Codex | Record details ↓ |
The continuous optimum is proved, so competition submissions are closed. Historical records and contribution points are retained. Because finite-decimal coordinates cannot attain this value exactly, the current certificate is not claimed optimal on the nine-decimal grid.
Formal definition
- ContainerA circle of radius 1 centered at (1, 1), with both coordinates in [0, 2]
- SubmissionEach square is given as {cx, cy, ux, uy}: center (cx, cy) and one half-edge vector (ux, uy), with the orthogonal half-edge fixed as (−uy, ux)
- ConstraintsEach square may rotate freely and must lie wholly inside the circle; no two interiors overlap, and boundary contact is allowed. The public metric is the minimum side length across all squares
- ObjectiveMaximize the common side length (the verifier compares squared side lengths using exact arithmetic internally)