SINGULAR EXTENSIONS - ADDING SELECTIVITY TO BRUTE-FORCE SEARCHING

被引：19

作者：

ANANTHARAMAN, T ^{[1
]}

CAMPBELL, M ^{[1
]}

HSU, FH ^{[1
]}

机构：

[1] CARNEGIE MELLON UNIV,DEPT COMP SCI,PITTSBURGH,PA 15213

来源：

ICCA JOURNAL | 1988年 / 11卷 / 04期

关键词：

D O I：

10.3233/ICG-1988-11402

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：135 / 143

页数：9

共 14 条

[1] BERLINER H, 1989, ADV COMPUTER CHESS 5, V5
[2] DEGROOT AD, 1966, INT C PSYCHOL
[3] EBELING C, 1987, ALL RIGHT MOVES VLSI
[4] GOETSCH G, 1988, 1988 P AAAI S GAM PL
[5] Hsu F., 1987, 1987 IEEE International Solid-State Circuits Conference. Digest of Technical Papers. ISSCC. First Edition, P278
[6] ANALYSIS OF ALPHA-BETA PRUNING
KNUTH, DE
MOORE, RW
[J]. ARTIFICIAL INTELLIGENCE, 1975, 6 (04) : 293 - 326
[7] LEE K, 1986, BILL TABLE BASED KNO
[8] LOW OVERHEAD ALTERNATIVES TO SSS
MARSLAND, TA
REINEFELD, A
SCHAEFFER, J
[J]. ARTIFICIAL INTELLIGENCE, 1987, 31 (02) : 185 - 199
[9] PALAY AJ, 1985, SEARCHING PROBABILIT
[10] REINFELD F, 1945, WIN CHESS