<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1409-2433</journal-id>
<journal-title><![CDATA[Revista de Matemática Teoría y Aplicaciones]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Mat]]></abbrev-journal-title>
<issn>1409-2433</issn>
<publisher>
<publisher-name><![CDATA[Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1409-24332019000200319</article-id>
<article-id pub-id-type="doi">10.15517/rmta.v26i2.38322</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Un algoritmo estocástico para resolver laberintos]]></article-title>
<article-title xml:lang="en"><![CDATA[A stochastic algorithm for solving mazes]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cruz-Ruiz]]></surname>
<given-names><![CDATA[Iván Omar]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lara-Velázquez]]></surname>
<given-names><![CDATA[Pedro]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gutiérrez-Andrade]]></surname>
<given-names><![CDATA[Miguel A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[De-los-Cobos-Silva]]></surname>
<given-names><![CDATA[Sergio G.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[Eric A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[Román A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Iztapalapa  Departamento de Ingeniería Eléctrica]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Iztapalapa  Departamento de Ingeniería Eléctrica]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Iztapalapa  Departamento de Ingeniería Eléctrica]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Iztapalapa  Departamento de Ingeniería Eléctrica]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af5">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Iztapalapa  Departamento de Ingeniería Eléctrica]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af6">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Azcapotzalco  Departamento de Sistemas]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2019</year>
</pub-date>
<volume>26</volume>
<numero>2</numero>
<fpage>319</fpage>
<lpage>337</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_arttext&amp;pid=S1409-24332019000200319&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_abstract&amp;pid=S1409-24332019000200319&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_pdf&amp;pid=S1409-24332019000200319&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen El artículo describe un nuevo método para resolver laberintos cuadrados usando una versión aleatorizada de búsqueda a profundidad. El algoritmo propuesto se probó en dos familias de laberintos, una de ellas basada en el método de Aldous-Broder y la otra en el de Backtrack. El algoritmo de solución se compara con el método de Dijkstra, que es una técnica bien conocida para resolver este tipo de problemas. Este encuentra soluciones en menor tiempo en laberintos de gran tamaño(mayores a100x100 celdas).]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract 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).]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[optimización combinatoria]]></kwd>
<kwd lng="es"><![CDATA[laberintos cuadrados]]></kwd>
<kwd lng="es"><![CDATA[algoritmos aleatorizados]]></kwd>
<kwd lng="es"><![CDATA[árboles y gráficas.]]></kwd>
<kwd lng="en"><![CDATA[combinatorial optimization]]></kwd>
<kwd lng="en"><![CDATA[square mazes]]></kwd>
<kwd lng="en"><![CDATA[randomized algorithms]]></kwd>
<kwd lng="en"><![CDATA[trees and graphs.]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[D]]></surname>
<given-names><![CDATA[Ashlock]]></given-names>
</name>
<name>
<surname><![CDATA[C]]></surname>
<given-names><![CDATA[Lee]]></given-names>
</name>
<name>
<surname><![CDATA[C]]></surname>
<given-names><![CDATA[McGuinness]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Search-based procedural generation of maze-like levels]]></article-title>
<source><![CDATA[IEEE Transactions on Computational Intelligence and Al in Games]]></source>
<year>2011</year>
<volume>3</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>260-73</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[J]]></surname>
<given-names><![CDATA[Buck]]></given-names>
</name>
</person-group>
<source><![CDATA[Mazes for Programmers: Code Your Own Twisty Little Passages]]></source>
<year>2015</year>
<publisher-loc><![CDATA[Texas ]]></publisher-loc>
<publisher-name><![CDATA[The Pragmatic Bookshelf]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[D,C]]></surname>
<given-names><![CDATA[Dracopoulos]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Robot path planning for maze navigation]]></article-title>
<source><![CDATA[1998 IEEE International Joint Conference on Neural Networks Proceedings]]></source>
<year>1998</year>
<volume>3</volume>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[S]]></surname>
<given-names><![CDATA[Fraenkel]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Economic traversal of labyrinths]]></article-title>
<source><![CDATA[Mathematics Magazine]]></source>
<year>1970</year>
<volume>43</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>125-30</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[K]]></surname>
<given-names><![CDATA[Hamada]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A picturesque maze generation algorithm with any given endpoints, Journal of Information Processing]]></article-title>
<source><![CDATA[Journal of Information Processing]]></source>
<year>2013</year>
<volume>21</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>393-7</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[G,E]]></surname>
<given-names><![CDATA[Jan]]></given-names>
</name>
<name>
<surname><![CDATA[K-Y]]></surname>
<given-names><![CDATA[Chang]]></given-names>
</name>
<name>
<surname><![CDATA[I]]></surname>
<given-names><![CDATA[Parberry]]></given-names>
</name>
</person-group>
<source><![CDATA[A new maze routing approach for path planning of a mobile robot]]></source>
<year>2003</year>
<conf-name><![CDATA[ EEE/ASME International Conference on Advanced Intelligent Mechatronics, 2]]></conf-name>
<conf-loc>Japan </conf-loc>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[M,T]]></surname>
<given-names><![CDATA[Jones]]></given-names>
</name>
</person-group>
<source><![CDATA[Artificial Intelligence: A Systems Approach]]></source>
<year>2008</year>
<publisher-loc><![CDATA[USA ]]></publisher-loc>
<publisher-name><![CDATA[Infinity Science Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[W,H]]></surname>
<given-names><![CDATA[Matthews]]></given-names>
</name>
</person-group>
<source><![CDATA[Mazes and Labyrinths: Their History and Development]]></source>
<year>1970</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Dover Publications]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[V,T]]></surname>
<given-names><![CDATA[Tomás]]></given-names>
</name>
<name>
<surname><![CDATA[M]]></surname>
<given-names><![CDATA[Pozas]]></given-names>
</name>
<name>
<surname><![CDATA[J]]></surname>
<given-names><![CDATA[Hernández]]></given-names>
</name>
</person-group>
<source><![CDATA[Propuesta para la generación de laberintos ampliados en 2D, Ciencia Huasteca]]></source>
<year>2011</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[UAEH]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
