For the final project of my "Object-Oriented Programming and Data Structures" course, my partner and I worked on
optimizing the path that an explorer takes to traverse a maze. Given a limited number of steps, the explorer has to take as few steps as
possible to find an orb in the maze, revealing where the gold is. Once the gold is revealed, the explorer has to collect as much gold as
possible and exit the maze before his step limit runs out. The video on the right shows a non-optimized path vs. our optimized solution.
For our solution, we used a combination of recursion, looping, calculation of steps, and mapping of the maze. We coded our program using Java
through Eclipse.