Search Games with Mobile and Immobile Hider

Abstract

We consider search games in which the searcher moves along a continuous trajectory in a set Q until he captures the hider, where Q is either a network or a two (or more) dimensional region. We distinguish between two types of games; in the first type which is considered in the first part of the paper, the hider is immobile while in the second type of games which is considered in the rest of the paper, the hider is mobile. A complete solution is presented for some of the games, while for others only upper and lower bounds are given and some open problems associated with those games are presented for further research.