Subject: fillit.en.pdf
The goal of this project was to find an algorithm (if possible the fastest) that can fit tetriminos in the smallest square possible.
Build:
make
Solve for a file:
$ cat sample
....
##..
.#..
.#..
....
####
....
....
#...
###.
....
....
....
##..
.##.
....
$ ./fillit sample
DDAA
CDDA
CCCA
BBBB