A Comprehensive Investigation of Algorithms for Solving Mazes
Mathematical Modeling and Algorithm Application · 15.03.2026 · 9 (1) · 223-229
DOI: 10.54097/czq2ah04 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Modeling and Algorithm Application, online erschienen am 15.03.2026. Verfasst von Tao Zhu. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
The maze problem is a classic research topic in artificial intelligence, algorithm design, and path planning. Its core lies in exploring how to find an efficient path from the starting point to the target location within a maze, possessing both theoretical research value and practical application significance. This article provides a comprehensive review of multiple maze-solving algorithms. These include wall-following algorithm, backtracking algorithm, M-DFS, A* algorithm, as well as Maze-solving robot and computer mouse. This paper first provides detailed explanations of the principles for each method. Subsequently, this paper uses tables to clearly compare the Application Scenarios, Time and Space Complexity, and Disadvantages of each approach. Furthermore, this paper analyzes the shortcomings of each method and discuss the future development prospects of maze-solving techniques in light of current technological advancements. Overall, this paper offers readers in-depth explanations of several algorithms, enabling them to better understand the current state of the maze field and its future outlook.
Zitieren
APA
Zhu, T. (2026). A Comprehensive Investigation of Algorithms for Solving Mazes. Mathematical Modeling and Algorithm Application, 9(1), 223-229. https://doi.org/10.54097/czq2ah04
Vancouver
Zhu T. A Comprehensive Investigation of Algorithms for Solving Mazes. Mathematical Modeling and Algorithm Application. 2026;9(1):223-229. doi:10.54097/czq2ah04
BibTeX
@article{Zhu2026,
author = {Zhu, Tao},
title = {A Comprehensive Investigation of Algorithms for Solving Mazes},
journal = {Mathematical Modeling and Algorithm Application},
year = {2026},
volume = {9},
number = {1},
pages = {223--229},
doi = {10.54097/czq2ah04}
}
EUVIMED