# Difference between revisions of "Tetris Cube"

From HaskellWiki

(introduce the puzzle, link to solutions) |
(TetrisCube moved to set-cover package) |
||

Line 3: | Line 3: | ||

We have developed a Haskell solver that uses bit manipulation and parallel computing for fast retrieval of all solutions. On a 2 GHz machine with 4 cores the program needs about an hour to find all 9839 solutions. |
We have developed a Haskell solver that uses bit manipulation and parallel computing for fast retrieval of all solutions. On a 2 GHz machine with 4 cores the program needs about an hour to find all 9839 solutions. |
||

− | * [http://code.haskell.org/~thielema/ |
+ | * [http://code.haskell.org/~thielema/set-cover/example/TetrisCube.hs Haskell solution] in the package {{HackagePackage|id=set-cover}} |

− | * [http://code.haskell.org/~thielema/ |
+ | * [http://code.haskell.org/~thielema/set-cover/example/TetrisCube.tar.bz2 Tarball] containing all 9839 solutions. |

* [http://www.scottkurowski.com/tetriscube/ Detailed description] of the puzzle including a C program for finding all solutions |
* [http://www.scottkurowski.com/tetriscube/ Detailed description] of the puzzle including a C program for finding all solutions |
||

## Latest revision as of 17:13, 30 August 2013

The Tetris Cube is a three dimensional puzzle. It consists of 12 pieces. There are three colors, and there are four pieces of every color. All pieces are distinct. The goal of the puzzle is to arrange all pieces in a 4x4x4 box. We have developed a Haskell solver that uses bit manipulation and parallel computing for fast retrieval of all solutions. On a 2 GHz machine with 4 cores the program needs about an hour to find all 9839 solutions.

- Haskell solution in the package set-cover
- Tarball containing all 9839 solutions.
- Detailed description of the puzzle including a C program for finding all solutions