There is programmed the search of an active object, moving through a rectangular area, divided into identical frontiers vertically with their minimal horizontal division. To converge the partial indeterminancy in pre-evaluated probabilities of the object positioning there is solved the known continual antagonistic game on the square of those probabilities. The optimal behavior of searchers is in the diagonal 2 2 -game solution, evolving from frontier down to frontier through the area. Also the programmed search full code is presented.
Ключові слова: active object search, subarea minimal division, partial indeterminancy, diagonal game, multistage solution