The title says it all.
I could really go for a feature in Path Finding that plots the shortest path to an object instance.
Similar to Pick Nearest Instance, but takes into account that the "nearest" object might be on the other side of a wall that will take many more steps to get to. So it'll calculate the "nearest" instance according to which instance has the shortest path to travel along to reach it. Because the shortest distance isn't always a straight line... :)
You can accomplish this by finding the path to each instance, and for each path found cycle through the nodes, adding up the distance between them to find the total distance.
Mind you, this is a bit tricky to do. But it can be done.
Develop games in your browser. Powerful, performant & highly capable.
Arima - LOL I guess so, but I'm still very much a newb. And I'm already going towards my fourth month of struggling with my enemy AI behavior.