Hello!
I’m using a point graph for a turn-based tactics game (the grid graph’s hex mode wasn’t playing nice with me, so I generate it using points instead).
In the case of an entity wanting to move adjacent to another entity, but there is already an entity on the closest node, how would I get a path to the nearest node that isn’t occupied (while still allowing to move through occupied nodes if necessary)?