Discussion
Why can a full game tree not be searched in chess?
Answer: A
With about thirty five moves available and games lasting eighty plies, the tree contains something like ten to the hundred and twenty nodes, beyond any conceivable computation. Search must therefore stop early and estimate. Game length is bounded by the repetition rules, terminal evaluation is trivial, and branching factor variation is minor. A number so large that no improvement in hardware could matter is what forces the whole apparatus of cutoffs and evaluation functions into existence.
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