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 |