https://github.com/staeter/fillit
[42 cursus] A backtracking algorithm to find the smallest square possible with the given tetriminos.
https://github.com/staeter/fillit
Last synced: about 1 year ago
JSON representation
[42 cursus] A backtracking algorithm to find the smallest square possible with the given tetriminos.
- Host: GitHub
- URL: https://github.com/staeter/fillit
- Owner: staeter
- Created: 2018-11-17T15:35:46.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2019-02-23T17:07:53.000Z (over 7 years ago)
- Last Synced: 2025-02-21T18:22:49.265Z (over 1 year ago)
- Language: C
- Homepage:
- Size: 990 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files: