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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。