Question: Prove that alphabeta pruning takes time O(2 m/2 ) with optimal move ordering, where m is the maximum depth of the game tree.
Prove that alpha–beta pruning takes time O(2m/2) with optimal move ordering, where m is the maximum depth of the game tree.
Step by Step Solution
3.52 Rating (159 Votes )
There are 3 Steps involved in it
The result is given in Section 6 of Knuth 1975 The exact ... View full answer
Get step-by-step solutions from verified subject matter experts
