Skip to main content

Strategies for the Automatic Construction of Opening Books

Part of the Lecture Notes in Computer Science book series (LNCS,volume 2063)

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].

Keywords

  • opening book construction
  • expansion strategy
  • best-first
  • Awari
  • Othello

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-45579-5_5
  • Chapter length: 13 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-45579-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   129.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.V. Allis. Searching for Solutions in Games and Artificial Intelligence. PhD thesis, University of Limburg, Maastricht, The Netherlands, 1994.

    Google Scholar 

  2. M. G. Brockington. KEYANO Unplugged-The Construction of an Othello Program. Technical Report 97-05, Department of Computing Science, University of Alberta.

    Google Scholar 

  3. M. Buro. Toward Opening Book Learning. ICCA Journal, 22(2):98–102, 1999.

    Google Scholar 

  4. R. U. Gasser. Harnessing Computational Resources for Efficient Exhaustive Search. PhD thesis, ETH Zürich, 1995.

    Google Scholar 

  5. R. M. Hyatt. Book Learning-A Methodology to Tune an Opening Book Automatically. ICCA Journal, 22(1):3–12, 1999.

    Google Scholar 

  6. D. A. McAllester. Conspiracy Numbers for Min-Max Search. Artificial Intelligence, 35:287–310, 1988.

    MATH  CrossRef  MathSciNet  Google Scholar 

  7. J. Schaeffer. Conspiracy Numbers. Artificial Intelligence, 43:67–84, 1989.

    CrossRef  Google Scholar 

  8. J. Schaeffer, R. Lake, P. Lu, and M. Bryant. Chinook: The World Man-Machine Checkers Champion. AI Magazine, 17(1):21–29, 1996.

    Google Scholar 

  9. K. Thompson. Retrograde Analysis of Certain Endgames. ICCA Journal, 9(3):131–139, 1986.

    Google Scholar 

  10. R. van der Goot and T. R. Lincke. MarvinWinsAwari Tournament. ICGA Journal, 23(3):173–174, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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