Solves KenKen puzzles, by representing it as a Constraint Satisfaction Problem (CSP)
-
Updated
Mar 25, 2019 - Python
Solves KenKen puzzles, by representing it as a Constraint Satisfaction Problem (CSP)
Sudoku CSP Solver using Backtracking Search and Arc-Consistency 3
CSCI-561 AI Assignments.
Dynamic CSP solver.
an artificial intelligence project to solve the N-queen constraint satisfaction problem
Artificial Intelligence Projects
A KenKen python solver that represents the game as a Constraint Satisfaction Problem (CSP) and can use several algorithms for its solution.
Sudoku Solver in Python using Backtracking, AC3 inferences..
This is an implementation of Arc Consistency Algorithm to solve a 6x6 Sudoku grid.
This was a university AI project where I had to implement different constraint satisfaction problem methods and use them to solve sudoku puzzles
A comparative study of different algorithms like depth-first-search with backtracking and AC3, genetic algorithm and dancing links algorithm to solve sudoku problem
Artificial Intelligence: Constraint Satisfaction Problems
Computer vision university labs (Kyiv Polytechnik Institute)
Machine Learning Sudoku Solver that implmements various machine learning heauristics to solve 3x3, 4x4, and 5x5 sudoku puzzles
Solving Sudoku using Backtracking with Inferences - AC3, Naked Pairs and Hidden Pairs
Add a description, image, and links to the arc-consistency topic page so that developers can more easily learn about it.
To associate your repository with the arc-consistency topic, visit your repo's landing page and select "manage topics."