There are 0 repository under fillit topic.
Algorithms - Fit tetris pieces into the smallest square possible using recursive backtracking.
fillit @ 42 - bitwise implementation
Checker for the 42 Fillit project
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.
Bitwise Implementation of a Tetromino Board Solver.
Shell script for Fillit project of 42 (Hive Helsinki)
fillit project for 42 school. This project consists in coding a tetris-like game in C.
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.
An algorithm which fits some Tetrominos together into the smallest possible square.
Fillit is a tetris piece solver. The solver will calculate the smallest possible square to fit the given pieces and then print the solution.
Designed an Algorithm in C that recursively puts tetrominoes in a smallest square possible
Réalisation d'un projet permettant d'agencer des Tetriminos entre eux et de déterminer le plus petit carré possible pouvant les accueillir.
Впихиваем тетраминки из файла в минимально возможный квадрат