A discrete game-theoretic problem with incomplete information

The paper is concerned with a discrete game problem where a conflict-managed system approaches the desired set with a known initial probabilistic distribution of states. The finding of the probability that the system path reaches the desired set within finite time is reduced to computation of the minimax (maxmin) or a multiple minimax (maxmin) of a certain known function, depending on availability of information during the game. An example illustrates the effect of knowledge on the part of the players of the result which they desire.