README edit

This commit is contained in:
Manzovince
2019-04-27 16:38:28 +02:00
parent faae791431
commit 12fff81bde

View File

@@ -1,6 +1,8 @@
# Fillit
**hulamy** and **vmanzoni**
Team: **hulamy** and **vmanzoni**
Le but de ce projet est dagencer 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 semboîtent pas parfaitement.
## To do
@@ -11,10 +13,10 @@
- [x] Transform file into tetriminos
- [ ] Backtracking for smallest square
- [ ] Transform tetriminos to letters
- [ ] Print result
- [ ] Print result (Can be done with above step)
- [ ] Free everything (NO LEAKS)
## BONUS
- [x] `ft_check_tetri_errors` indicate which tetri is wrong
- [ ] Optimisation
- [ ] `ft_check_tetri_errors` indicate which tetri is wrong
- [ ] Add colors to tetri when printing result map