COMPUTER CHESS AND SEARCH
暂无分享,去创建一个
[1] Jonathan Schaeffer,et al. Low Overhead Alternatives to SSS , 1987, Artif. Intell..
[2] Jonathan Schaeffer,et al. The Utility of Expert Knowledge , 1985, IJCAI.
[3] Barry L. Nelson,et al. Hash Tables in Cray Blitz , 1985, J. Int. Comput. Games Assoc..
[4] Murray Campbell,et al. Singular Extensions: Adding Selectivity to Brute-Force Searching , 1990, Artif. Intell..
[5] Helmut Horacek. Knowledge-Based Move Selection and Evaluation to Guide the Search in Chess Pawn Endings , 1983, J. Int. Comput. Games Assoc..
[6] Donald E. Eastlake,et al. The Greenblatt chess program , 1967, AFIPS '67 (Fall).
[7] Claude E. Shannon,et al. Programming a computer for playing chess , 1950 .
[8] Ken Thompson,et al. Retrograde Analysis of Certain Endgames , 1986, J. Int. Comput. Games Assoc..
[9] T. Anthony Marsland,et al. A Comparison of Minimax Tree Search Algorithms , 1983, Artif. Intell..
[10] A. D. D. Groot. Thought and Choice in Chess , 1978 .
[11] A. G. Bell. The machine plays chess , 1978 .
[12] David Levy,et al. Computer Chess Compendium , 1988, Springer New York.
[13] P. Kent,et al. Tree-searching and tree-pruning techniques , 1988 .
[14] Albert L. Zobrist,et al. A New Hashing Method with Application for Game Playing , 1990 .
[15] David J. Slate,et al. A Chess Program that Uses its Transposition Table to Learn from Experience , 1987, J. Int. Comput. Games Assoc..
[16] C. Shannon. A chess-playing machine. , 1950, Scientific American.
[17] H. Kaindl,et al. Tree Searching Algorithms , 1990 .
[18] John C. Hayes,et al. The World Computer Chess Championship , 1976 .
[19] James John Gillogly,et al. Performance analysis of the technology chess program. , 1978 .
[20] Hans J. Berliner,et al. Some Necessary Conditions for a Master Chess Program , 1973, IJCAI.
[21] Larry R. Harris,et al. The Heuristic Search under Conditions of Error , 1974, Artif. Intell..
[22] Monty Newborn,et al. Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search , 1988, IEEE Trans. Pattern Anal. Mach. Intell..
[23] Jonathan Schaeffer,et al. Experiments in Search and Knowledge , 1986, J. Int. Comput. Games Assoc..
[24] Judea Pearl,et al. Asymptotic Properties of Minimax Trees and Game-Searching Procedures , 1980, Artif. Intell..
[25] James J. Gillogly,et al. The Technology Chess Program , 1972, Artif. Intell..
[26] Peter W. Frey,et al. Chess Skill in Man and Machine , 1984, Springer New York.
[27] Romeo Çollaku,et al. Deep thought , 1991, Nature.
[28] Jonathan Schaeffer,et al. Computers, Chess, and Cognition , 2011, Springer New York.
[29] Jonathan Schaeffer,et al. Distributed Game-Tree Searching , 1989, J. Parallel Distributed Comput..
[30] K. Thompson,et al. COMPUTER CHESS STRENGTH , 1982 .
[31] Ivan Bratko,et al. THE BRATKO-KOPEC EXPERIMENT: A COMPARISON OF HUMAN AND COMPUTER PERFORMANCE IN CHESS , 1982 .
[32] Jacques Pitrat,et al. A Chess Combination Program Which Uses Plans , 1977, Artif. Intell..
[33] T. Anthony Marsland,et al. Relative Efficiency of Alpha-Beta Implementations , 1983, IJCAI.
[34] Max Bramer. Advances in computer chess , 1978, SGAR.
[35] Murray Campbell,et al. Using Chunking to Solve Chess Pawn Endgames , 1984, Artif. Intell..
[36] K. Thompson,et al. BELLE CHESS HARDWARE , 1982 .
[37] R M Hyatt,et al. Cray Blitz , 1986 .
[38] Donald Michie. Chess with Computers , 1980 .
[39] John Philip Fishburn. Analysis of speedup in distributed algorithms , 1984 .
[40] K. Thompson,et al. BELLE: chess hardware , 1988 .
[41] Allen Newell,et al. Chess-Playing Programs and the Problem of Complexity , 1958, IBM J. Res. Dev..
[42] B. Mittman. A brief history of the computer chess tournaments: 1970–1975 , 1983 .
[43] H. Jaap van den Herik,et al. The Construction of an Omniscient Endgame Data Base , 1985, J. Int. Comput. Games Assoc..
[44] Feng-hsiung Hsu. Large scale parallelization of alpha-beta search: an algorithmic and architectural study , 1989 .
[45] Jonathan Schaeffer. 1989 World Computer Chess Championship , 1990 .
[46] Carl Ebeling,et al. Pattern Knowledge and Search: The SUPREM Architecture , 1989, Artif. Intell..
[47] Lewis Stiller,et al. Parallel Analysis of Certain Endgames , 1989, J. Int. Comput. Games Assoc..
[48] William Henry Carl Ebeling,et al. All the Right Moves: A VLSI Architecture for Chess , 1987 .
[49] Peter W. Frey,et al. Creating a Chess Player , 1988 .
[50] Mark Watson. A Chess-Playing Program , 1991 .
[51] Monty Newborn,et al. A parallel search chess program , 1985, ACM '85.
[52] Vladimir L. Arlazarov,et al. Algorithms for games , 1987 .
[53] Bruce W. Suter,et al. A parallel alpha/beta tree searching algorithm , 1989, Parallel Comput..
[54] D. Kopec. Advances in Man-Machine Play , 1990 .
[55] Arthur L. Samuel,et al. Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..
[56] Oliver Vornberger,et al. Distributed Game-Tree Search , 1989, J. Int. Comput. Games Assoc..
[57] Jonathan Schaeffer,et al. The History Heuristic and Alpha-Beta Search Enhancements in Practice , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[58] Donald E. Knuth,et al. The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.
[59] Arthur L. Samuel,et al. Some studies in machine learning using the game of checkers" in computers and thought eds , 1995 .
[60] Tony Scherzer,et al. Learning in Bebe , 1991, J. Int. Comput. Games Assoc..
[61] M. A. Bramer,et al. A model for the representation of pattern-knowledge for the endgame in chess , 1979 .
[62] T. Anthony Marsland,et al. Parallel Search of Strongly Ordered Game Trees , 1982, CSUR.
[63] Fred Popowich,et al. Parallel Game-Tree Search , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[64] Murray Campbell,et al. Experiments with the Null-Move Heuristic , 1990 .
[65] C. Kellogg. Machine intelligence 2 , 1969 .
[66] Richard D. Greenblatt,et al. CHEOPS: a chess-oriented processing system , 1979 .