A stochastic algorithm for solving mazes
में बचाया:
लेखकों: | , , , , , |
---|---|
स्वरूप: | artículo original |
स्थिति: | Versión publicada |
प्रकाशन तिथि: | 2019 |
विवरण: | 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). |
देश: | Portal de Revistas UCR |
संस्थान: | Universidad de Costa Rica |
Repositorio: | Portal de Revistas UCR |
भाषा: | Español |
OAI Identifier: | oai:portal.ucr.ac.cr:article/38322 |
ऑनलाइन पहुंच: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/38322 |
Access Level: | acceso abierto |
संकेत शब्द: | combinatorial optimization square mazes randomized algorithms trees and graphs optimización combinatoria laberintos cuadrados algoritmos aleatorizados árboles y gráficas |