@hackage set-cover0.0

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

Categories
- Algorithms
- Mathematics
License
BSD-3-Clause
Maintainer
Henning Thielemann <haskell@henning-thielemann.de>
Links
Versions
- 0.1.1 Sat, 6 Aug 2022
- 0.1 Sat, 31 Aug 2019
- 0.0.9 Tue, 8 Jan 2019
- 0.0.8 Mon, 1 Oct 2018
- 0.0.7 Mon, 1 Oct 2018
- 0.0.6 Mon, 1 Oct 2018

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.

Installation
In your cabal file:
Dependencies (3)
- base >=4 && <4.11
- containers >=0.4 && <0.6
- utility-ht >=0.0.1 && <0.1
Dependents (1)
@hackage/battleship-combinatorics

Package Flags

buildexamples

(off by default)

Build example executables

@hackage set-cover0.0

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (3)

Dependents (1)

Package Flags