The Astar (A*) algorithm allow you to find one of the best paths to take if you know the goal to reach. This is used A LOT in video games, so I had to make this little program to refresh my memory.
I implemented this in C++, with the help of SFML to draw in a window.
Yellow squares are the nodes visited by the a
lgorithm. Each neighbour of these nodes are also checked.
click on the image to see the gif
You can find the source code on github