A remark on the princess and monster search game

We consider two zero-sum search games in which a searcher moves along a continuous trajectory in a search setQ. The probability of detection depends on the distance between the two players. The problem is open loop, i.e. neither player receives any information about the other as the game progresses. The payoff to a hider is the elapsed time before detection. Optimal mixed strategies are obtained.