Machine-translated by Google. Questions are authored in English.
Top

Discussion

A chess program plays a series of pointless checks before losing material.

What is this behaviour called and how is it addressed?

  • A.The horizon effect, addressed by selective search extensions
  • B.The killer heuristic, addressed by better move ordering
  • C.Quiescence failure, addressed by a deeper fixed search
  • D.Transposition error, addressed by a larger hash table

Answer: A

Delaying an unavoidable loss past the last ply searched makes it invisible, and extending the search along forcing lines such as checks and captures is the standard remedy. A uniformly deeper search merely moves the horizon. Move ordering and hash tables address efficiency rather than this systematic misjudgement. Recognising a characteristic pattern of play as the signature of a known algorithmic defect is a diagnostic skill worth having.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.