2019-05-29 13:12:31 +02:00
2019-04-14 14:24:50 +02:00
2019-05-27 19:53:27 +02:00
2019-05-29 13:10:21 +02:00
2019-04-30 14:11:56 +02:00
2019-05-17 17:13:31 +02:00
2019-04-24 12:16:01 +02:00
2019-04-23 16:17:13 +02:00

Fillit

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

  • 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

  • Best error handler (more details on why there is an error.)
  • Optimisation
  • Add colors to tetri when printing result map
Description
No description provided
Readme 346 KiB
Languages
C 97.1%
Makefile 2.9%