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:archivo.portal.ucr.ac.cr:article/38322 |
| オンライン･アクセス: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/38322 |
| キーワード: | combinatorial optimization square mazes randomized algorithms trees and graphs optimización combinatoria laberintos cuadrados algoritmos aleatorizados árboles y gráficas |