1 paper
Nikita Gladkov, Igor Pak
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 combi…