Maze Solver

Simple maze solving algorithm using three different data structures

A program to show how a different data structure affects the performance and series of operations on a maze solver.

This program creates a map (static, non-random), and finds the path to the exit using a Stack, Queue, and Priority Queue (Heap). The resulting search methods are Depth First, Breadth First, and A* (Approx), respectively.

I created this program to practice C++ and work with several different data structures. Both the code and the .exe will be included in the download below.

IMPORTANT: Currently the third method does not work. I got caught up in assignments and haven't fully finished it. I hope to soon. It will be commented out in the code.

Run mazesolver.exe to read the output:


Download the source code here

© Lutz Kellen. All rights reserved.