Comparing BFS, DFS, Dijkstra's Algorithm and A* Across Maze Sizes and Obstacle Densities

This independent Computer Science research project compares Breadth-First Search, Depth-First Search, Dijkstra’s algorithm and A* across 180 randomly generated, solvable grid mazes. The algorithms were tested on mazes of different sizes and obstacle densities and evaluated using execution time, nodes expanded, path length and maximum frontier size. The results show that A* provided the strongest overall balance between execution speed and shortest-path accuracy under the tested conditions.