Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Which is NOT true about the properties of the minmax algorithm?
It is optimal if the players play optimally.
Time complexity is O(bm).
Space complexity is O(bm).
It is complete if the game tree is finite.
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!