When a unit is selected, I want to be able to highlight all cells on a grid the unit can move to, similar to the Fire Emblem games. I found one method that does this in PathUtilities
called GetReachableNodes(GraphNode, int)
, however it states right it the documentation “Note that the distance measurement does not take heuristics, penalties or tag penalties”.
I am looking for a function that accepts a Seeker
and some metric of distance and receive a list of nodes that are within range fully taking into account all connection costs, penalties, and tag penalties .