Foundations of AI - Sudoku as a CSP
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. The goal is to show how heuristics reduce the search space and improve solving efficiency.
Compare algorithms using runtime, backtracks, nodes explored, and constraint checks to evaluate search efficiency.
Select a difficulty level to start. If needed, run an AI solver to view a step by step solution.
Ayush · Salwa · Anjali