Skip to content

Latest commit

 

History

History
7 lines (6 loc) · 370 Bytes

README.md

File metadata and controls

7 lines (6 loc) · 370 Bytes

fillit

It is a Unit Factory educational project. The goal is to find the smallest square in the minimal amount of time from Tetriminos - Tetris pieces of 4 blocks.

Algorithm

It uses the Algorithm X to find the best combination of Tetriminos. Algorithm X is a recursive algorithm, that uses matrix of "dancing links" to try all possible combination of Tetriminos.