Algorithms Practice - Fit tetris pieces into the smallest square possible.
C Language | Makefile | | Headerfile | Backtracking Algorithm
You'll have to clone the Fillit repo:
git clone https://github.com/tasmiarahmantanjin/fillit
Then you'll have to compile the project & use test input :
1. cd fillit
2. make
3. ./fillit tetrimino_input_file
Now you can run ./fillit <tetriminos_file>
^^ E N J O Y ^^
1. Precisely 4 lines of 4 characters (4 x 4 square), each followed by a new line
2. A Tetrimino is a classic piece of Tetris composed of 4 blocks
3. Each character must be either a block character # or an empty character .
4. Each block of a Tetrimino must touch at least one block on any of his 4 sides(up, down, left and right)
5. No rotation is possible, which means a rotated Tetrimino describes a differentone
6. Shift is possible
Feel free to file a new issue with a respective title and description on the repository.