Inspiration: Data Structures class
What it does: It dynamically tests a maze that a user builds to see if there is a correct path and then executes the path.
How we built it: We built it with dynamic building blocks that come together that form a graph of vertices. From the graph, we used depth-first search to test if there are paths.
Challenges we ran into: We faced countless challenges, especially when it came to creating and implementing a depth-first search on the graph.
Accomplishments that we're proud of: We took something we learned conceptually in class and implemented it into a working application.
What's next for Maze Solver: We will continue to polish it until it is a usable app.