Proposal for the Generation of Extended Labyrinths in 2D
Tomás Mariano, Víctor Tomás
2011
Tomás Mariano, V. T.; Pozas Cárdenas, M.; Hernández Camacho, J. (2011). Proposal for the Generation of 2D Extended Labyrinths. Simposio Iberoamericano Multidisciplinario de Ciencias e Ingenieria 2011. Superior School of Huejutla. UAEH. Mexico. ISBN: In process.
Abstract
In the present work an analysis of the most common algorithms for the construction of Labyrinths of Simple Connection (LCS) is made: Prims, Kruscal, Aldous Broder, Recursive Backtracker, and Anderson, these algorithms generate single-track mazes, and their disadvantage is that they allow to have a reduced number of movements. The previous construction algorithms are used to generate extended mazes, these mazes allow greater mobility and directionality when traversing them. The algorithm called "Extended LCSyM" is proposed, whose main feature is the calculation of the number of rows and columns of the new maze, which based on the construction of LCS, a similar one is built with extended corridors, which works for any algorithm of construction of mazes analyzed.
