Arcade - Combinatorial optimization

Arcade is a University Project for practicing combinatorial optimization. We'll find solutions for two problems: A Labyrinth and a Letter Soup.

Features

• Two problems to solve, Labyrinth & Letter Soup (with Graphical Interface)
• Solve them with Backtracking, Branch & Bound or using a Greedy approach
• Compare performance of the algorithms

How To Use

# Clone this repository
$ git clone https://github.com/bielcarpi/CombinatorialOptimization.git

# Open the project on IntelliJ and Run it (tested with Java 17)
# On the main() there is a detailed explanation of how the program works, and what
#  attributes can be modified so as to modify its execution.

Authors

Biel Carpi (biel.carpi@outlook.com)