An empirical comparison of pruning strategies in game trees

Six pruning strategies are empirically compared on uniform and nonuniform game trees under four schemes of assigning static values to leaf nodes. The performance of these strategies is compared on the basis of nodes created, node visits, and CPU time. To our knowledge, no other researchers have reported such exhaustive experimental results.