Exploring mazes at random
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916348149366784 |
|---|---|
| author | Gladkov, Nikita Pak, Igor |
| author_facet | Gladkov, Nikita Pak, Igor |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_00978 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Exploring mazes at random Gladkov, Nikita Pak, Igor Combinatorics 00A08, 05C81, 05C85 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. |
| title | Exploring mazes at random |
| topic | Combinatorics 00A08, 05C81, 05C85 |
| url | https://arxiv.org/abs/2408.00978 |