This applet demonstrates several different search algorithms on randomly-generated mazes:
When generating mazes, the field "cycles" indicates the number of simple cycles to include in the maze. When this number is 0 the mazes are singly-connected (trees).
This applet was created by Nan Jason Dang, Jeffrey Hanke, and Chris Baker, for the class Data Structures (CSE 326), Autumn 2002, at the University of Washington, Seattle.
A tar file of the source code can be downloaded here.