Matched: the best known value
Packing 26 unit squares in a square
What is the smallest square that holds 26 squares of side 1, without overlap? The best known answer is a side of 5.6213203436, from Erich Friedman, 1997. Velmar Cut matched it.
The numbers
| Best known side | 5.6213203436 |
|---|---|
| Best known side, in full | 5.62132034355964 |
| Side from Velmar Cut | 5.6213203436 |
| Side from Velmar Cut, in full | 5.621320343560610 |
| Difference, Velmar Cut minus best known | +9.700E-13 |
| Found by | Erich Friedman, 1997 |
| Status | Best known, not proved |
| Time to reach it | 1.226 s, one run |
| Threads used | 16 |
| Machine | Intel Core i5-12600K, 10 cores, 16 threads |
| Squares | 19 upright, 7 turned |
| A plain grid needs | side 6 |
The time to reach this result on one desktop PC.
The problem at 26 squares
With one square more than a grid of side 5 holds, a plain grid has to jump to side 6. This layout, with seven squares turned at 45 degrees and nineteen upright, needs only 7/2 + (3/2)√2.
A plain grid: side 6
Best known: side 5.6213203436
Blue squares stand upright, orange squares are turned. Both pictures are at the same scale.
History
The best known value at this size is the result of Erich Friedman, 1997, and it is their result that Velmar Cut equals.
Best known, not proved: in Friedman's 2009 survey the best lower bound was 5.3918 (Trevor Green), so a smaller square has not been ruled out.
Erich Friedman's value comes from taking an L shape away from a 37-square packing Evert Stenlund found in early 1980.
| When | Side | Who | What happened |
|---|---|---|---|
| early 1979 | 5 + ½√2 ≈ 5.70711 | Frits Göbel | first, adds two L shapes to the 10-square packing |
| early 1980 | 5/2 + (9/4)√2 ≈ 5.68198 | Evert Stenlund | improved |
| 1984 | ≈ 5.65063 | Walter R. Stromquist | improved |
| 1997 | 7/2 + (3/2)√2 ≈ 5.62132 | Erich Friedman | improved, best known today |
Sources
The best known values come from "Squares in Squares", David Ellsworth, from the original by Erich Friedman.
Each size names who holds its value and since when. It is their result that Velmar Cut equals.
Is the packing valid?
Yes. The certificate passes the exact check: 26 pieces, each exactly a unit square, each inside the box, no two overlapping.
How close is it to the best known value?
The side from Velmar Cut minus the best known value is +9.700E-13, within the rule's 1E-11.
A match: the certificate passes the exact check, and |L - best known| <= 1E-11, the difference published unrounded for each size. L is the side of the certificate's box, rounded up at 15 decimals.
Downloads
The sides in the CSV are in units of one square's side. DXF and DWG are in millimetres, with squares of 100 mm.
You don't have to trust us
With plain Python and no other software, verify_exact.py beside the certificate checks the file above by exact arithmetic, with no rounding.
python verify_exact.py 26-squares-in-a-square.csv --squares=26 --reference=5.62132034355964 --epsilon=1e-11It does not prove that the packing is optimal, that the reference is the current best known value, or how the layout was found.
Free trial
Seven days with every edition
Install Velmar Cut, enter the parts and stock of a current job and print the cutting schedule. The trial starts on first run and needs no account or card.