There are n neighboring cells in a striaght line. A man selects a cell, hides in it and stays there. The searcher examines each cell until he finds the hider. Associated with the examination are a traveling cost dependent on the distance from the last cell examined and an examination cost which varies from cell to cell. The searcher wishes to minimize the expectation of cost of finding the hider, whereas the hider wishes to maximize it. The problem is formulated as a two-person zero-sum game and it is solved.
