APHID Game-Tree Search
نویسنده
چکیده
This paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. An APHID search is controlled by a master and a series of slave processors. The master searches the rst d 0 ply of the game-tree repeatedly. The slaves are responsible for the bottom plies of the game-tree. The slaves asynchronously read work lists from the master and return score information to the master. The master uses the returned score information to generate approximate minimax values, until all of the required score information is available. APHID has been programmed as an easy to implement, game-independent library, and was implemented into a chess program with one day of programming eeort. APHID yields reasonable performance on a network of workstations, an architecture where it is extremely diicult to use a shared transposition table eefectively.
منابع مشابه
APHID: Asynchronous Parallel Game-Tree Search
Most parallel game-tree search approaches use synchronous methods, where the work is concentrated within a specific part of the tree, or at a given search depth. This article shows that asynchronous game-tree search algorithms can be as efficient as or better than synchronous methods in determining the minimax value. APHID, a new asynchronous parallel game-tree search algorithm, is presented. A...
متن کاملThe APHID parallel αβ search algorithm
This paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. APHID represents a departure from the approaches used in practice. Instead of parallelism based on the minimal search tree, APHID uses a truncated gametree and all of the leaves of that tree are searched in parallel. APHID has been programmed as an easy to implement, game-indepen...
متن کاملImplementation of Game Tree Search Method by using NSL
This paper describes about hardware game tree search method of Blokus Duo. As algorithm of the game tree search method, we apply an evaluation function of sphere of influence. The game tree search method of hardware is implemented on FPGA. An implementation of the game tree search method by the hardware shows the effect which is easily of the operating speed improving.
متن کاملExperimenting with Revisits in Game Tree Search
The oldest known game tree search algorithm Alpha-Beta is still the most popular one. All other algorithms in this area fall short of Alpha-Beta in one or more of the following three desired characteristics high pruning power, low storage requirement and low execution time. This paper discusses how revisit of nodes can be used effectively in game tree search. A few strategies of introducing rev...
متن کامل