A* Search Algorithm:

Resources:

• https://en.wikipedia.org/wiki/A*_search_algorithm
• https://www.geeksforgeeks.org/a-search-algorithm/
• https://www.educative.io/edpresso/what-is-the-a-star-algorithm

Some Youtube Recommendations:

• https://www.youtube.com/watch?v=yMcZvZayJUA
• https://www.youtube.com/watch?v=ySN5Wnu88nE
• https://www.youtube.com/watch?v=JtiK0DOeI4A

A-Path-Finding-Visualizer

A python visualization of the A* path finding algorithm. It allows you to pick your start and end location and view the process of finding the shortest path, also in this implementation the wall can also be added which in problem solving terms can be called is barriers. This is the visual implementation of how will the A* algorithm will find the shortest path in the maze.

Some Screenshots of the Visualizer:

Part 1 Nothing on the grid.

This is how the normal grid looks like!

Part 2 This is how the calculation animation will occur!

Running algorithm from orange(start point) to torquoise(end point).

Part 3 Final solution is shown to the user.

This is how the correct path will appear in purple color as default!

Requirements

• Python 3.x
• TKinter
• Pygame