论文信息 - THE G AME O F C HESS - 字舞流文

THE G AME O F C HESS

Herbert A. Simon | Jonathan Schaeffer

[1] David A. McAllester. Conspiracy Numbers for Min-Max Search , 1988, Artif. Intell..

[2] H. Simon,et al. Perception in chess , 1973 .

[3] Carl Ebeling,et al. Pattern Knowledge and Search: The SUPREM Architecture , 1989, Artif. Intell..

[4] H. Simon,et al. A simulation of memory for chess positions. , 1973 .

[5] A. L. Samuel,et al. Some studies in machine learning using the game of checkers. II: recent progress , 1967 .

[6] Murray Campbell,et al. Singular Extensions: Adding Selectivity to Brute-Force Searching , 1990, Artif. Intell..

[7] Allen Newell,et al. Chess-Playing Programs and the Problem of Complexity , 1958, IBM J. Res. Dev..

[8] Murray Campbell,et al. Using Chunking to Solve Chess Pawn Endgames , 1984, Artif. Intell..

[9] Claude E. Shannon,et al. Programming a computer for playing chess , 1950 .

[10] David E. Wilkins,et al. Using Knowledge to Control Tree Searching , 1982, Artif. Intell..

[11] A. D. D. Groot. Thought and Choice in Chess , 1978 .

[12] H. J. van den Herik,et al. A knowledge-based approach to connect-four: The game is over: White to move wins! , 1989 .

[13] Jonathan Schaeffer,et al. The History Heuristic and Alpha-Beta Search Enhancements in Practice , 1989, IEEE Trans. Pattern Anal. Mach. Intell..