Abstract
Some terminology for search problems is introduced. A number of search algorithms are discussed and applied to the game of Mastermind. A new upper bound for the average number of tests of sequential search strategies is derived, and applied to the game of Mastermind.
This work was carried out in the Engineering Design and Quality Centre at City University, and was supported by the SERC, UK.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
O’Geran, J. H., Wynn, H. P. and Zhigljavsky, A. (1991). Search. Acta Applicandae Mathematicae 25, 241–276.
O’Geran, J. H., Wynn, H. P. and Zhigljavsky, A. (1992a). Mastermind as a test bed for search algorithms. Chance, to appear.
O’Geran, J. H., Wynn, H. P. and Zhigljavsky, A. (1992b). Renyi-type randomization theory for search length upper bounds. Stochastic Optimization and Design (to appear).
Renyi, A. (1965). On the theory of random search. Bulletin of the American Mathematical Society 71, 809–828.
Renyi, A. (1969). Lectures on the Theory of Search. University of North California, Mimeo Series.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag New York, Inc.
About this paper
Cite this paper
Wynn, H.P., Zhigljavsky, A.A., O’Geran, J.H. (1994). Search Methods and Observer Logics. In: Gupta, S.S., Berger, J.O. (eds) Statistical Decision Theory and Related Topics V. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2618-5_42
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2618-5_42
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7609-8
Online ISBN: 978-1-4612-2618-5
eBook Packages: Springer Book Archive