A Generalised Quiescence Search Algorithm
A Generalised Quiescence Search Algorithm
复制标题
一种广义静止搜索算法
DOI：
10.1016/0004-3702(90)90072-8
复制
发表时间：
1990
期刊：
影响因子：
--
通讯作者：
D. Beal
中科院分区：
文献类型：
--
作者：
D. Beal
本文介绍了如何零移动的概念可以用来定义一个广义的静止搜索适用于任何极大极小问题。国际象棋战术领域的实验结果表明，在全宽搜索的成本效益的主要收益，并建议零移动静止可能是几乎一样广泛有用的α-β机制。该机制的本质是零移动产生比估计更可靠的位置值的边界。当相对边界接触时，它们创建一个比普通评估更可靠的单个值，并且搜索在该点处终止。这些终止先于任何α-β截止，并且可以导致自终止搜索。
This paper describes how the concept of a null move may be used to define a generalised quiescence search applicable to any minimax problem. Experimental results in the domain of chess tactics show major gains in cost effectiveness over full-width searches, and it is suggested that null-move quiescence may be almost as widely useful as the alpha-beta mechanism. The essence of the mechanism is that null moves give rise toboundson position values which are more reliable than evaluations. When opposing bounds touch, they create a single value which is more reliable than ordinary evaluations, and the search is terminated at that point. These terminations are prior to any alpha-beta cutoffs, and can lead to self-terminating searches.