AI kakuro solver

AUT Principles and Applications of Artificial Intelligence course (Fall 2020) projects

Solve Sudoku with Python using the CSF approach

A Kenken puzzle generator & solver

Artificial intelligence course projects

second project at AUT Artificial Intelligence course (Fall 2020)

CSP-Sudoku solver

This project is a sudoku-solver implement by Constraint satisfaction problem. We add the colour option to our sudoku problem as if the number of a place is bigger than other neighbours, the colour of that place must be higher in a given colour's priority. We use the Constraint satisfaction problem(CSP), as we said before, in additional apply deg…

Using CSP heuristics

A futoshiki solver tool using backtracking with some pruning methods.

sudoku resolving using AI algorithms

This repository is projects of Artificial Intelligence course

A solution to a binary puzzle using CSP algorithms.

solving sudoku problems with csp

Implementing CSP with Forward Checking constraint propagation on the example of solving Binary and Futoshiki puzzle

Solving the sudoku as a CSP and heuristics like MRV and AC3

Solving Class Scheduling problem using the CSP method.

AI for the game Numbrix and Hidato by means of modelling it as a constraint-satisfication problem using BT, FC, GAC with MRV heuristic.

Solve Sudoku as a Constraint Satisfaction Problem

This is a practice for AI Search Algorithm. Grocery Bagging is a Constraint Satisfaction Problem (CSP). I used Backtracking search algorithm (Depth-First-Search) along with arc-consistency, Most Restrictive Value (MRV) and Least Constraining Value (LCV) heuristics for prioritizing and pruning to solve the problem as efficiently as possible.