Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Strategies for the Automatic Construction of Opening Books
| Book Series | Lecture Notes in Computer Science |
| Publisher | Springer Berlin / Heidelberg |
| ISSN | 0302-9743 (Print) 1611-3349 (Online) |
| Volume | Volume 2063/2001 |
| Book | Computers and Games |
| DOI | 10.1007/3-540-45579-5 |
| Copyright | 2001 |
| ISBN | 978-3-540-43080-3 |
| DOI | 10.1007/3-540-45579-5_5 |
| Pages | 74-86 |
| Subject Collection | Computer Science |
| SpringerLink Date | Monday, January 01, 2001 |
| |
|
Strategies for the Automatic Construction of Opening Books
Thomas R. Lincke6 
| (6) |
Institut für Theoretische Informatik, ETH Zürich, CH-8092 Zürich, Switzerland |
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.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|