staeter / fillit

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

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

This repository is not active

About

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


Languages

Language:C 93.7%Language:Makefile 6.3%