Java Sudoku solver using AC3, Forward checking and Backtracking algorithms

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

Using CSP algorithm with Forward Checking for solving Sudoku Puzzle

Implementation of Constraint Solvers in Java

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

Project focuses on optimised implementation of Backtracking and Forward Checking algorithms in order to find all solutions of the N Queens problem

A futoshiki solver tool using backtracking with some pruning methods.

kakuro (simple version) solver as CSP problem - Artificial Intelligence course project - Spring 2021

sudoku resolving using AI algorithms

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)

cpnets

takes a starting takes a point in a directed graph and shows the nodes that are reachable within two steps

A CSP approach to solve magnet puzzle problem

This is a homework about Formulating a game called "Magnet Puzzle" into CSP, then using Backtracking, Forward Checking to solve it. Various heuristics such as MRV, LCV, Arc consistency (AC3) is used to improve the searching performance. This homework is a part of many projects in a Fundamentals to AI course @ FUM.

Simple Strategy Game Solution with Backtracking, Forward Checking, MRV and Value First heuristics

A program to solve Sudoku with Backtracking.

A puzzle consisting of a grid of squares and blanks into which words are to be filled vertically and horizontally. In the crossword puzzle, we have a grid with blocked and unblocked cells and a dictionary of words. We want to assign a letter to each unblocked cell so that each vertical or horizontal contiguous segment of unblocked cells forms a …

Contains all the assignments of the course CSE-318 offered in CSE, BUET