Empirical results with conspiracy numbers
作者:
NORBERT KLINGBEIL,
JONATHAN SCHAEFFER,
期刊:
Computational Intelligence
(WILEY Available online 1990)
卷期:
Volume 6,
issue 1
页码: 1-11
ISSN:0824-7935
年代: 1990
DOI:10.1111/j.1467-8640.1990.tb00125.x
出版商: Blackwell Publishing Ltd
关键词: conspiracy numbers;alpha‐beta;heuristic search;game trees;brute‐force search;minimax search;nombre de conspiration;alpha‐beta;recherche heuristique;arbre de jeu;recherche force brute;recherche minimax
数据来源: WILEY
摘要:
McAllester'sconspiracy numbersalgorithm is an exciting new approach to minimax search that builds trees to variable depth without application‐dependent knowledge. The likelihood of the root taking on a value is expressed by its conspiracy number: the minimum number of leaf nodes that must change their value to cause the root to change to that value. This paper describes experiences with the algorithm, using both random and application‐generated trees. Experiments suggest that more emphasis on breadth, rather than depth, can lead to significant performance improvements. New enhancements to the algorithm are capable of solving 41% more problems than McAllester's original propo
点击下载:
PDF
(1095KB)
返 回