Risk management in game-tree pruning

摘要: Abstract In the half century since minimax was first suggested as a strategy for adversary game search, various search algorithms have been developed. The standard approach has to use improvements Alpha–Beta ( α – β ) algorithm. Some of more powerful examine continuations beyond nominal depth if they are special interest, while others terminate early. latter case is referred forward pruning. this paper we discuss some important aspects pruning, especially regarding risk-management, and propose ways making risk-assessment. Finally, introduce two new pruning methods based on principles discussed here, present experimental results from application in an established chess program.