3Continuous Search Games
DOI: 10.1201/9781003420057-3
A searcher would like to detect a mobile (or an immobile) hider as soon as possible. Such “hide and seek” games which we used to play in our childhood are formulated as mathematical problems. We present a survey that covers search games in graphs, in bounded regions, and in unbounded domains. In some of the problems a complete solution is presented; in others only upper and lower bounds are given and the difficulties associated with them are illustrated. Some interesting open problems are mentioned.
1. INTRODUCTION
A good way to introduce search games is to describe the princess and monster game presented by Rufus ...
Get Search Theory now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
