set-cover: Solve exact set cover problems like Sudoku, 8 Queens, Soma Cube, Tetris Cube
Solver for exact set cover problems.
Included examples:
Sudoku, Nonogram, 8 Queens, Domino tiling, Mastermind, Alphametics,
Soma Cube, Tetris Cube, Cube of L's,
Logika's Baumeister puzzle, Lonpos pyramid, Conway's 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.
The Sudoku and Nonogram examples also demonstrate how to interpret the set-cover solution in a human-friendly way.
Build examples with cabal install -fbuildExamples.
The package needs only Haskell 98.
There is also an experimental implementation using LLVM and knead.
Do not rely on that interface in released packages.
Flags
Manual Flags
| Name | Description | Default |
|---|---|---|
| llvm | Enable efficient signal processing using LLVM | Disabled |
Automatic Flags
| Name | Description | Default |
|---|---|---|
| buildexamples | Build example executables | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- set-cover-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 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, 0.1.1.1 |
|---|---|
| Change log | Changes.md |
| Dependencies | array (>=0.4 && <0.6), base (>=4 && <5), containers (>=0.4 && <0.7), enummapset (>=0.1 && <0.7), haha (>=0.3.1 && <0.4), non-empty (>=0.2 && <0.4), pooled-io (>=0.0 && <0.1), prelude-compat (<1), psqueues (>=0.2 && <0.3), random (>=1.0 && <1.2), semigroups (>=0.1 && <1.0), set-cover, transformers (>=0.2 && <0.6), unicode (>=0.0 && <0.1), utility-ht (>=0.0.12 && <0.1) [details] |
| Tested with | ghc ==7.4.2, ghc ==7.6.3, ghc ==7.8.2 |
| License | BSD-3-Clause |
| Author | Henning Thielemann, Helmut Podhaisky |
| Maintainer | Henning Thielemann <haskell@henning-thielemann.de> |
| Uploaded | by HenningThielemann at 2019-08-31T18:31:49Z |
| Category | Math, Algorithms |
| Home page | http://hub.darcs.net/thielema/set-cover/ |
| Source repo | this: darcs get http://hub.darcs.net/thielema/set-cover/ --tag 0.1 head: darcs get http://hub.darcs.net/thielema/set-cover/ |
| Distributions | LTSHaskell:0.1.1.1, Stackage:0.1.1.1 |
| Reverse Dependencies | 2 direct, 0 indirect [details] |
| Executables | conway-puzzle, pangram, mastermind-knead, mastermind-setcover, nonogram, domino, alphametics, lonpos-pyramid, baumeister, lcube, sudoku-setcover, queen8, soma-cube, tetris-cube |
| Downloads | 10289 total (34 in the last 30 days) |
| Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |