How to find a battleship

Amos Fiat, Adi Shamir

Research output: Contribution to journalArticlepeer-review


Consider a “sea” of M squares which contains (at some unknown location) a “battleship” of K squares. Both the sea and the battleship can assume any rectangular shape. Our goal is to find the battleship by probing at least one of its squares. In this paper we describe a deterministic strategy for this problem which is guaranteed to locate the battleship in at most c1 M/K probes, where c1 ≈ 3.065.

Original languageEnglish
Pages (from-to)361-371
Number of pages11
Issue number3
StatePublished - May 1989
Externally publishedYes

Cite this