Conspiracy Numbers
Conspiracy Numbers
复制标题
阴谋数字
DOI：
10.1016/0004-3702(90)90071-7
复制
发表时间：
1990
期刊：
影响因子：
--
通讯作者：
J. Schaeffer
中科院分区：
文献类型：
--
作者：
J. Schaeffer
McAllester的阴谋数算法是一种令人兴奋的新的极大极小搜索程序，它以一种独立于应用程序的方式构建不同深度的树。该算法有选择地扩展树中的节点，试图缩小搜索树根部的合理极小极大值的范围。它通过计算每个可能的根值的共谋数来实现这一点；即必须更改其分数以使根更改为该值的叶节点的最小数量。本文描述了该算法，并给出了一个在计算机象棋程序中的实现。实验结果令人对该算法的未来感到乐观，尽管仍有一些严重的问题需要克服。
McAllester's conspiracy numbers algorithm is an exciting, new minimax search procedure that builds trees to variable depths in an application-independent manner. The algorithm selectively expands nodes in the tree trying to narrow the range of plausible minimax values at the root of the search tree. It does so by computing the conspiracy number for each possible root value; the minimum number of leaf nodes that must change their score to cause the root to change to that value. This paper describes the algorithm and presents an implementation in a computer chess program. Experimental results give rise to optimism about the algorithm's future, although there are still some serious problems to be overcome.