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

Discussion

What is aspiration search?

  • A.Starting the search with a narrow window around an expected value
  • B.Searching only the moves the program aspires to play
  • C.Setting a target evaluation the search must achieve
  • D.Widening the search window as the game progresses

Answer: A

Guessing that the value will be close to the previous iteration's and searching with a narrow alpha beta window prunes far more, at the risk of the value falling outside and requiring a re-search. Usually the guess is right and the saving is substantial. Move restriction, targets and progressive widening are different techniques. A gamble that usually pays and whose failure costs only a repeat is a favourable bet, provided the failure is detected rather than silently accepted.

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

Post your comment

Please log in or register to post a comment.