05e265b3b14bbb06fb8e838367816ca304c5b2fb
Fillit
Team: hulamy and vmanzoni
Le but de ce projet est d’agencer les Tetriminos entre eux pour former le plus petit carré possible, sachant que ce carré peut présenter des trous quand les pièces données ne s’emboîtent pas parfaitement.
To do
- Check if we have a file
- Read file
- Check if there are errors in file
- Check if every tetrimino is valid
- Transform file into tetriminos
- Backtracking for smallest square
- Transform tetriminos to letters
- Print result (Can be done with above step)
- Free everything (NO LEAKS)
BONUS
ft_check_tetri_errorsindicate which tetri is wrong- Optimisation
- Add colors to tetri when printing result map
Description
Languages
C
97.1%
Makefile
2.9%