A COMPARISON OF MINIMAX TREE-SEARCH ALGORITHMS

被引：60

作者：

CAMPBELL, MS ^{[1
]}

MARSLAND, TA ^{[1
]}

机构：

[1] UNIV ALBERTA,DEPT COMP SCI,EDMONTON T6G 2H1,ALBERTA,CANADA

来源：

关键词：

D O I：

10.1016/0004-3702(83)90001-2

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：347 / 367

页数：21

共 16 条

[1] BRANCHING FACTOR OF ALPHA-BETA PRUNING ALGORITHM
BAUDET, GM
[J]. ARTIFICIAL INTELLIGENCE, 1978, 10 (02) : 173 - 199
[2] BAUDET GM, 1978, THESIS CARNEGIE MELL
[3] CAMPBELL M, 1981, 818 U ALB TECH REPT
[4] FISHBURN JP, 1980, 394 U WISC COMP SCI
[5] Fuller S. H., 1973, ANAL ALPHA BETA PRUN
[6] GILLOGY J, 1978, THESIS CARNEGIE MELL
[7] ANALYSIS OF ALPHA-BETA PRUNING
KNUTH, DE
MOORE, RW
[J]. ARTIFICIAL INTELLIGENCE, 1975, 6 (04) : 293 - 326
[8] Marsland T. A., 1981, P ACM NAT C, P109
[9] MARSLAND TA, 1980, 807 U ALB TECH REPT
[10] EFFICIENCY OF ALPHA-BETA SEARCH ON TREES WITH BRANCH-DEPENDENT TERMINAL NODE SCORES
NEWBORN, MM
[J]. ARTIFICIAL INTELLIGENCE, 1977, 8 (02) : 137 - 153