set-cover: Solve exact set cover problems like Sudoku, 8 Queens, Soma Cube, Tetris Cube

[ algorithms, bsd3, library, math ] [ Propose Tags ]

Solver for exact set cover problems. Included examples: Sudoku, 8 Queens, Soma Cube, Tetris Cube. 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.

Versions 0.0, 0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5,, 0.0.6, 0.0.7, 0.0.8, 0.0.9
Dependencies array (>=0.1 && <0.5), base (==4.*), containers (>=0.4 && <0.6), set-cover, utility-ht (>=0.0.1 && <0.1) [details]
License BSD-3-Clause
Author Henning Thielemann, Helmut Podhaisky
Maintainer Henning Thielemann <>
Category Math, Algorithms
Home page
Source repo this: darcs get --tag 0.0
head: darcs get
Uploaded by HenningThielemann at Fri Aug 30 18:51:05 UTC 2013
Distributions LTSHaskell:0.0.9, NixOS:0.0.9, Stackage:0.0.9, openSUSE:0.0.9
Executables sudoku-setcover, queen8, soma-cube, tetris-cube
Downloads 2876 total (31 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI





Build example executables


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


Maintainer's Corner

For package maintainers and hackage trustees