pawaters / fillit

Tetris algo. Make the smallest possible "square" with a given list of tetrominoes, no external libraries.

fillit

An algorithm to make the smallest possible "square" with a given list of tetrominoes, with no external C libraries.

HOW TO RUN THE PROGRAM:

1. git clone https://github.com/pawaters/fillit
2. open your terminal:

cd fillit
./fillit [input_file_of_your_choice]

For example: ./fillit valid1_test7

WHAT DOES FILLIT DO:

- Input: a text file with tetriminoes. Example:

- Output: gives back the smallest square that fits these tetriminoes

As you can see, each tetrimino is represented with a letter.

HOW DOES IT WORK?

In summary:

1. Main: checks if one file only is given as argument, and performs some basic format checks on the input file.
2. Parse: takes the input file and converts it in a structure we defined, which enables our program to work on it .
3. Validate: makes all the checks on the input so no edge case is left.
4. Solve: we create an initial empty square of size X, try to put the tetriminoes, and if it doesn't work, increase the size and try again.
5. Output & clean up: prints the square with the solution, and frees the memory used we do not need anymore.

For more detail on the logic, please check the files and its comments.