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.

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.

CSP with all arc-consistency algorithms

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.

an artificial intelligence project to solve the N-queen constraint satisfaction problem

Artificial Intelligence Projects

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.

Solving a custom-sized Sudoku puzzle using Backtracking (combined with optional MRV) and Genetic algorithms.

Sudoku Solver in Python using Backtracking, AC3 inferences..

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 …

This is an implementation of Arc Consistency Algorithm to solve a 6x6 Sudoku grid.