I always wanted to create the function that finds the shortest path from one point to another. After a while I've learned that CS2D uses A* path finding algorithm. I tried to search in Google about that, but unfortunately I wasn't able to understand a thing about it. Then I tried to take a closer look at Starkkz' path finding function, but still.
I would be thankful to you guys, if you'll be able to explain me how exactly this algorithm working.