Is it possible to do pathfinding on an octree?
When I anticipate, I thought A* on an octree would open 9*2 + 8 = 26 neighbor nodes over each iteration,
if the agent can either go up or down.
What approach can I take to achieve this?
Edited by lucky6969b, 21 June 2016 - 01:42 AM.