Square Packing Atlas
an open problem you can hold in your hands

How small a square can hold n unit squares?

Call the answer s(n). For a perfect square number of squares it is obvious; for most other n nobody knows. There is only the best packing anyone has found and a proven floor beneath it. This atlas draws every record packing up to n = 324, from Erich Friedman's and David Ellsworth's catalogue and the newer ones posted since, lets you take them apart and shows how the exact results are proved. It also has computer-checked results of our own: proofs that 21, 32, 45 and 60 squares need sides 5, 6, 7 and 8, that k² − 3 squares need side k for every k ≥ 6, a better floor for 12 squares, and a proof for 13 with no case analysis. All are unrefereed.

Up to date as of 2026-10-17. Since mid-September smaller packings than the catalogue's have been posted for 76 counts up to n = 308, by Francisco Couzo, Nate Chaoweeraprasit (itsnaka), Ryan Xu (ry-xu), Daniil Ostashev, Mishapolk, Joost de Winter, PingYou Ltd and us. They are drawn here with credit to whoever posted each first; the ones not yet accepted on jlevy/squares' register say so. Every record is drawn from a certified copy, regularized for display (Sources §1).

hover a tile · click one to explore its packing · ● proved optimal · ○ proved in 2026, unrefereed, verified on jlevy/squares

Squares in rectangles, n = 3, 4, 5

Exactly which rectangles hold three, four or five unit squares at any angles. The boundaries are Friedman's 2010 constructions, some with tilted squares; the proofs that they cannot be beaten are new, in Lean with no hypothesis.

s(k² − 4) = k for all k ≥ 5

Four squares short of any grid from 5 × 5 up, the grid is optimal: the deficit-4 case of Friedman's conjecture. From 8 × 8 up, the k² − 3 method with a wider band, checked once in the 9 × 9 box and carried to every k by Lean; below that, s(21), s(32), s(45). Reviewed; the box's tilted squares re-checked by wand125's separately written exact checker, not yet register-verified.

s(k² − 3) = k for all k ≥ 6

Three squares short of any grid from 6 × 6 up, the grid is optimal. One pattern of mass for every box size, checked once in the 7 × 7 box by two separately written exact checkers (ours and wand125's), and carried to every k by a Lean proof. Confirmed on jlevy/squares (T-064).

s(32) = 6

Thirty-two unit squares need a square of side 6. As far as we know the first exact value of s(k² − 4) for any k ≥ 4; checked by two separately written exact checkers and in full inside Lean's kernel.

s(21) = 5

Twenty-one unit squares need a square of side 5. The proof puts most of its weight evenly along the grid lines instead of on points; two separately written exact checkers, and a Lean theorem conditional on their covering statement.

s(45) = 7

Forty-five unit squares need a square of side 7: the s(21) method one size up, checked by the same two exact checkers. Not in Lean yet.

s(60) = 8

Sixty unit squares need a square of side 8, and so do 61: the same method again, the same two exact checkers. Not in Lean yet.

s(12) ≥ 3.9686

A floor for twelve squares, up from 3.7889 (now nudged to 3.9715 by squarepacker's re-weighting of the same points), checked exactly over every position and angle and in full inside Lean's kernel. Also our floor for eleven squares, since overtaken; s(11) itself was settled by others on 2026-09-29.

s(13) = 4 without cases

Bentz's theorem from one weighted cover, with no case analysis; checked by two exact checkers and in full inside Lean's kernel.

The s(110) landscape

1,076 certified local minima below 11, all one structure, within 0.0032 of each other. Why each one is stuck, how much the box must grow to move between them, and an animated tour through 50 of them.

Explore

Every record packing, with its angles, contacts, free squares and smallest gaps measured. Start with the famous 17.

Compare

All the packings found for one n, oldest first, and a slider that morphs one into another.

Bounds

Best packing versus proven floor for n up to 100, and how the gap has closed over time.

Proofs & results

How you prove no better packing exists: unavoidable points, with a playground for the 12-square case, and what the method has proved.

Sources

Who found what, when; papers, pages, videos. One list.