I've gone through this tutorial:
I've written up the code, it works, but it's very slow, for example, I'm trying to find a path on a simple 8x8 grid, and it takes about 8 seconds to do so, iterating over 3000 times. Now, I just want to know, is A* generally slow and not to be taken as more than an example, or did I do something wrong? If it should be faster, I'll post my code so someone could tell me if I'm doing unnecesarry steps along the way.
EDIT: I tinkered with the code a bit, and found the culprit.