Sudoku solver written in Haskell using classical backtrack algorithm. Project can be built and run with stack environment.
stack build
stack exec -- sudoku-solver-haskell-exe <maxDepth> <InputData/input<x>.txt
maxDepth: maximum level in the recursive tree where we process each branch subtree parallelly. If maxDepth=0, then it's a normal recurisve algorithm without parallelization. Default option for is 0 if we don't have any command line arguments.
Stored in InputData. Examples:
- InputData/input5.txt: Empty sudoku
- InputData/input7.txt: Hardest sudoku in the world