Abstract:
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.