ignacioct/A-CSPScheduling

Implementation of a CSP Scheduler and A* algorithm to solve schedulings problems and a travelling salesman problem

A* & CSP Scheduling

Implementation of a CSP Scheduler and A* algorithm to solve a travelling salesman problem.

Table of Contents

1. About The Project
   • Built With
2. Documentation
3. License
4. Contact

About The Project

In this small project, a CSP Scheduler and a A* Algorithm are implemented for solving two tasks, one for each problem:

• The scheduler aims to solve a high school subjects scheduling problem.
• The search algorithm is applied on a version of the Travelling Salesman Problem.

All the details about the problems and the implementation is detailed in the report.pdf file, which was used for the University delivery.

Built With

• Python 3 (Compatible with all 3 subversions)

Documentation

The documentation used to build this project is the following

• Constraint Processing, by Nina Decther
• Brilliant's A* article

License

Distributed under the MIT License. See LICENSE for more information.

Contact

Ignacio Talavera Cepeda - LinkedIn Profile - ignaciotalaveracepeda@gmail.com

Luis Rodríguez Rubio - LinkedIn Profile - rodriguez.ru.luis@gmail.com