# 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, 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.

Versions [faq] 0.0, 0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5, 0.0.5.1, 0.0.6, 0.0.7, 0.0.8, 0.0.9, 0.1, 0.1.1 Changes.md array (>=0.1 && <0.6), base (>=4 && <4.11), containers (>=0.4 && <0.6), enummapset (>=0.1 && <0.6), haha (>=0.3.1 && <0.4), non-empty (>=0.2 && <0.4), pooled-io (==0.0.*), psqueues (==0.2.*), random (>=1.0 && <1.2), set-cover, transformers (>=0.2 && <0.6), unicode (==0.0.*), utility-ht (>=0.0.12 && <0.1) [details] BSD-3-Clause Henning Thielemann, Helmut Podhaisky Henning Thielemann Revision 1 made by HerbertValerioRiedel at 2018-10-01T21:23:59Z Math, Algorithms http://hub.darcs.net/thielema/set-cover/ this: darcs get http://hub.darcs.net/thielema/set-cover/ --tag 0.0.8head: darcs get http://hub.darcs.net/thielema/set-cover/ by HenningThielemann at 2016-01-18T14:52:54Z NixOS:0.1.1, Stackage:0.0.9 pangram, mastermind, nonogram, domino, alphametics, lonpos-pyramid, baumeister, lcube, sudoku-setcover, queen8, soma-cube, tetris-cube 7623 total (214 in the last 30 days) (no votes yet) [estimated by Bayesian average] λ λ λ Docs uploaded by user All reported builds failed as of 2016-01-20

## Flags

NameDescriptionDefaultType
buildexamples

Build example executables

DisabledAutomatic

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