An intelligent, conflict-free school timetable generator & interactive scheduling platform.
Implementation of CSP heuristics and backtracking algorithm for magnet puzzle in Rust.
🗓️ Fundamentals of AI, 4th and 5th laboratory. Schedule making app (using 🧬 genetic, minimum remaining values, power heuristics, least constraining values and forward-checking algorithms).
This was a university AI project where I had to implement different constraint satisfaction problem methods and use them to solve sudoku puzzles
Solving Sudoku puzzle with CSP
A CSP approach to solve magnet puzzle problem
Machine Learning Sudoku Solver that implmements various machine learning heauristics to solve 3x3, 4x4, and 5x5 sudoku puzzles
A command-line sudoku solver implemented in Java that uses constraint satisfaction techniques to solve puzzles of varying difficulty. It supports input via configuration files or direct command-line arguments, and can apply optimizations like Minimum Remaining Values (MRV) and Least Constraining Values (LCV) to improve performance.
To associate your repository with the least-constraining-value topic, visit your repo's landing page and select "manage topics."