Fillit

A constraint programming problem solver. The goal is to arrange a set of Tetris-like pieces (tetriminos) into the smallest possible square. It uses a backtracking algorithm to recursively place pieces, optimizing for space and efficiency. This project is a classic introduction to recursion and algorithm optimization.