Abstract
An opening book is an important feature of any game-playing computer program. These books used to be constructed manually by an expert, by storing good moves suggested by theory, or simply by listing all games ever played by strong players [2,5,8]. Interest has recently shifted to automatic opening book construction where positions are selected by a best-first strategy, evaluated using a brute force search and then added to the opening book [3].
This paper presents the new “drop-out expansion” strategy for automatic opening book construction. It generalizes the previously used best-first strategy and reduces the opportunities for the opponent to force the player out of the book. The algorithm was used to calculate opening books for several games, including Awari and Othello, and helped to win the Awari tournament of the Computer Olympiad [10].
Acknowledgments
My thanks go toAlvaro Fussen for letting me use his Othello engine, and to Nora Sleumer for her many helpful comments on earlier versions of this paper.
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
L.V. Allis. Searching for Solutions in Games and Artificial Intelligence. PhD thesis, University of Limburg, Maastricht, The Netherlands, 1994.
M. G. Brockington. KEYANO Unplugged-The Construction of an Othello Program. Technical Report 97-05, Department of Computing Science, University of Alberta.
M. Buro. Toward Opening Book Learning. ICCA Journal, 22(2):98–102, 1999.
R. U. Gasser. Harnessing Computational Resources for Efficient Exhaustive Search. PhD thesis, ETH Zürich, 1995.
R. M. Hyatt. Book Learning-A Methodology to Tune an Opening Book Automatically. ICCA Journal, 22(1):3–12, 1999.
D. A. McAllester. Conspiracy Numbers for Min-Max Search. Artificial Intelligence, 35:287–310, 1988.
J. Schaeffer. Conspiracy Numbers. Artificial Intelligence, 43:67–84, 1989.
J. Schaeffer, R. Lake, P. Lu, and M. Bryant. Chinook: The World Man-Machine Checkers Champion. AI Magazine, 17(1):21–29, 1996.
K. Thompson. Retrograde Analysis of Certain Endgames. ICCA Journal, 9(3):131–139, 1986.
R. van der Goot and T. R. Lincke. MarvinWinsAwari Tournament. ICGA Journal, 23(3):173–174, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lincke, T.R. (2001). Strategies for the Automatic Construction of Opening Books. In: Marsland, T., Frank, I. (eds) Computers and Games. CG 2000. Lecture Notes in Computer Science, vol 2063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45579-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-45579-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43080-3
Online ISBN: 978-3-540-45579-0
eBook Packages: Springer Book Archive