Discussion
What is a common approximation for games of imperfect information?
Answer: D
Determinisation samples a consistent assignment of the hidden cards, solves the resulting perfect information game and averages over many samples, which is fast and misses the value of information gathering and of concealment. Worst case assumptions are unduly pessimistic, ignoring the hidden state is worse still, and waiting is not available. An approximation whose specific blind spots are understood can be used deliberately, whereas one whose failures are unknown cannot.
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