International Journal of Game Theory

, Volume 20, Issue 3, pp 269–276

A remark on the princess and monster search game

  • A. Yu. Garnaev


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.

Key words

Search Game Princess and Monster game optimal strategies 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Alpern S (1974), The Search Game with Mobile Hider on the Circle. In: Roxin EO, Liu TP and Sternberg RL (eds) Differential Games and Control Theory, Dekker, New York, pp 181–200Google Scholar
  2. Alpern S, Asic M (1986) Ambush Strategies in Search Games on Graphs. SIAM Journal on Control and Optimization 17, 66–75Google Scholar
  3. Fitzgerald CG (1979) The Princess and Monster Differential Game. SIAM Journal on Control and Optimization 17, 700–712Google Scholar
  4. Gal S (1979) Search Games with Mobile and Immobile Hider. SIAM Journal on Control and Optimization 17, 99–122Google Scholar
  5. Gal S (1980) Search Games. Academic Press, New York, New YorkGoogle Scholar
  6. Garnaev A Yu (1987) Solving the Search Problem in a Domain. Vestnik Leningrad University, Mathematics 20, 9–17Google Scholar
  7. Garnaev A Yu (1991) A Search Game in a Rectangle. Journal of Optimization Theory and Applications 69, 531–542Google Scholar
  8. Garnaev A Yu (1990) A Discrete Game on a Line with Delayed Information. Avtomatika i telemekhanika: N12, 51–59 (Translation in Automation and Remote Control)Google Scholar
  9. Isaacs R (1965) Differential games. John Wiley and Sons, Inc., New York, New YorkGoogle Scholar
  10. Karlin S (1959) Mathematical Methods and Theory in Games. Programming and Economics, Addison-Wesley Publishing Co., New YorkGoogle Scholar
  11. Lalley S, Robbins H (1988) Stochastic Search in a Convex Region. Probability Theory and Related Fields 77, 99–116Google Scholar
  12. Ruckle WH (1983) Geometric Games and Their Applications. Pitman Advanced Publishing Program, Boston, London, MelbourneGoogle Scholar
  13. Zelikin MI (1972) On a Differential Game with Incomplete Information. Soviet Mathematical Doklad 13, 228–231Google Scholar

Copyright information

© Physica-Verlag 1992

Authors and Affiliations

  • A. Yu. Garnaev
    • 1
  1. 1.Department of Computational MathematicsLeningrad Civil Engineering InstituteLeningradUDSSR

Personalised recommendations