Abstract
A haystack game is a hider-seeker zero-sum game of locating a needle in a haystack. Baston and Bostock have obtained partial solutions to this game for the case of a square haystack. This paper supplements their results, thus confirming their belief that a complete solution is difficult.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baston, V. J., andBostock, F. A.,A Game Locating a Needle in a Circular Haystack, Journal of Optimization Theory and Applications, Vol. 47, pp. 383–391, 1985.
Baston, V. J., andBostock, F. A.,A Game Locating a Needle in a Square Haystack, Journal of Optimization Theory and Applications, Vol. 53, pp. 405–419, 1986.
Baston, V. J., andBostock, F. A.,A Continuous Game of Ambush, Naval Research Logistics, Vol. 34, pp. 645–654, 1987.
Lee, K. T.,On Ruckle's Game of Ambush, Naval Research Logistics, Vol. 37, pp. 355–363, 1990.
Author information
Authors and Affiliations
Additional information
Communicated by W. Stadler
The author would like to thank a referee for his helpful comments, in particular for suggesting Lemma 2.1 which has led to a more concise and transparent treatment of Section 2.
Rights and permissions
About this article
Cite this article
Lee, K.T. On a square haystack game. J Optim Theory Appl 76, 523–537 (1993). https://doi.org/10.1007/BF00939381
Issue Date:
DOI: https://doi.org/10.1007/BF00939381