Discussion
What is minimax's requirement about the game being searched?
Answer: C
The basic algorithm assumes two players alternating, opposed utilities and a fully visible position, and each assumption relaxed produces a different variant: vectors for more players, chance nodes for randomness and belief states for hidden information. Listing the assumptions of a method is the quickest way to see which extensions exist and why each was needed.
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