Abstract
Selective simulation is a search technique that estimates the value of a move in a state space by averaging the results of a selected sample of continuations. The value of selective sampling has been demonstrated in domains such as Backgammon, Scrabble, poker, bridge, and even Go. This article describes efficient methods for controlling selective simulations.
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
Anantharaman, T.: Evaluation Tuning for Computer Chess: Linear Discriminant Methods. ICCA Journal 20(4), 224–242 (1997)
Billings, D., Papp, D., Schaeffer, J., Szafron, D.: Poker as an Experimental Testbed for Artificial Intelligence Research. In: Proceedings of AI 1998. Canadian Society for Computational Studies in Intelligence (1998)
Billings, D., Pena, L., Schaeffer, J., Szafron, D.: Using Probabilistic Knowledge and Simulation to Play Poker. In: AAAI National Conference, pp. 697–703 (1999)
Billings, D., Davidson, A., Schaeffer, J., Szafron, D.: The Challenge of Poker. Artificial Intelligence 134(1-2), 201–240 (2002) ISSN 0004-3702
Bouzy, B.: Associating domain-dependent knowledge and Monte Carlo approaches within a Go program. In: Joint Conference on Information Sciences, pp. 505–508 (2003) ISBN 0-9707890-2-5
Bouzy, B., Helmstetter, B.: Monte-Carlo Go Developments. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games. Many Games, Many Challenges, ACG-10 Proceedings, pp. 159–174. Kluwer Academic Publishers, Boston (2003)
Brügmann, B.: Monte Carlo Go (1993), Available by FTP from, ftp://ftp.cgl.ucsf.edu/pub/pett/go/ladder/mcgo.ps
Frank, I., Basin, D., Matsubara, H.: Monte-Carlo Sampling in Games with Imperfect Information: Empirical Investigation and Analysis. Research report of the Complex Games Lab, Ibaraki, Japan (1998)
Galperin, G., Viola, P.: Machine Learning for Prediction and Control. Research Report of the Learning & Vision Group. Artificial Intelligence Laboratory. MIT, Cambridge (1998)
Ginsberg, M.: GIB: Steps toward an Expert-Level Bridge-Playing Program. In: Proc. IJCAI 1999, Stockholm, Sweden, pp. 584–589 (1999)
Gordon, S.: A Comparison Between Probabilistic Search and Weighted Heuristics in a Game with Incomplete Information. In: AAAI Fall 1993 Symposium on Games: Playing and Learning, Menlo Park, CA. AAAI Technical Press Report FS9302 (1994)
Sheppard, B.: Towards Perfect Play of Scrabble. Ph.D. Thesis, Universiteit Maastricht. Universitaire Pers Maastricht, Maastricht, The Netherlands (2002) ISBN 90 5278 351 9
Tesauro, G.: Temporal Difference Learning and TD-Gammon. Communications of the ACMÂ 38(3) (March 1995) ISSN 0001-0782
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sheppard, B. (2006). Efficient Control of Selective Simulations. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds) Computers and Games. CG 2004. Lecture Notes in Computer Science, vol 3846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11674399_1
Download citation
DOI: https://doi.org/10.1007/11674399_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32488-1
Online ISBN: 978-3-540-32489-8
eBook Packages: Computer ScienceComputer Science (R0)