Algorithm for finding moving objects in a maze

Question

A have a maze and character controlled by the player and the drone, which must find it (by itself). Does anyone know a (efficient) AI algorithm for doing something like this? Postscript I know that there are several path search algorithms (for example, A *), but as far as I know, they only work for finding a path between two nodes that do not “move” (this will work if my character stops, but this is obvious, not this way).

Answer 1

If the "start point" is where the beep is located, and the "end point" should be launched in the player, then the best thing you can do using only the "standard" algorithm is to periodically use A * and from this determine where need to move the drone.

As you approach the player, you will calculate faster and faster, since the search space is theoretically smaller.

Using this, the player could find a set of positions that, when moving between them, cause the drone to “get stuck”, only moving back and forth, but these types of optimizations depend on the specific situation and the general algorithm will not include them.

Essentially, you have a fixed search space for each "frame", but you just need to run it every frame to decide what to do.

, A * , , .