Skip to content

Latest commit

 

History

History
21 lines (12 loc) · 793 Bytes

README.md

File metadata and controls

21 lines (12 loc) · 793 Bytes

ConstraintSolver

Implementation of Constraint Solvers in Java

This repo contains an implementation of the Forward Checking and MAC3 algorithms for solving binary constraint problems.

The code is tested on problem instances of NQueens and Langford's Number Problem

It also includes a visualisation class to visualise the results of the solutions to the problems.

Some example solutions are shown below:

Solution to 20-Queens problem: Twenty Queens{height=400px width=500px}

Solution to Langford's 2-3 problem: Langford's 2-3{height=400px width=500px}