ON THE COMPLEXITY OF SEARCHING GAME TREES AND OTHER RECURSION TREES

被引：6

作者：

ALTHOFER, I ^{[1
]}

机构：

[1] UNIV BIELEFELD,FAK MATH,D-4800 BIELEFELD 1,FED REP GER

来源：

关键词：

D O I：

10.1016/0196-6774(88)90016-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：538 / 567

页数：30

共 10 条

[1]

ALTHOFER I, 1987, GENERALIZED MINIMAX

[2]

ALTHOFER I, 1987, RELIABLE SELECTIVE S

[3]

BAL HE, 1986, ICCA J, V9, P146

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

KNUTH, DE ;

MOORE, RW .

[5]

MARSLAND TA, 1986, ICCA J, V9, P3

[6]

Pearl J., 1985, HEURISTICS INTELLIGE

[7] On the theory of matrices [J].

Perron, O .

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

ROIZEN, I ;

PEARL, J .

[9]

SCHRUFER G, 1986, ADV COMPUTER CHESS, V4, P101

[10] OPTIMAL SEARCH ON SOME GAME TREES [J].

TARSI, M .