Discussion
Why is iterative deepening used in game playing programs?
Answer: D
Under a clock, a program must have a move ready at any moment, and the best move from the previous shallower search is an excellent ordering hint for the next, which more than repays the repeated work. Memory saving is a benefit of the underlying depth first search, optimality is unattainable with a cutoff, and the evaluation function is unchanged. An algorithm that solves the deadline problem and the ordering problem simultaneously is exactly what a practical program needs.
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