02 / Expérimentations
Fillit
Algorithmic C experiment for the 42 Paris School
À propos
Pack Tetris pieces into the smallest possible square. Given any set of tetriminos, find the tightest arrangement, a puzzle solver that brute-forces its way to the optimal fit.