| Abstrakt: |
Due to the widespread application of "mazes" in games and information encryption in recent years, it is necessary to create a maze generator in conjunction with the unique security advantages of Objective Caml language. To address the trade-off between generation efficiency and maze quality, this study used the Aldous Broder algorithm and Recursive Backtracking algorithm. The Aldous Broder algorithm is a maze generation algorithm based on random walks, which has fast generation speed and good maze quality. The Recursive Backtracking algorithm is an algorithm based on backtracking, which improves generation efficiency by recursively constructing mazes. This paper evaluated the performance and effectiveness of the Aldous Broder algorithm and the Recursive Backtracking algorithm through experiments. The experimental results showed that the Aldous Broder algorithm generated mazes with higher quality, but the Recursive Backtracking algorithm had an advantage in generation speed. In addition, it could be found that the parameters of the two algorithms had a significant impact on generation efficiency and maze quality. Based on the experimental results, it can be believed that both the Aldous Broder algorithm and the Recursive Backtracking algorithm are promising maze generation algorithms. The Aldous Broder algorithm is suitable for application scenarios that require high-quality mazes, while the Recursive Backtracking algorithm is suitable for application scenarios that require fast generation of mazes. Future research directions can further explore how to optimize the performance and effectiveness of these two algorithms, as well as how to apply them to other fields. [ABSTRACT FROM AUTHOR] |
