Prove the following assertion: for every game tree, the utility obtained by MAX using mini max decisions
Question:
Prove the following assertion: for every game tree, the utility obtained by MAX using mini max decisions against a suboptimal MIN will be never be lower than the utility obtained playing against an optimal MIN. Can you come up with a game tree in which MAX can do still better using a suboptimal strategy against a suboptimal MIN?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Consider a MN node whose children are terminal nodes If MIN plays ...View the full answer
Answered By
Joseph Ogoma
I have been working as a tutor for the last five years. I always help students to learn and understand concepts that appears challenging to them. I am always available 24/7 and I am a flexible person with the ability to handle a wide range of subjects.
1+ Reviews
10+ Question Solved
Related Book For 
Artificial Intelligence A Modern Approach
ISBN: 978-0137903955
2nd Edition
Authors: Stuart J. Russell and Peter Norvig
Question Posted:
