Algorithmic collision checking for analytic search: Rather than going one by one through the nodes, split the halfs until complete so that you can rule out for collisions early down the path.
Compute heuristics for each node once, right now its twice
Algorithmic collision checking for analytic search: Rather than going one by one through the nodes, split the halfs until complete so that you can rule out for collisions early down the path.
Compute heuristics for each node once, right now its twice