Strategies for the Automatic Construction of Opening Books

  • Thomas R. Lincke
Conference paper

DOI: 10.1007/3-540-45579-5_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2063)
Cite this paper as:
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

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Thomas R. Lincke
    • 1
  1. 1.Institut für Theoretische InformatikETH ZürichZürichSwitzerland

Personalised recommendations