fillit

A very messy but totally functional implementation of Knuth's Dancing Links algorithm built to determine the best fit of a given set of tetris pieces on a square grid of smallest possible dimension.

Name		Name	Last commit message	Last commit date
Latest commit History 23 Commits
libft		libft
testfiles		testfiles
Makefile		Makefile
README.md		README.md
dancing_links.c		dancing_links.c
fillit.h		fillit.h
grid.c		grid.c
input.c		input.c
links.c		links.c
main.c		main.c
relink.c		relink.c
semantics.c		semantics.c
semantics2.c		semantics2.c
shift.c		shift.c
t_col.c		t_col.c
t_env.c		t_env.c
t_link.c		t_link.c
t_link2.c		t_link2.c
t_tet.c		t_tet.c
translate.c		translate.c
unlink_tet.c		unlink_tet.c

samescolas/fillit

Folders and files

Latest commit

History

Repository files navigation

fillit

About

Resources

Stars

Watchers

Forks

Languages