Dynamic Search Games
Lyn C. Thomas, Alan R. Washburn · Operations Research · 1991
In these games the searcher has a sequence of looks in which to detect the target, while the target chooses a new cell after each look in the knowledge of what cells have been searched so far. Since time is of the essence and the searcher's speed is bounded, the target has a tendency to choose cells far away from the most recent look. A theory for such games is developed and used to approximate a game involving a dipping sonar.