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.
-
Notifications
You must be signed in to change notification settings - Fork 0
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.
akaseris/42Fillit
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
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.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published