Exploring mazes at random
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:RTKDPCUUrecord.jsonopen to challenge →
classification
math.CO
keywords
mazesalgorithmcombinatorialconsiderdepth-firsteitherequalexit
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.