levonka / fillit

School 42 project. Fit tetris pieces into the smallest square possible using recursive backtracking

Fillit

Fillit is a School 42 project. The purpose of this project is to create program that forms the smallest possible square from a list of tetriminos.

fillit.en.pdf is the task file.

Usage

Compile the program:

$ make

Run program with file:

$ ./fillit [file]

Final score

100/100 (max)

How does it work

Fillit receives a map text file like this one with pieces:

$ cat sample.fillit
....
##..
.#..
.#..

....
####
....
....

#...
###.
....
....

....
##..
.##.
....

It finds the smallest possible square the pieces can be arranged in and prints out the square like this:

$ ./fillit sample.fillit
DDAA
CDDA
CCCA
BBBB