Finding a path through a dungeon

Turn a maze into a graph, find an exit and compare DFS, BFS and A* across eight dungeons.

My contribution

Working with Célian Gloro, I mainly handled Graph, Node, dungeon-to-graph conversion, solver structure and path reconstruction. We developed A* and analysed the results together.

A pathfinding engine and eight comparison cases. The project highlights the difference between path length and the number of processed vertices.