Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
IBM's Deep Blue Chess Grandmaster Chips
IEEE Micro
The APHID Parallel alpha-beta Search Algorithm
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
A Twofold Distributed Game-Tree Search Approach Using Interconnected Clusters
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Hi-index | 0.00 |
A recently proposed ensemble approach to game-tree search has attracted a great deal of attention. The ensemble system consists of M computer players, where each player uses a different series of pseudo-random numbers. A combination of multiple players under the majority voting system would improve the performance of a Shogi-playing computer. We present a new strategy of move selection based on the search values of a number of players. The move decision is made by selecting one player from all M players. Each move is selected by referring to the evaluation value of the tree search of each player. The performance and mechanism of the strategy are examined. We show that the optimistic selection rule, which selects the player that yields the highest evaluation value, outperforms the majority voting system. By grouping 16 or more computer players straightforwardly, the winning rates of the strongest Shogi programs increase from 50 to 60% or even higher.