Sudoku Solver in Functional Languages
solver.rktA naive searching and backtracking implementation.
solver-opt.rktAn optimized searching and backtacking implementation, which will move to the unknown box that has the minimum number of possible choices.
ambnon-deterministic operator to do searching and backtracking.
solver-opt.rkt, but using a list (as a queue) to save all decision nodes when searching, thus can find all solutions of the puzzle.