A recurring problem in programming: the search for an optimal solution among a very large number of possibilities, within a reasonable time. In the case of this project, it is a question of packing Tetriminos to determine the smallest possible square that can accommodate them.