Algorithms - Fit tetris pieces into the smallest square possible using recursive backtracking.
-
Updated
Jul 16, 2019 - C
#
fillit
Here are 60 public repositories matching this topic...
fillit @ 42 - space optimization algorithm
-
Updated
Jul 12, 2019 - C
fillit @ 42 - bitwise implementation
-
Updated
Jul 12, 2019 - C
Checker for the 42 Fillit project
-
Updated
Jan 26, 2019 - C
Algorithm X dancing links solver for fillit puzzle
-
Updated
Nov 22, 2019 - C
42 Algorithm Project - Tetris solver - Backtracking
-
Updated
May 15, 2019 - C
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.
-
Updated
Sep 5, 2017 - C
Tester for the 42 School's fillit project.
-
Updated
Jul 14, 2022 - Shell
Le but ce projet est d'agencer des Tetriminos entre eux et de determiner le plus petit carre possible pouvant les accuellir.
-
Updated
Nov 11, 2019 - C
Shell script for Fillit project of 42 (Hive Helsinki)
-
Updated
Feb 22, 2022 - Shell
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
c algorithm puzzle matrix macros fillit memory-allocation problem-solving dots tetrominoes tetrominos tetros
-
Updated
Nov 5, 2020 - C
Bitwise Implementation of a Tetromino Board Solver.
bits project bitwise operations fillit bitwise-fillit implementation bitwise-operators 42 fillit-bitwise 42-fillit-bitwise bitwise-operations
-
Updated
May 16, 2019 - C
Program who sort tetriminos to find best placement (like Tetris)
-
Updated
Sep 7, 2020 - C
a program to fill the smallest square with given tetrominos (using Knuth's Algorithm X)
-
Updated
May 30, 2018 - C
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.
-
Updated
Nov 4, 2017 - C
The main repo for all of my files and code for the 42 school
fractal fillit raytracer rtv1 libft fractol fdf get-next-line init 42born2code 42 42school fractal-rendering piscine-c fdf-42 rtv1-42 roger-skyline-1
-
Updated
Sep 27, 2024 - C
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…
-
Updated
Nov 15, 2019 - C
Improve this page
Add a description, image, and links to the fillit topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the fillit topic, visit your repo's landing page and select "manage topics."