Another optimization of alpha-beta search
暂无分享,去创建一个
An optimization of the alpha-beta search algorithm is proposed. When used in conjunction with a transposition table, the optimization can reduce the number of positions searched. Measured reductions in searching checkers lookahead trees range from 0% to 16%, with an average reduction of 7%.
[1] Judea Pearl,et al. Asymptotic Properties of Minimax Trees and Game-Searching Procedures , 1980, Artif. Intell..
[2] Donald E. Knuth,et al. The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.