The set-cover package

[Tags: bsd3, library]

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

For getting familiar with the package I propose to study the Queen8 example along with Math.SetCover.Exact.

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, 0.0.5
Change logNone available
Dependenciesarray (>=0.1 && <0.6), base (==4.*), containers (>=0.4 && <0.6), haha (>=0.3.1 && <0.4), pooled-io (==0.0.*), random (==1.0.*), set-cover, transformers (>=0.2 && <0.5), unicode (==0.0.*), utility-ht (>=0.0.1 && <0.1) [details]
AuthorHenning Thielemann, Helmut Podhaisky
MaintainerHenning Thielemann <>
CategoryMath, Algorithms
Home page
Source repositorythis: darcs get --tag 0.0.5
head: darcs get
Executablespangram, mastermind, nonogram, domino, alphametics, lonpos-pyramid, baumeister, lcube, sudoku-setcover, queen8, soma-cube, tetris-cube
UploadedWed Aug 19 10:33:09 UTC 2015 by HenningThielemann
Downloads826 total (56 in last 30 days)
0 []
StatusDocs available [build log]
Last success reported on 2015-08-19 [all 1 reports]




buildexamplesBuild example executablesDisabledAutomatic

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


Maintainers' corner

For package maintainers and hackage trustees