Sudoku, modeled as a constraint satisfaction problem
This project models Sudoku as a Constraint Satisfaction Problem and compares multiple AI solving strategies, including backtracking, MRV, forward checking, and local search. Each algorithm is visualized step by step, with metrics such as runtime, backtracking count, nodes explored, and constraint checks used to compare performance.
Compare algorithms using runtime, backtracks, nodes explored, and constraint checks to evaluate search efficiency.
Select a difficulty to start. Run an AI solver from the board to watch it think, step by step.