Tilted equal squares in the unit square · n = 20
Also known assquares in squarespacking unit squares in a squaretilted square packing
Pack n equal squares inside the unit square, each free to tilt at any angle without overlapping, so that their common side length is as large as possible.
Record comparison
the smallest side · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | 1/5 | See source attribution | Erich Friedman ↗ |
| Site record | No player record yet | — | — |
Formal definition
- ContainerThe unit square [0, 1] × [0, 1], with lower-left corner (0, 0) and upper-right corner (1, 1)
- 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 unit square; 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)