fillit

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

fillit @ 42 - space optimization algorithm

Checker for the 42 Fillit project

fillit @ 42 - bitwise implementation

Algorithm X dancing links solver for fillit puzzle

42 Algorithm Project - Tetris solver - Backtracking

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.

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.

Shell script for Fillit project of 42 (Hive Helsinki)

Bitwise Implementation of a Tetromino Board Solver.

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

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

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

fillit - set tetrominos in square

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

Fillit is a project that let you discover and/or familiarize yourself with a recurring problematic in programming: searching the optimal solution among a huge set of possibilities, in a respectable timing.

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

A recurring problem in programming: the search for an optimal solution among a very large number of possibilities, within a reasonable time. In the case of this project, it is a question of packing Tetriminos to determine the smallest possible square that can accommodate them.