Solve Sudoku as a Constraint Satisfaction Problem
-
Updated
Aug 10, 2022 - Python
Solve Sudoku as a Constraint Satisfaction Problem
Simulador do Algoritmo de Tomasulo
A C# project to solve sudoku with CSP architecture using AC3, MRV, Degree heuristics and LCV.
Random small projects, related to ML/AI/DL/NLP/RL or trying out to implement any general algorithm myself
Takes an unsolved Sudoku Grid as input, given as a continuous string of 81 characters. Program prints out the final output as a 9x9 grid and uses Constraint Propagation (AC3 Algorithm) and Backtracking Search. In AC3, it checks arc consistency and enforces it by removing values from the domain of unassigned variables.
Implementation of CSP heuristics and various algorithms for solving magnet puzzle
An AI for solving Sudoku. 🤖 ⚡️
Implementation of CSP heuristics and backtracking algorithm for magnet puzzle in Rust.
kakuro (simple version) solver as CSP problem - Artificial Intelligence course project - Spring 2021
A CSP approach to solve magnet puzzle problem
Using CSP heuristics
Solving Sudoku using constraint satisfaction - AC3, and MRV & FirstAvailable Algorithms for variable selection
Add a description, image, and links to the ac3 topic page so that developers can more easily learn about it.
To associate your repository with the ac3 topic, visit your repo's landing page and select "manage topics."