exact-cover alternatives and similar packages
Based on the "Algorithms" category.
Alternatively, view exact-cover alternatives based on common mentions on social networks and blogs.
-
arithmoi
Number theory: primes, arithmetic functions, modular computations, special sequences -
presburger
Decision procedures for Presburger arithmetic in Haskell -
text-metrics
Calculate various string metrics efficiently in Haskell -
imj-animation
Monorepo for a multi-player game engine, and game examples -
lca
Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing -
search-algorithms
Haskell library containing common graph search algorithms -
-
treeviz
Haskell library for visualizing algorithmic decomposition of computations. -
incremental-sat-solver
Simple, Incremental SAT Solving as a Haskell Library -
integer-logarithms
Integer logarithms, originally split from arithmoi package -
GraphSCC
Tarjan's algorithm for computing strongly connected components -
infinite-search
An implementation of Martin Escardo's exhaustively searchable sets in Haskell. -
-
nonlinear-optimization-ad
Wrapper of nonlinear-optimization package for using with ad and backprop packages -
primesieve
A collection of packages related to math, algorithms and science, in Haskell. -
adp-multi
Prototype of ADP for MCFL (multiple context-free languages) -
edit-distance-vector
Calculate edit scripts and distances between Vectors. -
graph-generators
A Haskell library for creating random Data.Graph instances using several pop -
edit-distance-linear
Levenshtein edit distance in linear memory (also turns out to be faster than C++) -
bordacount
Haskell implementation of the Borda count election method -
epanet-haskell
Call the EPANET toolkit via Haskell's Foreign Function Interface -
dgim
:chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of exact-cover or a related project?
|
Scout APM: A developer's best friend. Try free for 14-days
sponsored
scoutapm.com
|
Popular Comparisons
-
exact-covervsGraphSCC
-
fibonaccivspell
-
arithmoivsunion-find
-
infinite-searchvsincremental-sat-solver
-
graphsvsersatz
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
The exact-cover package
exact-cover is a Haskell library that implements a fast solver
for exact cover problems using
Algorithm X as described in the
paper Dancing Links, by Donald Knuth, in
Millennial Perspectives in Computer Science, P159, 2000.
See exact-cover on Hackage
for more information.
Examples
You will need to set the buildExamples flag to build the executable samples.
e.g. on stack, do
stack build --flag exact-cover:buildExamples
Sudoku
After setting the buildExamples flag above, the sudoku example can be run with
stack exec sudoku
Interesting sudoku puzzles that one might use to try out the solver:
Unsolvable “puzzle” that took Peter Norvig’s solver 1439 seconds to prove that there is no solution:
.....5.8....6.1.43..........1.5........1.6...3.......553.....61........4.........Finnish mathematician Arto Inkala’s 2006 puzzle
85...24..72......9..4.........1.7..23.5...9...4...........8..7..17..........36.4...53.....8......2..7..1.5..4....53...1..7...6..32...8..6.5....9..4....3......97..A compilation of resources, which includes lists of “hardest sudokus”.