This repository hosts a Rust rendition of Peter Norvig's Sudoku solver, implemented using a DFS search and constraint propagation to reduce the search space.
Feed to stdin text input defining one Sudoku per line. For each Sudoku, [1..9] represents a filled in cell, and [.0] an empty cell. Any other characters are ignored. For example:
cat data/top95.txt | cargo run
cat data/hardest.txt | cargo run