Abstract
This article presents a new selective pruning technique for alpha-beta based game-tree search in computer chess, called extended futility pruning . It builds on ideas of both razoring and normal futility pruning at frontier nodes (depth = 1), and it