BFS vs DFS Ant Maze

Two ants race to solve a maze(if possible). The paths that are ultimately decided on are drawn in two different colors (overlap in a mix color).
Each ants paths can be turned off by calling a method to hidePaths.
This simulation demonstrates that while a depth first search for a maze solution is found quicker (typically), the breath first search finds the optimal (shortest) paths.
The classes include nested Lists, Nodes, and Queues or Stacks that are hand made to demonstrate the data structures

2161 views / 25 in the last 7 days

Tags: simulation with-source stack queue algorithms depthfirstsearch breathfirstsearch lists

Visit the web page for this scenario.