GitHub topics: minimum-remaining-values
chanioxaris/kenken-solver
Solves KenKen puzzles, by representing it as a Constraint Satisfaction Problem (CSP)
Language: Python - Size: 139 KB - Last synced at: about 1 month ago - Pushed at: about 6 years ago - Stars: 20 - Forks: 2
TelevisionNinja/Sudoku-Solver
This was a university AI project where I had to implement different constraint satisfaction problem methods and use them to solve sudoku puzzles
Language: Python - Size: 36.1 KB - Last synced at: about 2 months ago - Pushed at: over 1 year ago - Stars: 0 - Forks: 1
adityagupta1089/Sudoku-Solver-by-CSP-and-Minisat
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).
Language: Java - Size: 1000 KB - Last synced at: over 1 year ago - Pushed at: almost 8 years ago - Stars: 2 - Forks: 0
dinhjohnny/Sudoku-AI-Project
Machine Learning Sudoku Solver that implmements various machine learning heauristics to solve 3x3, 4x4, and 5x5 sudoku puzzles
Language: Python - Size: 27.3 KB - Last synced at: almost 2 years ago - Pushed at: about 3 years ago - Stars: 0 - Forks: 0
arashsm79/ravenous-polarity
Implementation of CSP heuristics and backtracking algorithm for magnet puzzle in Rust.
Language: Rust - Size: 39.1 KB - Last synced at: over 1 year ago - Pushed at: almost 3 years ago - Stars: 1 - Forks: 0
JohnPapad/KenKen-Solver
A KenKen python solver that represents the game as a Constraint Satisfaction Problem (CSP) and can use several algorithms for its solution.
Language: Python - Size: 93.8 KB - Last synced at: about 2 years ago - Pushed at: almost 5 years ago - Stars: 1 - Forks: 0
