On the relationship between markov strategies in multistep search games and probability distributions

A certain statement of a matrix antagonistic game, commonly encountered in discrete problems of search of objects, is considered. The statement enables one to find strategies that reduce a multistep search problem to a sequence of related one-step matrix games. Bibliography: 5 titles. Translated fromObchyslyuval'na ta Prykladna Matematyka, No. 80, 1996, pp. 119–126.