Discussion
Why is pruning harder in an expectimax tree?
Answer: D
An average cannot be bounded from one child alone unless the range of leaf values is known, so the alpha beta argument does not apply directly. Bounding the utilities does permit a limited form of pruning. Successor counts, unbounded utilities and unpredictability are not the obstacle. An algorithmic technique that depends on a maximum or minimum being determined by a single child fails as soon as the backup rule becomes an average, which is a clean example of a technique's assumptions mattering.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development