Solves the puzzle with brute-force

Fillit

Fillit is a project that allows you to discover and / or familiarize yourself with a recurrent 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 will be a question of arranging Tetriminos between them and to determine the smallest possi…

Make the smallest square from a formatted list of tetriminos

C language | Lineup Tetramine | [name]Fillit

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.

Solves an optimization problem by arranging Tetriminos into the smallest possible square using efficient backtracking algorithms. Developed as part of the 42 School curriculum.

algorithm backtracking

A project for 42. Find the smallest square that given tetronimos (tetris pieces) fit in to.

Tetramino

Tiny shell script for testing 42 fillit project ⚒️

Réalisation d'un projet permettant d'agencer des Tetriminos entre eux et de déterminer le plus petit carré possible pouvant les accueillir.

Fillit is a tetris piece solver. The solver will calculate the smallest possible square to fit the given pieces and then print the solution.

42 fillit project

🏫 UNIT Factory (Ukrainian National IT Factory) — Ukraine's only institution that works by innovative standards of French School “42”.

Впихиваем тетраминки из файла в минимально возможный квадрат

Fillit is about finding optimal solution among huge set of possibilities.

42 Team Project `Fillit`