Okay, I just have to get attention: I know there's been some threads about this, and also that there is (at least should be) snippets in the codebase regarding A* and other pathfinding algorithms, but I just had to figure this on my own. For some odd reason. And now that I've done it, I need some publicity, otherwise it would've been coded for nothing.
...and I thought I'd also ask at the same that if people could go over this and give feedback (how to improve, bugs, etc...).
I know about some already, but it's in enough working condition to say that it works. 8-D
I believe that most of the overhead in that is basically the "live observation"...
Here are some media files for it (1bpp bitmaps representing maps)
http://corrie.scp.fi/users/jani.karkkainen/m100x100.bmp
http://corrie.scp.fi/users/jani.karkkainen/m8x8.bmp