Algorithm for the generation of 2D multi-connected mazes.

In this paper we analyze the algorithms for the construction of Multiple Connection Mazes (MCL). These algorithms construct parts of the maze with inaccessible areas causing waste of space inside the body in the maze. Based on the inaccessibility, the result of the Single Connection Labyrinth (SCL) construction algorithms is exploited to create a new algorithm. The proposed algorithm is called "LCM-Masks", which mainly consists of looking for a series of "masks" or "patterns" in the matrix representation of a maze. With this algorithm, the following are generated: Labyrinths of Multiple Connection (LCM) and Labyrinths of Mixed Multiple Connection (LCM Mixed). The results obtained depend on the number of masks applied, and these immediately modify the matrix representation of the maze, in addition, the handling of matrices facilitates the construction process.