@hackage set-cover0.0.8
Solve exact set cover problems like Sudoku, 8 Queens, Soma Cube, Tetris Cube
Categories
License
BSD-3-Clause
Maintainer
Henning Thielemann <haskell@henning-thielemann.de>
Links
Versions
Installation
Dependencies (5)
- base >=4 && <4.11
- containers >=0.4 && <0.6
- enummapset >=0.1 && <0.6
- psqueues >=0.2 && <0.3
- utility-ht >=0.0.12 && <0.1 Show all…
Dependents (2)
@hackage/battleship-combinatorics, @hackage/acme-everything
Package Flags
buildexamples
(off by default)
Build example executables
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.