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
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?
Step by Step Solution
3.40 Rating (166 Votes )
There are 3 Steps involved in it
Consider a MN node whose children are terminal nodes If MIN plays ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
21-C-S-A-I (69).docx
120 KBs Word File
