Fillit is a 2D grid shape optimization algorithm. It takes a set of tetromino-shapes as input and outputs the smallest square-grid that fits all the given pieces without overlap. The pieces cannot be rotated. The program also outputs the visualization of the unambiguous solution for the smallest square grid that prioritizes the order of the set from left to right, down from up.

Written in Core C

Public repository of the project can be found here.