Exploring mazes at random
| Title: | Exploring mazes at random |
|---|---|
| Authors: | Gladkov, Nikita, Pak, Igor |
| Publication Year: | 2024 |
| Collection: | Mathematics |
| Subject Terms: | Mathematics - Combinatorics, 00A08, 05C81, 05C85 |
| More Details: | 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. Comment: This paper is intended for a general audience. 5 pages, 10 figures |
| Document Type: | Working Paper |
| Access URL: | http://arxiv.org/abs/2408.00978 |
| Accession Number: | edsarx.2408.00978 |
| Database: | arXiv |
Be the first to leave a comment!