Artificial Intelligence AIMA Exercises



Prove that the alpha–beta algorithm takes time $O(b^{m/2})$ with optimal move ordering, where $m$ is the maximum depth of the game tree.
Exercise 5.15

Prove that the alpha–beta algorithm takes time $O(b^{m/2})$ with optimal move ordering, where $m$ is the maximum depth of the game tree.


Community Solution



Submit Solution
Your Display Name
Email
Solution