Solve exact set cover problems like Sudoku, 8 Queens, Soma Cube, Tetris Cube http://hub.darcs.net/thielema/set-cover/
|Latest on Hackage:||0.0.8|
This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.
Solver for exact set cover problems.
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
and fast but cumbersome bitvectors.
For getting familiar with the package
I propose to study the Queen8 example along with
Build examples with
cabal install -fbuildExamples.
The package needs only Haskell 98.
Change log for the
SetCover.Exact.Priorityimplements the Algorithm X using a priority queue that registers the sets each element is contained in. This allows for drastic speedup of the
ESC.bitVectorFromSetAssignsallows to turn sets into bit vectors without manual bit position gymnastics.
Use it in
example/Nonogram: explore different encodings of the problem