Local-search based solver of Constraint Satisfaction and Optimization Problems

Solve time table scheduling using `Constraint Satisfaction Problem`

Tiny framework for solving constraint satisfaction problems (CSP) with discrete and finite domains. This is a Java-based solution which is written in a functional...

This project solves the nurses assignment problem in the emergency department of the university hospital center "Ibn Rochd" in Casablanca. To satisfy all the const...

Constraint satisfaction problems (CSP) are those can be represented using 3 components: Variables, Domains and Constraints. A solution to a CSP is to be obtained w...

A high-level, solver-independent, Java constraint model for constraint satisfaction problems in the integer domain....

An ambulance scheduling and allocation planning paradigm (solving a Constraint Satisfaction Problem)

JCP Standard JSR331 “Java Constraint Programming API”. It is used for Modeling and Solving Constraint Satisfaction and Optimization Problems using Java and off-the...

Sudoku Solver by constraint satisfaction problem (CSP) using heuristics - Minimum Remaining Value (MRV), Least Common Value (LCV), Maintainin Arc Consistency (MAC)...

Solves Problems with Constraints. Examples include Wargame, Sudoku, Crossword

Constraint Satisfaction Engine and demonstrating it on a number of constraint satisfaction problems (CSPs) namely, Australia color Map problem, Job Scheduling, n-Q...

CSP Agent that solves standard CSP problems like map coloring and n-queens

Simplem engine to solving CSP with example Eight queens puzzle

Backtracking and ForwardChecking used to solve N-Hetman Problem and Latin Square Problem

Solving map coloring problem and circuit board problem

Solving optimization problems by addressing the constraints rather than gradient descent. A lower level AI technique which can be used for solving scheduling probl...

Solving CSPs such as the N-queen and the job scheduling problems, using backtracking algorithm.

Solves a CSP like the Map coloring problem or Sudoku by using backtracking, backtracking with forward checking, backtracking with AC-3 with and without degree heur...

The problem is solved when each variable has a value that satisfies all the constraints on the variable. Search algorithms include Backtracking and Min-conflicts...

A simple KenKen solver used to learn more about Constraint Satisfaction Problems (CSP)