GitHub - s-adamantine/fillit: [42] Find the smallest square that a given number of tetris pieces can fit in. Done using a backtracking algorithm.

s-adamantine / fillit Public

[42] Find the smallest square that a given number of tetris pieces can fit in. Done using a backtracking algorithm.

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 55 Commits
libft		libft
Makefile		Makefile
fillit.c		fillit.c
fillit.h		fillit.h
fit.c		fit.c
insert.c		insert.c
map.c		map.c
parse.c		parse.c
solve.c		solve.c
tetrimino.c		tetrimino.c

About

[42] Find the smallest square that a given number of tetris pieces can fit in. Done using a backtracking algorithm.

No releases published

No packages published