Prim algorithm for the implementation of random mazes in videogames

• Autores: Santos López, Félix Melchor, Santos De La Cruz, Eulogio
• Formato: artículo
• Fecha de Publicación: 2012
• Institución: Universidad Nacional Mayor de San Marcos
• Repositorio: Revistas - Universidad Nacional Mayor de San Marcos
• Lenguaje: español
• OAI Identifier: oai:ojs.csi.unmsm:article/6375
• Enlace del recurso: https://revistasinvestigacion.unmsm.edu.pe/index.php/idata/article/view/6375
• Nivel de acceso: acceso abierto
• Materia: Prim; Mazes; Game; Graph.; Laberintos; Videojuegos; Grafos.

The Prim's algorithm, extracted from the graph theory, is easily adaptable for generating random mazes in the game development process. This study provides the theoretical framework of the algorithm, its adaptation to generate two-dimensional arrays of values, coding in Java and use of libraries provided by this programming language. It restricts the creation of the arrays to a minimum size of 11x11 to ensure that generates coherent sizes mazes and its application is for generating orthogonal called labyrinths (2D view). Finally, the measurement is made of the performance of the proposed encoding and concludes that in all tests, the average response time is less than a tenth of a second to generate maps of labyrinths.