Exploring mazes at random
Combinatorics
2024-08-07 v2
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.
Keywords
Cite
@article{arxiv.2408.00978,
title = {Exploring mazes at random},
author = {Nikita Gladkov and Igor Pak},
journal= {arXiv preprint arXiv:2408.00978},
year = {2024}
}
Comments
This paper is intended for a general audience. 5 pages, 10 figures