EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

Performance Verification of BFS For Unweighted Maze Solving: A Comparative Analysis with DFS and A* Via Ocaml Implementation

Hongjia Du

Mathematical Modeling and Algorithm Application · 15.03.2026 · 9 (1) · 230-236

DOI: 10.54097/b1m57229 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical Modeling and Algorithm Application, online erschienen am 15.03.2026. Verfasst von Hongjia Du. Die Arbeit wurde bisher 1-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Maze solving is a key pathfinding problem with applications in robotic navigation and game Artificial Intelligence (AI). This study focuses on verifying Breadth-First Search (BFS)’s advantages in unweighted mazes, comparing it with Depth-First Search (DFS) and the A* algorithm via OCaml implementation. Five typical mazes (simple, complex, enclosed, empty, duplicate) were designed, with performance evaluated using metrics: path length, traversed nodes, solving time, and shortest path guarantee. Results show BFS consistently guarantees the shortest path (unlike DFS, which falls into depth traps) and has stable efficiency—outperforming A* in small/simple mazes by avoiding heuristic calculation overhead. BFS’s simplicity (relying on basic data structures) and strong adaptability across maze types confirm it as the ideal choice for unweighted maze solving. These findings also highlight its educational value as a baseline algorithm for introducing pathfinding concepts. Future work may extend to weighted mazes, heuristic refinements, and hybrid algorithms combining BFS with optimization strategies.

Zitieren

APA

Du, H. (2026). Performance Verification of BFS For Unweighted Maze Solving: A Comparative Analysis with DFS and A* Via Ocaml Implementation. Mathematical Modeling and Algorithm Application, 9(1), 230-236. https://doi.org/10.54097/b1m57229

Vancouver

Du H. Performance Verification of BFS For Unweighted Maze Solving: A Comparative Analysis with DFS and A* Via Ocaml Implementation. Mathematical Modeling and Algorithm Application. 2026;9(1):230-236. doi:10.54097/b1m57229

BibTeX
@article{Du2026,
  author = {Du, Hongjia},
  title = {Performance Verification of BFS For Unweighted Maze Solving: A Comparative Analysis with DFS and A* Via Ocaml Implementation},
  journal = {Mathematical Modeling and Algorithm Application},
  year = {2026},
  volume = {9},
  number = {1},
  pages = {230--236},
  doi = {10.54097/b1m57229}
}
Kostenlos starten →