Pinned
Sure! Here's how the tightest (known) packing of 67, 6767 and 676767 squares in a larger square looks like:
I made the most optimized algorithm to find out the tightest packing of n smaller squares in a larger square
test it out: forloopcodes.github.io/least-space-sq… (runs on your gpu)
