A visual representation of labyrinth solving algorithms using common traversal algorithms such as BFS, DFS, A*. Plus there are some basic artificial intelligence patterns like generational learning.
The project itself also provides real time solving steps implemented on the drawer. The labyrinth consists of a starting and ending Node + treasures scattered across the field (the "AI" has to find them in order to correctly finish the maze).
$ git clone https://github.com/JanezSedeljsak/path-finder.git
$ pip install matplotlib dataclasses
- Run Test.java to run a simple graph solving animation
- Run Core/Solution.java to generate csv structured statistics for labyrinth solutions
- Run Visualization.py to analyse solutions with graphs/tables...
- Java
- Python > 3.7
const AUTHORS = ['Janez Sedeljsak', 'Marko Vrecer']