Parallel Search of Strongly Ordered Game Trees

摘要: The alpha-beta algorithm forms the basis of many programs that search game trees. A number methods have been designed to improve utility sequential version this algorithm, especially for use in game-playing programs. These enhancements are based on observation alpha beta is most effective when best move each position considered early search. Trees so-called strong ordering property not only practical importance but possess characteristics can be exploited both and parallel environments. This paper draws upon experiences gained during development which chess Over past decade major developed by people building programs, these will surveyed compared here. balance contains a study contemporary searching trees parallel, using an arbitrary independent processors. To make efficient processors, one must clear understanding basic properties actually traversed cutoffs occur. provides such insights concludes with brief description amore » refinement standard problem. 33 references.« less