A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#

Implementation of BFS, DFS, Uniform cost search, greedy search, A* search for path finding in maze, Implementation of Water Jug problem with jugs having capacity m and n, resp.

Sudoku Solver is a full-stack, browser-based assistant that lets anyone load or craft a Sudoku puzzle and watch it crack the grid in real time. Built with React + TypeScript on the front end and a custom CSP engine (AC-3 ✕ MRV ✕ Backtracking) on the back, it blends modern UI/UX with classic AI search techniques

[CMPT 310: Artificial Intelligence Survey] N-Queens Problem, CSP problem, Minisat, Min-Conflicts, Hill-Climbing Search, Backtracking Search

A Python CSP solver that seats guests around a circular table using backtracking search with MRV, Degree, and forward-checking heuristics. Includes two versions — a base solver and a search-node benchmarking experiment comparing constraint effects — plus matplotlib visualizations of the final arrangement

this is a csp satisfaction based project. user designs a map with walls , an exit door , sensors and thieves. Sensors contribute with each other to catch the thieves which are in their sights. Thieves find their way to exit using BFS approach. Also thieves may freeze after being seen a few times.

kakuro as csp problem