Search for an infiltrator
Ljiljana R. Pavlović · Naval Research Logistics (NRL) · 1995
We have solved a discrete search game on an array of n ordered cells for n ⩽ 9, with two players: infiltrator (hider) and searcher, who have opposite goals. The infiltrator wishes to reach the last cell number n (in finite time) and the searcher has to defend that cell. The payoff (to the hider) is the probability that the hider wins, that is, reaches the last cell without getting captured. © 1995 John Wiley & Sons, Inc.