Exploring mazes at random

2024/08/02 by Nikita Gladkov, Gladkov, Nikita, Igor Pak +1
Computer Science · #00A08 #05C81 #05C85 #Combinatorics (math.CO) #Data Mining Algorithms and Applications #FOS: Mathematics #Image Retrieval and Classification Techniques #Machine Learning and Data Classification

paper · pdf · doi:10.48550/arxiv.2408.00978

openalex publication_date 2024/08/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Solvability of Mazes by Blind Robots
• Depth-First Search performance in a random digraph with geometric outdegree distribution
• Probabilistically Faulty Searching on a Half-Line
• The Pendulum Arrangement: Maximizing the Escape Time of Heterogeneous Random Walks
• Thresholds For Detecting An Anomalous Path From Noisy Environments