Controlled Conspiracy-Number Search
Controlled Conspiracy-Number Search
复制标题
受控阴谋号码搜索
DOI：
--
复制
发表时间：
1995
期刊：
影响因子：
--
通讯作者：
Peter Mysliwietz
中科院分区：
文献类型：
--
作者：
Ulf Lorenz;Valentin Rottmann;Rainer Feldmann;Peter Mysliwietz
本文提出了一种新的共谋号搜索算法，称为受控共谋号搜索算法。与其他CNS算法相比，任何CNS算法的基本步骤、结果的选择、扩展和备份都进行了修改。选择是通过以自上而下的方式将需求(即所谓的CN目标)分配给树的节点来完成的。由此，在单个选择阶段中选择一组树叶。扩展用于检查一个叶节点是否能满足其需求。备份使用从扩展步骤获得的启发式信息来为下一个选择阶段准备树。因此，我们的算法在战术位置上比-算法更强。这是通过在一组测试位置上对它们进行比较来显示的。它甚至可以在非战术位置比赛，如4：IPC 3所示；基于CCNS算法的程序Ulysses CCN在那里打了一场完整的锦标赛。此外，由于在每个选择步骤中选择一组叶子进行扩展，因此该算法可以很好地适合于并行化。
In this paper we present a new conspiracy number search algorithm (CNS), called Controlled Conspiracy Number Search (CCNS). The basic steps of any CNS algorithm, the selection, the expansion, and the backup of results have been modiied compared to other CNS algorithms. The selection is done by assigning demands, so called CN targets, to the nodes of the tree in a top-down fashion. By this, a set of leaves is selected in a single selection phase. The expansion is used to check, whether or not a leaf node can fullll its demand. The backup uses heuristic information gained from the expansion step to prepare the tree for the next selection phase. As a result, our algorithm is stronger than the-algorithm in tactical positions. This is shown by comparing them on a set of test positions. It is able to play even in nontactical positions, as shown on the 4:IPC 3 ; where Ulysses CCN, a program based on the CCNS algorithm, played a complete tournament. In addition, since in every selection step a set of leaves is selected for expansion, the algorithm may be well suited for parallelization.