Resumen

CRUZ-RUIZ, Iván Omar et al. A stochastic algorithm for solving mazes. Rev. Mat [online]. 2019, vol.26, n.2, pp.319-337. ISSN 1409-2433.  http://dx.doi.org/10.15517/rmta.v26i2.38322.

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).

Palabras clave : combinatorial optimization; square mazes; randomized algorithms; trees and graphs..

        · resumen en Español     · texto en Español     · Español ( pdf )