light-yellow / 42_fillit

Finding the smallest square made up of tetriminos using bit shifting and backtracking.

About

A Tetriminos is a 4-blocks geometric figure most known thanks to the popular game Tetris. The goal of this project is to arrange the Tetriminos among themselves to make the smallest possible square. The Tetriminos are ordered as they appear in the input file. Among the different solutions possible to make the smallest square, the correct solution is where Tetriminos is placed on their most upper-left position.

Usage

Run make to compile an executable called fillit. Then run it with your input file: ./fillit [file].

Example

$> cat sample.fillit | cat -e
...#$
...#$
...#$
...#$
$
....$
....$
....$
####$
$
.###$
...#$
....$
....$
$
....$
..##$
.##.$
....$
$
....$
.##.$
.##.$
....$
$
....$
....$
##..$
.##.$
$
##..$
.#..$
.#..$
....$
$
....$
###.$
.#..$
....$

$> ./fillit sample.fillit | cat -e
ABBBB.$
ACCCEE$
AFFCEE$
A.FFGG$
HHHDDG$
.HDD.G$