set-cover
Version 0.1.1 revision 0 uploaded by HenningThielemann.
Package meta
- Synopsis
- Solve exact set cover problems like Sudoku, 8 Queens, Soma Cube, Tetris Cube
- Description
Solver for exact set cover problems. Included examples: Sudoku, Nonogram, 8 Queens, Domino tiling, Mastermind, Alphametics, Soma Cube, Tetris Cube, Cube of L's, Logika's Baumeister puzzle, Lonpos pyramid, Conway's puzzle. The generic algorithm allows to choose between slow but flexible
Setfromcontainerspackage and fast but cumbersome bitvectors.For getting familiar with the package I propose to study the Queen8 example along with Math.SetCover.Exact.
The Sudoku and Nonogram examples also demonstrate how to interpret the set-cover solution in a human-friendly way.
Build examples with
cabal install -fbuildExamples.The package needs only Haskell 98. There is also an experimental implementation using LLVM and
knead. Do not rely on that interface in released packages.- Author
- Henning Thielemann, Helmut Podhaisky
- Bug reports
- n/a
- Category
- Math, Algorithms
- Copyright
- n/a
- Homepage
- http://hub.darcs.net/thielema/set-cover/
- Maintainer
- Henning Thielemann <haskell@henning-thielemann.de>
- Package URL
- n/a
- Stability
- n/a