THE STAR-MINIMAX SEARCH PROCEDURE FOR TREES CONTAINING CHANCE NODES

被引：43
作者：
BALLARD, BW
机构：
来源：
ARTIFICIAL INTELLIGENCE | 1983年 / 21卷 / 03期
关键词：
D O I：
10.1016/S0004-3702(83)80015-0
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
引用
收藏
页码：327 / 350
页数：24
相关论文
共 10 条
[1]   BRANCHING FACTOR OF ALPHA-BETA PRUNING ALGORITHM [J].
BAUDET, GM .
ARTIFICIAL INTELLIGENCE, 1978, 10 (02) :173-199
[2]   COMPUTER BACKGAMMON [J].
BERLINER, H .
SCIENTIFIC AMERICAN, 1980, 242 (06) :64-&
[3]   BACKGAMMON COMPUTER-PROGRAM BEATS WORLD CHAMPION [J].
BERLINER, HJ .
ARTIFICIAL INTELLIGENCE, 1980, 14 (02) :205-220
[4]  
BERLINER HJ, 1981, INT JOINT C ARTIFICI
[5]  
Fuller S. H., 1973, ANAL ALPHA BETA PRUN
[6]   ANALYSIS OF ALPHA-BETA PRUNING [J].
KNUTH, DE ;
MOORE, RW .
ARTIFICIAL INTELLIGENCE, 1975, 6 (04) :293-326
[7]  
NAU DS, 1980, 1ST P NAT C ART INT, P102
[8]   EFFICIENCY OF ALPHA-BETA SEARCH ON TREES WITH BRANCH-DEPENDENT TERMINAL NODE SCORES [J].
NEWBORN, MM .
ARTIFICIAL INTELLIGENCE, 1977, 8 (02) :137-153
[9]  
Nilsson N.J., 1980, PRINCIPLES ARTIFICIA
[10]  
REIBMAN AL, 1983, UNPUB 3RD P NAT C AR
1