Conspiracy numbers for min-max search
Artificial Intelligence
Artificial Intelligence - Special issue on computer chess
Monte-Carlo opening books for amazons
CG'10 Proceedings of the 7th international conference on Computers and games
Generating an opening book for amazons
CG'04 Proceedings of the 4th international conference on Computers and Games
An efficient hybrid algorithm to evolve an Awale player
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
| Hi-index | 0.00 |
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].