Unity 2018 Artificial Intelligence Cookbook - Second Edition

There's more...

There is an easy-to-implement improvement over the algorithm, which leads to the P-A*mbush variation. Simply order the lurkers' list, from the closest to the farthest, and we should have a better result at almost no extra cost in computation. This is due to the fact that the ordering operation is handled just once, and could be easily implemented via a priority queue, retrieving it as a list to the main A*mbush algorithm with no additional changes.