This paper investigates a search question of a moving target. In the process of the search, the searcher distributes search resources over a search space in order to detect the target at a finite number of time points. The target selects the path from some options in order to evade the searcher. Then the problem is formulated as a two-person zero-sum game, and the method of the problem's solution is given.