Matematičeskoe obrazovanie, no. 1 (2003), pp. 2-18
Citer cet article
A. F. Lyakhov. Optimal Strategy for the Game “Sea Battle”: Search and Analysis. Matematičeskoe obrazovanie, no. 1 (2003), pp. 2-18. http://geodesic.mathdoc.fr/item/MO_2003_1_a0/
@article{MO_2003_1_a0,
author = {A. F. Lyakhov},
title = {Optimal {Strategy} for the {Game} {{\textquotedblleft}Sea} {Battle{\textquotedblright}:} {Search} and {Analysis}},
journal = {Matemati\v{c}eskoe obrazovanie},
pages = {2--18},
year = {2003},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MO_2003_1_a0/}
}
TY - JOUR
AU - A. F. Lyakhov
TI - Optimal Strategy for the Game “Sea Battle”: Search and Analysis
JO - Matematičeskoe obrazovanie
PY - 2003
SP - 2
EP - 18
IS - 1
UR - http://geodesic.mathdoc.fr/item/MO_2003_1_a0/
LA - ru
ID - MO_2003_1_a0
ER -
%0 Journal Article
%A A. F. Lyakhov
%T Optimal Strategy for the Game “Sea Battle”: Search and Analysis
%J Matematičeskoe obrazovanie
%D 2003
%P 2-18
%N 1
%U http://geodesic.mathdoc.fr/item/MO_2003_1_a0/
%G ru
%F MO_2003_1_a0
In the paper, the well-known children game “Sea Battle” which is a version of the classical problem of detecting fixed objects is analyzed. The probabilities of detecting several ships by a finite number of shots are calculated. For the case of two one-squared ships the matrix of the game is constructed.
