Tetris puzzle solver written in Haskell. It is an example implementation of depth-first search (DFS) algorithm.
There are 233 956 different solutions for 8x7 board.
$ cabal run
It prints out a random solution for 8x7 board.
| Name | Name | Last commit date | ||
|---|---|---|---|---|