Fillit is a project that let discover and/or familiarize with a recurring problematic in programming: searching the optimal solution among a huge set of possibilities, in a respectable timing. The goal of this project is to find a way to assemble a given Tetriminos set altogether in the smallest possible square.
The algo for this ptoject - backtracking.

For testing:

1. make
2. ./fillit [file] This file has a very specific format : every Tetrimino must exactly fit in a 4 by 4 chars square and all Tetrimino are separated by an newline each.
   Examles of valid file:

Output example:

AABBDD.
A.BBDD.
ACCCCFF
EE..FF.
.EEHHII
.G.H..I
GGGH..I

Here each letter represent each tetriminos. In this particular case from A to G. Maximum it can be 26 tetreminos pieces.