A stochastic algorithm for solving mazes
Guardado en:
| Autores: | , , , , , |
|---|---|
| Formato: | artículo original |
| Estado: | Versión publicada |
| Fecha de Publicación: | 2019 |
| Descripción: | 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). |
| País: | Portal de Revistas UCR |
| Institución: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Lenguaje: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/38322 |
| Acceso en línea: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/38322 |
| Access Level: | acceso abierto |
| Palabra clave: | combinatorial optimization square mazes randomized algorithms trees and graphs optimización combinatoria laberintos cuadrados algoritmos aleatorizados árboles y gráficas |