CONSPIRACY NUMBERS FOR MIN-MAX SEARCH

被引：65

作者：

MCALLESTER, DA

机构：

来源：

ARTIFICIAL INTELLIGENCE | 1988年 / 35卷 / 03期

关键词：

D O I：

10.1016/0004-3702(88)90019-7

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

收藏

页码：287 / 310

页数：24

相关论文

共 7 条

[1] B-STAR TREE SEARCH ALGORITHM - BEST-1ST PROOF PROCEDURE [J].

BERLINER, H .

ARTIFICIAL INTELLIGENCE, 1979, 12 (01) :23-40

[2]

BERLINER HJ, 1981, P IJCAI 81 VANCOUVER

[3] ANALYSIS OF ALPHA-BETA PRUNING [J].

KNUTH, DE ;

MOORE, RW .

ARTIFICIAL INTELLIGENCE, 1975, 6 (04) :293-326

[4] DECISION QUALITY AS A FUNCTION OF SEARCH DEPTH ON GAME TREES [J].

NAU, DS .

JOURNAL OF THE ACM, 1983, 30 (04) :687-708

[5] THE B-STAR TREE-SEARCH ALGORITHM - NEW RESULTS [J].

PALAY, AJ .

ARTIFICIAL INTELLIGENCE, 1982, 19 (02) :145-163

[6] A MINIMAX ALGORITHM BETTER THAN ALPHA-BETA - YES AND NO [J].

ROIZEN, I ;

PEARL, J .

ARTIFICIAL INTELLIGENCE, 1983, 21 (1-2) :199-220

[7] MINIMAX ALGORITHM BETTER THAN ALPHA-BETA [J].

STOCKMAN, GC .

ARTIFICIAL INTELLIGENCE, 1979, 12 (02) :179-196