1. Introduction

For this assignment, I conceptually break down a Complex Constraint Satisfaction Problem [hereafter: CSP] with 3 levels of difficulties that I formulated and solved using AI techniques - a Quasigroup Existence Problem. I also provide a detailed understanding of the problem, which includes an explanation of the algorithms, steps, data structures and tests I used to execute the problem in Python.

This repository is divided into the following sections:

1. Constraint Satisfaction Problem Formulation
   • Quasigroup Existence Problem
   • Levels of complexity
2. Intuition of the Algorithms' Operation
   • Overview
   • Pseudocodes
     • Backtracking
     • Forward Checking
     • Look Ahead
   • Steps
3. Python Programs
   • QG1.py
     • Code Breakdown
   • QG2.py
     • Code Breakdown
   • QG3.py
     • Code Breakdown
4. Performance Comparison
5. Tests' results and analyses
6. Sources and Further Reading

Submission date: 2nd September 2023

Grade: Not graded yet.