Constraint Satisfaction Problem Solver for Golang
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.
A constraint satisfaction problem (CSP) solver for generating and solving crossword puzzles using AI techniques to ensure words fit correctly without conflicts. The solver enforces node and arc consistency and uses backtracking to find valid word placements.
Solving a custom-sized Sudoku puzzle using Backtracking (combined with optional MRV) and Genetic algorithms.
This is an Android project that let the user to take a photo to a Sudoku grid and it solves it automatically.
Dynamic CSP solver.
Artificial Intelligence Projects
Assignments of the Introduction to Artificial Intelligence course - NTNU Erasmus+ 2024
Implementation of CSP heuristics and backtracking algorithm for magnet puzzle in Rust.
an artificial intelligence project to solve the N-queen constraint satisfaction problem
Interactive AI Sudoku Solver visualizing CSP algorithms (Backtracking, AC-3, MRV/LCV) with a reactive 3D robot companion — built with React Three Fiber
A KenKen python solver that represents the game as a Constraint Satisfaction Problem (CSP) and can use several algorithms for its solution.
A high-performance Constraint Satisfaction Problem (CSP) engine built in Python to solve the Radio Link Frequency Assignment Problem (RLFAP).
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."