Copyright | (c) Levent Erkok |
---|---|
License | BSD3 |
Maintainer | erkokl@gmail.com |
Stability | experimental |
Safe Haskell | None |
Language | Haskell2010 |
Documentation.SBV.Examples.Puzzles.Sudoku
Description
The Sudoku solver, quintessential SMT solver example!
Synopsis
Modeling Sudoku
check :: [SInteger] -> SBool Source #
Given a series of elements, make sure they are all different and they all are numbers between 1 and 9
Solving Sudoku puzzles
fillBoard :: Puzzle -> IO Puzzle Source #
Fill a given board, replacing 0's with appropriate elements to solve the puzzle
Example boards
According to the web, this is the toughest. sudoku puzzle ever.. It even has a name: Al Escargot: http://zonkedyak.blogspot.com/2006/11/worlds-hardest-sudoku-puzzle-al.html
allPuzzles :: IO () Source #
Solve them all, this takes a fraction of a second to run for each case