fillit @ 42 - space optimization algorithm

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

42 fillit project

fillit @ 42 - bitwise implementation

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

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

Tiny shell script for testing 42 fillit project ⚒️

Make the smallest square from a formatted list of tetriminos

algorithm backtracking

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

C language | Lineup Tetramine | [name]Fillit

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

Tetramino

Shell script for Fillit project of 42 (Hive Helsinki)

Solves the puzzle with brute-force

Bitwise Implementation of a Tetromino Board Solver.

Some sort of Tetris game with automatic filling the game field

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.

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