sciolizer / exact_cover Goto Github PK

Good to come across this library, which looks well-implements.

Trying it out on your sample grid

g1 =
["003020600",
"900305001",
"001806400",
"008102900",
"700000008",
"006708200",
"002609500",
"800203009",
"005010300"]

sampleGrid :: Grid
sampleGrid = zipWith3 (\r c v -> Move (r, c) v) rows cols vals
where
rows, cols, vals :: [Int]
rows = [ n | n <- [0..8], _ <- [0..8]]
cols = [ m | _ <- [0..8], m <- [0..8]]
vals = map digitToInt (concat g1)

result = solveSudoku sampleGrid

triggers the "invalid state" error. Is this an issue with the constraint / satisfier specification, or with solve, do you think?

Hi,

Searching for an Algorithm X implementation in Haskell, I came across your repository. Would you be willing to provide an example or give me a hint as to how to implement your code when each set is presented as a list of a list of ints ( i.e., each set is type [[Int]] )? One subset of each set needs to be chosen where in the final result none of these subsets share any elements (their intersections are null).