OPTIMAL SEARCH ON SOME GAME TREES

被引:28
作者
TARSI, M
机构
关键词
D O I
10.1145/2402.322383
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:389 / 396
页数:8
相关论文
共 8 条
[1]   BRANCHING FACTOR OF ALPHA-BETA PRUNING ALGORITHM [J].
BAUDET, GM .
ARTIFICIAL INTELLIGENCE, 1978, 10 (02) :173-199
[2]  
Feller W., 1968, INTRO PROBABILITY TH, V3rd
[3]  
Fuller S. H., 1973, ANAL ALPHA BETA PRUN
[4]   ANALYSIS OF ALPHA-BETA PRUNING [J].
KNUTH, DE ;
MOORE, RW .
ARTIFICIAL INTELLIGENCE, 1975, 6 (04) :293-326
[5]   THE SOLUTION FOR THE BRANCHING FACTOR OF THE ALPHA-BETA-PRUNING ALGORITHM AND ITS OPTIMALITY [J].
PEARL, J .
COMMUNICATIONS OF THE ACM, 1982, 25 (08) :559-564
[6]   ASYMPTOTIC PROPERTIES OF MINIMAX TREES AND GAME-SEARCHING PROCEDURES [J].
PEARL, J .
ARTIFICIAL INTELLIGENCE, 1980, 14 (02) :113-138
[7]  
SLAGLE J, 1969, J ACM, V2, P189
[8]   MINIMAX ALGORITHM BETTER THAN ALPHA-BETA [J].
STOCKMAN, GC .
ARTIFICIAL INTELLIGENCE, 1979, 12 (02) :179-196