Popularity
1.1
Declining
Activity
0.0
Stable
1
1
0

Monthly Downloads: 11
Programming language: C
License: BSD 3-clause "New" or "Revised" License
Tags: Algorithms     Math    

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.

Do you think we are missing an alternative of exact-cover or a related project?

Add another 'Algorithms' Package

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:

  1. 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.........
    
  2. Finnish mathematician Arto Inkala’s 2006 puzzle

    85...24..72......9..4.........1.7..23.5...9...4...........8..7..17..........36.4.
    

    2010 puzzle

    ..53.....8......2..7..1.5..4....53...1..7...6..32...8..6.5....9..4....3......97..
    
  3. A compilation of resources, which includes lists of “hardest sudokus”.