Last-Branch and Speculative Pruning Algorithms for Maxn


Previous work in pruning algorithms for maxn multi-player game trees has produced shallow pruning and alpha-beta branch-and-bound pruning. The effectiveness of these algorithms is dependant as much on the range of terminal values found in the game tree as on the ordering of nodes. We introduce last-branch and speculative pruning techniques which can prune… (More)