GitHub - staeter/fillit: [42 cursus] A backtracking algorithm to find the smallest square possible with the given tetriminos. · GitHub

Name		Name	Last commit message	Last commit date
Latest commit History 42 Commits
libft		libft
Makefile		Makefile
auteur		auteur
backtrack.c		backtrack.c
check.c		check.c
fillit.h		fillit.h
gaps.c		gaps.c
grid_0.c		grid_0.c
grid_1.c		grid_1.c
main.c		main.c
move_0.c		move_0.c
move_1.c		move_1.c
node.c		node.c
print.c		print.c
reader.c		reader.c
tetri.c		tetri.c
tetrilist.c		tetrilist.c

About

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

0 stars

0 watching

Report repository

Releases

Packages

Contributors

Languages