改进的并查集迷宫地图生成算法研究与设计

Research and Design of Improved Maze Map Generation Algorithm Based on Union-Find Sets

迷宫地图生成是各类2D/3D游戏设计中经常需要实现的功能之一,在深入研究并查集理论的基础上,设计并实现了一个迷宫地图自动生成算法。采用按秩合并和路径压缩的方式对算法进行了优化,通过判断起点是否连通终点和是否遍历到每一个迷宫单元格两种方式来确定迷宫生成的终止条件,从而可以根据需要生成不同类型的迷宫。经测试可知,算法的执行效率较高,可以部署和应用于各类2D/3D游戏的设计开发。

In various 2D/3D game designs,maze map generation is one of the functions that often need to be implemented.After in-depth study of Union-Find Sets theory,this paper designs and implements an automatic generation algorithm of maze map,and it is optimized by rank merging and path compression.The termination condition of the maze generation is to determine whether the starting point is connected to the ending point,or whether it is traversed to each maze cell,so that different types of mazes can be generated as needed.The algorithm has high execution efficiency,it can be deployed and applied in the design and development of various 2D/3D games.