After learning how to implement A* for path finding, we will now use its power and flexibility to develop some kind of coordinated behavior in order to ambush the player. This algorithm is especially useful when we want an inexpensive solution for the aforementioned problem, and which also has ease of implementation.
This recipe sets the path for every agent, to be taken into account for ambushing a given vertex or point in the graph.