In this program you can draw a maze and set the start point and a goal, the A* algorithm will find the most optimal path between them.

The A* algorithm finds a path from the start node to the end node by checking for open neighbors of the current node, computing a heuristic for each of the neighbors, and adding those neighbors to the list of open nodes to explore next. The next node to explore is the one with the lowest total cost + heuristic (g + h). This process is repeated until the end is found, as long as there are still open nodes to explore.

Officially supports Windows 10/11 with Visual Studio 2022. Linux and MacOS support on the way!

1. Clone recursively: git clone --recursive https://github.com/1neskk/MazePathfinder
2. Run script/setup.bat
3. Open Maze.sln and hit F7 to build (change configuration to Dist first)
4. Drag the SFML binaries sfml-window-2.dll, sfml-graphics-2.dll and sfml-system-2.dll into your output directory
5. Run the program

• You will need to use the SFML 2.5.1 from their website instead of the current submodule.

• xSnapi's pathfinding implementation using SFML

Feel free to open a Issue if you need some help!