Maze Solving Using Breadth-First Search in OCaml
ITM Web of Conferences · 2026 · 93 · 02016
DOI: 10.1051/itmconf/20269302016 ↗Kurz gefasst
Fachartikel in der Zeitschrift ITM Web of Conferences, online erschienen am 13.11.2026. Verfasst von Ailun Zheng. Die Arbeit nennt 10 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Solving mazes is a standard problem having many uses— among them robotics, navigation, artificial intelligence, and game design. For this project, the Breadth - FirstSearch (BFS) method was applied in OCaml to handle grid - based mazes. The maze itself was taken as a two - dimensional array with each cell being either solid (wall) or passable (path). To keep track of unvisited locations, a queue was used to guide the search of adjacent cells until some connection between start and goal has been established. Several mazes of different sizes were tested to examine the behavior of the algorithm. In all cases, BFS was able to find a valid solution and produced the shortest path whenever one existed. The experiments also showed that larger mazes required more explored cells and longer execution times, which matched the expected behavior of BFS. Although additional memory was needed to store nodes waiting to be explored, the algorithm remained reliable across all test cases. The project provided practical experience in implementing graph-search techniques in OCaml and demonstrated the suitability of BFS for solving grid-based maze problems.
Zitieren
APA
Zheng, A. (2026). Maze Solving Using Breadth-First Search in OCaml. ITM Web of Conferences, 93, 02016. https://doi.org/10.1051/itmconf/20269302016
Vancouver
Zheng A. Maze Solving Using Breadth-First Search in OCaml. ITM Web of Conferences. 2026;93:02016. doi:10.1051/itmconf/20269302016
BibTeX
@article{Zheng2026,
author = {Zheng, Ailun},
title = {Maze Solving Using Breadth-First Search in OCaml},
journal = {ITM Web of Conferences},
year = {2026},
volume = {93},
pages = {02016},
doi = {10.1051/itmconf/20269302016}
}
EUVIMED