Discussion
Why are endgame tablebases useful to a searching program?
Answer: D
When the search reaches a position covered by the tables, it substitutes the exact result for the heuristic estimate, removing all error from that part of the tree. It also settles endgames that a search could not resolve. They say nothing about the middlegame or the opening and are not training data. Grafting an exactly known region onto an otherwise approximate search is a clean way of removing error where removing it is affordable.
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