  We consider a probabilistic version of the depth-first search on mazes with
two exits, and show that this algorithm has equal probability of finding either
exit. The proof is combinatorial and uses an explicit involution.
