/fillit

Program that finds the smallest square for tetris pieces.

Primary LanguageC

fillit

Program that finds the smallest square for tetris pieces(tetriminos).

This program uses recursive backtracking to edit a single string. The purpose of this program is to fit any number of tetriminos into a square in the smallest way possible.

Optimization: O(n^2)

Co - created with Sean Jones.