Software constructions for game problems with $m$ target sets and changing systems

Problems of determining strategies from different classes for program maximin problems with $m$ target sets are considered, when the dynamics at each stage are switched. Regular cases of the corresponding problems are singled out and extremal strategies are determined from the corresponding minimax or maximin conditions. The broadest class of strategies used here is the class of piecewise positional strategies.