An open-source Java library for Constraint Programming

Constraint Solver ACE

An optaplanner planning problem related to satellites and tasks to assign to visibilities zones linked to that satellites. Used Quarkus and Constraint Streams.

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

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

Solve time table scheduling using `Constraint Satisfaction Problem`

Using CSP algorithm with Forward Checking for solving Sudoku Puzzle

Car-Sequencing Problem solved with Constraint Programming approach

Employee Scheduling Optimization Project with AWS CDK

simple Java implementation of nonogram solver based on constraint satisfaction programming using several heuristics

Opus Magnum's Sigmar's Garden Autosolver, using OpenCV Template Matching

EasyCSP is an open-source Java library for Constraint Satisfaction Programming. Supports CSPs, CSOPs, discrete object domains, int interval domains, int constraint binarization. Examples include NQueens, Sudoku. (Builds on Sourceforge)

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 programming style. Features Sudoku as an example application.

Degree Final Year project. An example of how recursion with back tracking can be implemented using Java to solve a Constraint Satisfaction Problem

CSE 318 Artificial Intelligence Sessional (L3/T2)

Sudoku Solver by constraint satisfaction problem (CSP) using heuristics - Minimum Remaining Value (MRV), Least Common Value (LCV), Maintainin Arc Consistency (MAC). Secondly, by converting to Satisfiability Problem (SAT) and using a sat solver (miniSAT).

Examination Timetabling using CSP Solver

Solving algorithms on N queens problem

Implementation in Java8&Python based on pseudocode of book Artificial Intelligence: A Modern Approach.