I was watching some lectures in Algorithms, Part II(Princeton University) and they had some cool animations of using
depth-first search to navigate a maze. I don't recall ever actually implementing a depth-first search so I thought I'd do it.
The first searcher I wrote, Theseus, picks randomly from among adjacent locations when given a choice. This can be frustrating to watch, so I wrote a
second searcher, Greedy, that orders adjacent locations by their distance from the destination.

Maze Dimension:
Theseus: Greedy:

On Theseus' path On Greedy's path On both paths
Visited by Theseus Visited by Greedy Visited by both
Large mazes may kill your browser.