SIGACT News Online Algorithms Column 3 Marek Chrobak Department of Computer Science University of California, Riverside marek@cs.ucr.edu A Princess Swimming in the Fog Looking for a Monster Cow The summer arrived early in Riverside this year. It s only late April, still early in the morning, but it s already above 80⦠F outside, and it s supposed to reach 100⦠F later this afternoon. Oh well. A good day to retreat to the local co ee house, ll my mug with freedom roast, and catch up on reading, with soothing bossa nova playing in the background. The book I ve been reading through lately is The Theory of Search Games and Rendezvous by Steve Alpern and Shmuel Gal [1]. It s actually two books for the price of one, with the rst part covering search games, and the second one rendezvous problems. Search theory is an area of operations research devoted to problems of designing optimal search trajectories. In a generic problem in search theory we are given some metric search space and two players, one called a hider H and the other a seeker S. Initially, H is placed randomly in the space according to
/lp/association-for-computing-machinery/a-princess-swimming-in-the-fog-looking-for-a-monster-cow-Ma8hFttZ5F