The comparison of attacking and defensive algorithms in «Sea Battle» game is given. Statistical characteristics of four attacking algorithms with variable parameters are calculated as far as six defensive algorithms with variable parameters and three algorithms finishing ships. The evidence of existence of the best attacking algorithm against either random configurations or specific defensive algorithms is presented. In the same manner the best defensive algorithm is found.

sea battle game, deploying ships algorithms, attacking algorithms, finishing algorithms, confrontation modeling, Monte-Carlo method

Mathematical modelling in actual problems of science and technics