TMoska / fillit

Algorithm project that uses backtracking technique to find a solution to a smallest possible map, given the tetrimino figures. Goal is to arrange each tetrimino int the smallset map possible.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

TMoska/fillit Issues

No issues in this repository yet.