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

Discussion

Why does searching one ply deeper not cure the horizon effect?

  • A.Deeper search introduces errors from the transposition table
  • B.The program simply finds a longer sequence of delaying moves
  • C.The evaluation function becomes less accurate at greater depth
  • D.The extra ply exceeds the time available for the move

Answer: B

Whatever the depth, there is always a horizon, and a position with enough forcing resources can push a loss past any fixed one. Only extending selectively along the forcing lines, so that the search follows the tactics to their end, removes the problem. Evaluation accuracy, time and hash errors are separate issues. A defect that reappears at every scale points at the structure of the algorithm rather than at any parameter of it.

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

Post your comment

Please log in or register to post a comment.