Artificial Intelligence Course 3rd Project: Implementing CSP Backtracking, Forward Checking and MAC Algorithms in order to solve a binary puzzle

Solves KenKen puzzles, by representing it as a Constraint Satisfaction Problem (CSP)

🧩Using backtracking algorithm to solve binary puzzles

AI kakuro solver

All AUT's principles and applications of artificial intelligence course projects.

Project to learn and understand backtracking algorithms with the goal to solve a crossword puzzle

Artificial Intelligence Course 3rd Project: Implementing CSP Backtracking, Forward Checking and MAC Algorithms in order to solve a binary puzzle

A solution centered around AI-driven scheduling, designed to optimize staff allocation, enhance patient care, and streamline hospital operations. It integrates advanced scheduling algorithms that prioritize staff preferences, ensure designated days off, and dynamically allocate doctors, nurses, and receptionists based on demand and availability.

Python code to solve Jigsaw Sudoku using backtracking with look forward (Forward Checking) and model dependant ordinal strategies

A Kenken puzzle generator & solver

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…

solving sudoku problems with csp

This repository is projects of Artificial Intelligence course

Simple Sudoko solver written in Python

Implementación de algoritmos de búsqueda con restricciones para resolver crucigramas, aplicando backtracking y forwardchecking. Desafío de IA con niveles de dificultad crecientes y validación de resultados en un proyecto práctico.

The solver finds a solution to the problem given the constraints. No solution may be found if all the constraints are not satisfied.

This code was submitted as programming project two for ITCS 6150 Intelligent Systems under Dr. Dewan Ahmad at the University of North Carolina at Charlotte for the fall 2021 semester. The aim is to solve the constraint satisfaction problem of map coloring for the USA and Australia.

Solve Sudoku as a Constraint Satisfaction Problem