Deux joueurs s’affrontent sur un plateau, et doivent placer, tour à tour, un tetriminos dans le but d'en placer le maximum.
-
Updated
May 11, 2020 - C
Deux joueurs s’affrontent sur un plateau, et doivent placer, tour à tour, un tetriminos dans le but d'en placer le maximum.
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.
Put Tetris in the Minimum Squard ◻️
Tetriminos generator for 42 fillit project ⚒️
Algorithm that finds smallest squares of tetriminos, using recursive backtracking.
An algorithmic game of piece placing
👾This is the story of a piece of Tetris, one little square and a dev walk into a bar...
Réalisation d'un projet permettant d'agencer des Tetriminos entre eux et de déterminer le plus petit carré possible pouvant les accueillir.
Add a description, image, and links to the tetriminos topic page so that developers can more easily learn about it.
To associate your repository with the tetriminos topic, visit your repo's landing page and select "manage topics."