{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:29:59Z","timestamp":1764782999959},"reference-count":6,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6372,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1989,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Consider a \u201csea\u201d of <jats:italic>M<\/jats:italic> squares which contains (at some unknown location) a \u201cbattleship\u201d of <jats:italic>K<\/jats:italic> 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 <jats:italic>deterministic<\/jats:italic> strategy for this problem which is guaranteed to locate the battleship in at most <jats:italic>c<\/jats:italic><jats:sub>1<\/jats:sub> <jats:italic>M\/K<\/jats:italic> probes, where <jats:italic>c<\/jats:italic><jats:sub>1<\/jats:sub> \u2248\ufe01 3.065.<\/jats:p>","DOI":"10.1002\/net.3230190306","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T02:48:33Z","timestamp":1178938113000},"page":"361-371","source":"Crossref","is-referenced-by-count":12,"title":["How to find a battleship"],"prefix":"10.1002","volume":"19","author":[{"given":"Amos","family":"Fiat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-62035-5"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/4904.4800"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"A.FiatandA.Shamir \u201cPolymorphic arrays: A novel VLSI layout for systolic computers.\u201dInformation and Control(1986).","DOI":"10.1016\/0022-0000(86)90042-5"},{"key":"e_1_2_1_5_2","unstructured":"A.Fiat \u201cFibonacci lattices: Theory and its application.\u201d Ph.d. Thesis Applied Math The Weizmann Institute of Science Rehovot Israel August (1986)."},{"key":"e_1_2_1_6_2","volume-title":"An Introduction to the Theory of Numbers","author":"Hardy G. H.","year":"1956"},{"key":"e_1_2_1_7_2","volume-title":"The Art of Computer Programming, Vol. 1: Fundamental Algorithms","author":"Knuth D. E.","year":"1977"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230190306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230190306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T15:17:27Z","timestamp":1697987847000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230190306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["10.1002\/net.3230190306"],"URL":"https:\/\/doi.org\/10.1002\/net.3230190306","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}