A comparison of minimax tree search algorithms

摘要

Although theoretic performance measures of most game-searching algorithms exist, for various reasons their practicality is limited. This paper examines and extends the existing search methods, and reports on empirical performance studies on trees with useful size and ordering properties. Emphasis is placed on trees that are strongly ordered, i.e., similar to those produced by many current game-playing programs.