[Back to projects]

least-space-squares


Finds the tightest packing of n unit squares inside a bigger square. matches 84 of the 100 best known records with closed form constructions, a tilted block search and numerical compaction, n=100000 in about 4 seconds and 0.08 in the browser.


Tech Stack

  • Python
  • Numpy
  • Algorithms

Deliverables & Links