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 |