Another Better Lower Bound for N=17 Square Packing

Researchers have improved the lower bound for s(17), the side length of the smallest square that can contain 17 unit squares, from 4.4452 to 4.5058. The new bound narrows the gap between the proven lower bound and the known upper bound of 4.6756, bringing closer to finding the exact optimal packing arrangement for 17 unit squares.