Language: Java
IDE: Eclipse

Sudoku Solver approaches and solves Sudoku as a Constraint Satisfaction Problem. It uses various heuristics including Backtracking with Forward Checking and Minimum Remaining Value (MRV), Arc Consistency (AC), and Arc Consistency Pre-Processing (ACP).

Through various benchmarks, the application of Backtracking, MRV and ACP was determined to most frequently be the most efficient. These tests, results, and a write up on the Sudoku Solver can be found here.