/fillit

[42 cursus] A backtracking algorithm to find the smallest square possible with the given tetriminos.

Primary LanguageC

This repository is not active