Alpha-Beta Pruning
A core acceleration technique for Minimax search that maintains two boundary values, alpha and beta, during the search process and prunes branches that cannot influence the final decision. Under ideal conditions, it can effectively double the searchable depth compared to unoptimized Minimax.
Timeline (last 90 days)
Alpha-Beta pruning maintains two boundary values and terminates early when a branch can no longer affect the final decision, theoretically capable of doubling the effective search depth.
Deep Blue could evaluate approximately 200 million chess positions per second, employed an Alpha-Beta pruning search algorithm, and was equipped with 480 dedicated chips.
Alpha-Beta pruning can reduce the effective branching factor of a search from b to √b under optimal ordering conditions, which is equivalent to doubling the search depth.
Alpha-Beta剪枝技术由Allen Newell和Herbert A. Simon等人在1950年代末开发
All Facts (4)
Alpha-Beta pruning can reduce the effective branching factor of a search from b to √b under optimal ordering conditions, which is equivalent to doubling the search depth.
60%UnverifiedAlpha-Beta pruning maintains two boundary values and terminates early when a branch can no longer affect the final decision, theoretically capable of doubling the effective search depth.
50%UnverifiedDeep Blue could evaluate approximately 200 million chess positions per second, employed an Alpha-Beta pruning search algorithm, and was equipped with 480 dedicated chips.
50%UnverifiedAlpha-Beta剪枝技术由Allen Newell和Herbert A. Simon等人在1950年代末开发
50%