OPTIMUM EVASION VERSUS SYSTEMATIC SEARCH
RAND CORP SANTA MONICA CA
Pagination or Media Count:
The solution of the following hide and seek game is presented At each move Player I, the evader, is allowed to hide in one room, while Player II, the searcher, is allowed to search some given number of rooms. The restriction is made that Player II searches without repetition, that is, he is never allowed to return to a room he has previously searched. It is shown that if the payoff to Player I is any increasing function of the number of moves before capture, his best strategy is also never to return to a room in which he has previously hidden. A formula for the value of the game is presented.