Solves KenKen puzzles, by representing it as a Constraint Satisfaction Problem (CSP)

Sudoku Solver by constraint satisfaction problem (CSP) using heuristics - Minimum Remaining Value (MRV), Least Common Value (LCV), Maintainin Arc Consistency (MAC). Secondly, by converting to Satisfiability Problem (SAT) and using a sat solver (miniSAT).

Implementation of CSP heuristics and backtracking algorithm for magnet puzzle in Rust.

A KenKen python solver that represents the game as a Constraint Satisfaction Problem (CSP) and can use several algorithms for its solution.

🗓️ Fundamentals of AI, 4th and 5th laboratory. Schedule making app (using 🧬 genetic, minimum remaining values, power heuristics, least constraining values and forward-checking algorithms).

A CSP approach to solve magnet puzzle problem

This was a university AI project where I had to implement different constraint satisfaction problem methods and use them to solve sudoku puzzles

Machine Learning Sudoku Solver that implmements various machine learning heauristics to solve 3x3, 4x4, and 5x5 sudoku puzzles