Find all nodes within a certain range to a node by cost on a GridGraph

Beginner Questions
1

How do I find all the nodes within a certain range to a node by a given cost on a GridGraph? This is essentially the travelable distance from a node given the costs to the neighboring nodes. This is used in tactics games to indicate max distance, like in Advance Wars, XCOM, and Fire Emblem.

I used to generate a “range heuristic” which just plugged into my Astar algorithm to collect the nodes while within a certain range traveled. How do I do this with AStarPP?

I apologize if this is already covered. I’m new to AStarPathfinding… Thanks!

2

Hmm, I think I finally found it in the docs, as ConstantPath. I’ll have to try it out, but it looks like what I’m looking for.

1 Like
3

Yep. That’s the correct way to do it.