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

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

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

algorithm backtracking

Tetramino

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

Solves the puzzle with brute-force

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

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

An algorithm which fits some Tetrominos together into the smallest possible square.

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

The goal of this project is to fill in a grid of empty spaces. Each valid space is represented by a dot ‘.’ character.

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 possi- bilities, in a respectable timing.

Algorithm X dancing links solver for fillit puzzle

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…

fillit - set tetrominos in square

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