Statistical Analysis of "Battleship" Strategies
| Authors: Didych Ya.O., Malinetskii G.G. | Published: 26.07.2017 |
| Published in issue: #4(73)/2017 | |
| DOI: 10.18698/1812-3368-2017-4-122-135 | |
| Category: Informatics, Computer Engineering and Control | Chapter: Mathematical Modelling. Numerical Methods, and Software Systems | |
| Keywords: "Battleship"game, ship placement algorithms, attacking algorithms, finishing off algorithms, simulating confrontation, Monte-Carlo method | |
The article gives the comparison between attacking and defensive algorithms in "Battleship" game. We calculated statistical characteristics of four attacking algorithms with variable parameters, as well as six defensive algorithms with variable parameters and three algorithms of finishing off the ships. Findings of the research show that there exists the most effective algorithm both for random ship configurations, and when specific defensive algorithms are applied. Similarly, the best defensive algorithm for locating ships is provided.
References
[1] Larichev O.I. Teoriya i metodi prinyatiya resheniy, a tackzhe Hronika sobitiy v Volshebnih stranah [Theory and methods of decision making and Chronicles of events in Magic countries]. Moscow, Logos Publ., 2002. 392 p.
[2] Berlekamp E.R., Conway G.H., Guy R.K. Winning ways for your mathematical plays. Vol. I. Wellesley, Massachusetts, A.K. Peters, 2001. 293 p.
[3] Hamdy A. Taha. Operations research: An introduction. Pearson Education, New Jersey, 2003. 832 p.
[4] Evmenov V.P. Intellektualnie sistemi upravlenia [Intelligent control systems]. Moscow, "LIBROKOM" Book house, 2009. 304 p.
[5] Moiseev N.N., Ivanilov Yu.P., Stolyarova E.M. Metodi optimizacii [Optimization methods]. Moscow, Nauka Publ., 1978. 352 p.
[6] Williams J.D. The Complete strategist: Being a primer on the theory of games of strategy. New York, Dover Publications, 1986. 268 p.
[7] Sevenster M. Battleships as decision problem. ICGA Journal, 2004, vol. 27, no. 3, pp. 142-149.
