Case study, Algorithms · C++
A graph-based adventure game in C++: DFS generates the maze, BFS finds the shortest path.
Context
Graph algorithms are easy to memorise and hard to feel. Maze Explorer turns DFS and BFS into something you can watch and play.
My role: Data Structures & Algorithms project, Air University Kamra.
Implementation
Depth-first search carves a new maze every run.
Breadth-first search finds the shortest path through it.
Real-time rendering and a leaderboard turn the algorithms into play.
Evidence
The points below summarize the public repository and owner-provided CV where noted. Read the source for implementation details before drawing further conclusions.
Generation and solving in one game.
Boundaries