PathFinder status

[LogicParrot]

Make Step() call the cWorld::DoWithChunk() function, then in the Item() function call the SingleStep() several times, passing the cChunk over to it for direct querying. Note that once you have a cChunk instance, you can simply get its neighboring chunks and thus query the neighborhood rather efficiently. I believe this would be such an improvement that it would invalidate the need for a cache completely.

Problem: The A* algorithm is sometimes jumpy: It won't necessarily query one chunk and then its neighbors, it could jump lots of blocks at a time.