This is a "maze" solver which utilizes the Breadth-First Search algorithm and visualizes it in a 3D setting. This was programmed in Java and visualized in pjava (Processing). This is my first actual project in Java so please excuse any redundancies in my code. Due to time restraints, the maze has no obstacles within it so the path to the solution is fairly predictable.
Breadth-first search is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root and explores all of the neighbor nodes at the present depth before moving on to the nodes at the next depth level. This is represented by the images above. As you can see, the program stops when it reaches the target (blue) and all the visited nodes are marked green.