A stochastic algorithm for solving mazes
Kaydedildi:
| Yazarlar: | , , , , , |
|---|---|
| Materyal Türü: | artículo original |
| Durum: | Versión publicada |
| Yayın Tarihi: | 2019 |
| Diğer Bilgiler: | In this article a new method to solve square mazes using a randomized depth-first search algorithm is described. The algorithm was tested in two families of labyrinths, one of them based on the Aldous-Broder method and the other on Backtrack. The algorithm was compared against the Dijkstra method, a well-known technique to solve this kind of problems. The new method finds solutions in less time for large-size labyrinths(greater than 100 x 100 cells). |
| Ülke: | Portal de Revistas UCR |
| Kurum: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Dil: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/38322 |
| Online Erişim: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/38322 |
| Anahtar Kelime: | combinatorial optimization square mazes randomized algorithms trees and graphs optimización combinatoria laberintos cuadrados algoritmos aleatorizados árboles y gráficas |