An empirical comparison of pruning strategies in game trees

Size pruning strategies on uniform and nonuniform game trees of 24 different sizes, each being assigned leaf-node static values under four different schemes, are compared. The performance of these strategies is compared on the basis of nodes created, node visits, and CPU time. These are believed to be the most exhaustive experimental results so far reported.