This is a maze game where players must try to escape by navigating their way from the top-left of the maze to the bottom-right.

Each maze is different. You can render mazes of all different sizes.

Once the player reaches the end, the maze will display the shortest path using depth-first search.

At any point during the game, the player is able to press the ‘B’ key to render the the shortest path using breadth-first search, or they can press the ‘D’ key to render the shortest path using depth-first search.

The player can also press the ‘R’ key to generate a new, random maze at any point during gameplay.

Kruskal’s Algorithm was used to ensure that there is always a path to the end, and that there were no “boxes” within the maze walls.

This project was developed using Java and Eclipse IDE

This game was developed as part of a course, Fundamentals of Computer Science II, at Northeastern University