Discussion
Consider the following statements about alpha beta pruning.
1. It returns the same value as full minimax search
2. Its benefit depends strongly on move ordering
3. It applies unchanged to chance nodes in expectimax
Which of the statements given above is or are correct?
Answer: C
The first two are correct and are the two facts worth remembering about the technique. A chance node's value is an average and cannot be bounded from one child, so the pruning argument does not carry over without additional assumptions about the range of leaf values. Noticing that an argument depends on the backup rule being a maximum or minimum shows immediately where it will and will not apply.
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