Discussion
Match each technique with the problem it addresses.
List I
A. Quiescence search
B. Transposition table
C. Iterative deepening
D. Killer move heuristic
List II
P. evaluating volatile positions
Q. repeated positions reached by different orders
R. acting under an unknown deadline
S. improving move ordering cheaply
Select the correct match.
Answer: D
Each addition to a basic alpha beta searcher fixes one specific defect, and together they account for most of the difference between a textbook program and a competitive one. Naming the problem each technique solves, rather than learning the techniques as a list, makes it clear which are needed for a particular game and which may be omitted.
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