A-Star Path Finding algorithm simulation

A graphical simulation of "Heuristic based A-Star Path Finding Algorithm" made with Pygame and Tkinter in python

## Algorithm
* The aim of the algorithm is to find the shortest path (path of least cost) from start to the end node, avoiding any obstacles in between
* Uses a _Heuristic-based A-Star path finding algorithm_
* Total cost function (heuristic) `f(n) = g(n) + h(n)`, where
* `g(n)` : Cost of nth node from start node. Calculated as the Manhattan distance of nth node from the start node
* `h(n)` : Cost of nth node from end node. Calculated as the Manhattan distance of nth node from the end node
* `f(n)` : Total cost of nth node

## Features
* Colorful real-time Algorithm Tracking
* Scale and Translate the simulation box
* Both pygame and tkinter implementation with the same backend
* Dark and Light themes

.................................................
Music by Vincent Rubinetti
Download the music on Bandcamp:
Stream the music on Spotify:

..................... Social media and other stuff ..................