Discussion
What is the overall lesson of adversarial search?
Answer: B
Minimax gives the correct framework, alpha beta makes it affordable, and a stack of carefully chosen approximations converts an impossible computation into a strong player. Neither exhaustive search nor evaluation alone suffices, and the results in chess and go settle the last option. Building on an exact foundation and approximating deliberately, rather than approximating from the start, is what makes the behaviour of such systems analysable.
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