The set-cover package

[Tags: bsd3, library]

Solver for exact set cover problems. Included examples: Sudoku, 8 Queens, Soma Cube, Tetris Cube, Cube of L's, Logika's Baumeister puzzle. Generic algorithm allows to choose between slow but flexible Set from containers package and fast but cumbersome bitvectors.

Build examples with cabal install -fbuildExamples.

The package needs only Haskell 98.


Versions0.0, 0.0.1, 0.0.2, 0.0.3, 0.0.4
Change logNone available
Dependenciesarray (>=0.1 && <0.5), base (==4.*), containers (>=0.4 && <0.6), set-cover, transformers, utility-ht (>=0.0.1 && <0.1)
AuthorHenning Thielemann, Helmut Podhaisky
MaintainerHenning Thielemann <>
CategoryMath, Algorithms
Home page
Source repositorythis: darcs get --tag 0.0.4
head: darcs get
Executablesdomino, alphametics, baumeister, lcube, sudoku-setcover, queen8, soma-cube, tetris-cube
UploadedWed Jan 1 18:16:08 UTC 2014 by HenningThielemann
Downloads734 total (38 in last 30 days)
StatusDocs available [build log]
Successful builds reported [all 1 reports]




buildexamplesBuild example executablesDisabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainers' corner

For package maintainers and hackage trustees