How does the a* algorithm work

I’m new to this algorithm and i really have to understand how the algorithm work. Recently i’ve successfully implemented the a* pathfinding to my 2D Platformer enemy by following a couple of tutorial videos on YouTube, but they’re only showing how to use this algorithm not how it works. I would really appreciate if someone explain it to me. Like i really want to learn how the Math calculation works and where the C# script file it’s in. As far as i know the math takes the lowest cost and then use that to travel to the target? Anyway i’m only using this algorithm to my enemy where the enemy follows the player and if it get’s close enough it will attack the player.


I would recommend Introduction to the A* Algorithm