There are 0 repository under arc-consistency topic.
Solves KenKen puzzles, by representing it as a Constraint Satisfaction Problem (CSP)
Example lecture for Constraint Satisfaction Problems in an interactive jupyter notebook. With python code to solve CSPs, with visualization of Sudoku and NQueens problems.
Sudoku CSP Solver using Backtracking Search and Arc-Consistency 3
simple Java implementation of nonogram solver based on constraint satisfaction programming using several heuristics
CSCI-561 AI Assignments.
This is an Android project that let the user to take a photo to a Sudoku grid and it solves it automatically.
CSP with all arc-consistency algorithms
Solving a custom-sized Sudoku puzzle using Backtracking (combined with optional MRV) and Genetic algorithms.
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.
an artificial intelligence project to solve the N-queen constraint satisfaction problem
Artificial Intelligence Projects
Sudoku Solver in Python using Backtracking, AC3 inferences..
Assignments given during the course Informed Search Methods in AI in Reykjavik University, during the Double Degree study period.
Machine Learning Sudoku Solver that implmements various machine learning heauristics to solve 3x3, 4x4, and 5x5 sudoku puzzles
A puzzle consisting of a grid of squares and blanks into which words are to be filled vertically and horizontally. In the crossword puzzle, we have a grid with blocked and unblocked cells and a dictionary of words. We want to assign a letter to each unblocked cell so that each vertical or horizontal contiguous segment of unblocked cells forms a word that appears in the dictionary.
Computer vision university labs (Kyiv Polytechnik Institute)
Solving Sudoku using Backtracking with Inferences - AC3, Naked Pairs and Hidden Pairs
This is an implementation of Arc Consistency Algorithm to solve a 6x6 Sudoku grid.
Artificial Intelligence: Constraint Satisfaction Problems
A comparative study of different algorithms like depth-first-search with backtracking and AC3, genetic algorithm and dancing links algorithm to solve sudoku problem
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