Algorithms - Fit tetris pieces into the smallest square possible using recursive backtracking.

fillit @ 42 - space optimization algorithm

fillit @ 42 - bitwise implementation

Checker for the 42 Fillit project

Algorithm X dancing links solver for fillit puzzle

Fillit is a project who let you discover and/or familiarize yourself with a recurring problematic in programming : searching for the optimal solution among a huge set of possibilities. In this particular project, you will be charged of creating an algorithm which fits some Tetriminos together into the smallest possible square.

42 Algorithm Project - Tetris solver - Backtracking

Tester for the 42 School's fillit project.

Le but ce projet est d'agencer des Tetriminos entre eux et de determiner le plus petit carre possible pouvant les accuellir.

A program that finds minimum board size for tetrominos.

The main repo for all of my files and code for the 42 school

This was a group project in Hive. We were 2 people in our group. For this project, my contribution mostly on validation and matrix creation to setting up the valid tetros

Shell script for Fillit project of 42 (Hive Helsinki)

Bitwise Implementation of a Tetromino Board Solver.

Program who sort tetriminos to find best placement (like Tetris)

a program to fill the smallest square with given tetrominos (using Knuth's Algorithm X)

fillit - set tetrominos in square

This projects seeks in discovering and/or familiarizing a recurring problematic in programming: searching for the optimal solution among a huge set of possibilities.

fillit project for 42 school. This project consists in coding a tetris-like game in C.

Algorithmic C project for the 42 Paris School