Consider a two-person zero-sum search game between hider and searcher. The hides among n discrete locations, the searcher successively visits individual locations until finding hider. Known to both players, at location i takes t time units detects hider—if hidden there—independently with probability [Formula: see text] for text]. aims maximize expected detection, whereas minimize it. We prove e...