GitHub - samuelkarani/42-fillit: Implementation of a backtracking search algorithm. Involves arranging and fitting a set of Tetriminos to create the smallest possible square from a very large number of possibilities

samuelkarani / 42-fillit Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Implementation of a backtracking search algorithm. Involves arranging and fitting a set of Tetriminos to create the smallest possible square from a very large number of possibilities

1 star 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
tests		tests
.gitignore		.gitignore
Makefile		Makefile
author		author
board.c		board.c
board_helper.c		board_helper.c
fillit.c		fillit.c
fillit.en.pdf		fillit.en.pdf
fillit.h		fillit.h
libft.c		libft.c
parser.c		parser.c
pieces.c		pieces.c
pieces_checks.c		pieces_checks.c
pieces_helper.c		pieces_helper.c
utils.c		utils.c

About

Implementation of a backtracking search algorithm. Involves arranging and fitting a set of Tetriminos to create the smallest possible square from a very large number of possibilities

c search-algorithm search-optimization

Activity

1 star

1 watching

0 forks

Report repository