The games computers (and people) play

Advances in Computers

Volumn 52, Issue C, 2000, Pages 189-266

  Schaeffer, Jonathan ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000302898     PISSN: 00652458     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0065-2458(00)80019-4     Document Type: Article

References (108)

1. Shannon C. Programming a computer for playing chess. Philosophical Magazine 41 (1950) 256-275
2. Turing A. Digital computers applied to games. In: Bowden B. (Ed). Faster than Thought (1953), Pitman, London 286-295
3. Samuel A. Some studies in machine learning using the game of checkers. IBM Journal of Research and Development 3 (1959) 210-229
4. Samuel A. Some studies in machine learning using the game of checkers: Recent progress. IBM Journal of Research and Development 11 (1967) 601-617
5. Krol M. Have we witnessed a real-life Turing test. Computer 32 3 (1999) 27-30
6. Thompson K. Retrograde analysis of certain endgames. Journal of the International Computer Chess Association 9 3 (1986) 131-139
7. Lafferty D. Chinook draws the hundred years problem. American Checker Federation Bulletin 269 (1997) 6
8. translation of the original that appeared in Problemy Kibernetiki 10, 141-150, 1963). Brudno A. Bounds and valuations for abridging the search for estimates. Problems of Cyberetics 10 (1963) 225-241
9. Knuth D., and Moore R. An analysis of alpha-beta pruning. Artificial Intelligence 6 4 (1975) 293-326
10. Marsland T. A review of game-tree pruning. Journal of the International Computer Chess Association 9 1 (1986) 3-19
11. Slate D., and Atkin L. Chess 4.5-The Northwestern University chess program. In: Frey P. (Ed). Chess Skill in Man and Machine (1977), Springer-Verlag, Berlin 82-118
12. Plaat A. Research re: search and re-search. PhD thesis (1996), Erasmus University, Rotterda, The Netherlands
13. Plaat A., Schaeffer J., Pijls W., and de Bruin A. Exploiting graph properties of game trees. AAAI National Conference (1996) 234-239
14. Korf R. Iterative deepening: An optimal admissible tree search. Artificial Intelligence 27 1 (1985) 97-109
15. Schaeffer J. Experiments in search and knowledge. PhD thesis (1986), Univesity of Waterloo, Canada
16. Schaeffer J. The history heuristic and alpha-beta search enhancements in practice. IEEE Pattern Analysis and Machine Intelligence 11 11 (1989) 1203-1212
17. Akl S., and Newborn M. The principle continuation and the killer heuristic. ACM Annual Conference (1977) 466-473
18. Reinefeld A. An improvement of the Scout tree-search algorithm. Journal of the International Computer Chess Association 6 4 (1983) 4-14
19. Reinefeld A. Spielbaum Suchverfahren. Informatik-Fachberichte 200 (1989), Springer-Verlag, Berlin
20. Marsland T., and Campbell M. Parallel search of strongly ordered game trees. Computing Surveys 14 4 (1982) 533-551
21. Pearl J. Scout: A simple game-searching algorithm with proven optimal properties. AAAI National Conference (1980) 143-145
22. Beal D. A generalised quiescence search algorithm. Artificial Intelligence 43 1 (1990) 85-98
23. Donninger C. Null move and deep search: Selective-search heuristics for obtuse chess programs. Journal of the International Computer Chess Association 16 3 (1993) 137-143
24. Buro M. Probcut: An effective selective extension of the α-β algorithm. Journal of the International Computer Chess Association 18 2 (1995) 71-76
25. Anantharaman T., Campbell M., and Hsu F. Singular extensions: Adding selectivity to brute-force searching. Artificial Intelligence 43 1 (1990) 99-109
26. Anantharaman T. A statistical study of selective min-max search. PhD thesis (1991), Carnegie Mellon University, Pittsburgh, PA
27. Campbell M., Hoane J., and Hsu F. Search control methods in Deep Blue. AAAI Spring Symposium on Search Techniques for Problem Solving Under Uncertainty and Incomplete Information (1999), AAAI Press 19-23
28. Ebeling C. All the Right Moves (1987), MIT Press, Cambridge, MA
29. Feldmann R. Spielbaumsuche mit massiv parallelen Systemen. PhD thesis (1993), Universität-Gesamthochschule Paderborn, Germany
30. * tree search algorithm: the best-first proof procedure. Artificial Intelligence 12 (1979) 23-40
31. * probablity based search. Artificial Intelligence 86 1 (1996) 97-156
32. McAllester D. Conspiracy numbers for min-max searching. Artificial Intelligence 35 (1988) 287-310
33. Lorenz U., Rottmann V., Feldmann R., and Mysliwietz P. Controlled conspiracy-number search. Journal of the International Computer Chess Association 18 3 (1995) 135-147
34. Baum E., and Smith W. A Bayesian approach to relevance in game playing. Artificial Intelligence 97 1-2 (1997) 195-242
35. Rivest R. Game tree searching by min/max approximation. Artificial Intelligence 34 1 (1987) 77-96
36. Russell S., and Wefald E. Do the Right Thing (1991), MIT Press, Cambridge, MA
37. Thompson K. Computer chess strength. In: Clarke M. (Ed). Advances in Computer Chess 3 (1982), Pergamon Press, Oxford 55-56
38. Hsu F. IBM's Deep Blue chess grandmaster chips. IEEE Micro (March-April) (1999) 70-81
39. Junghanns A., and Schaeffer J. Search versus knowledge in game-playing programs revisited. International Joint Conference on Artificial Intelligence (1997) 692-697
40. Scherzer T., Scherzer L., and Tjaden D. Learning in Bebe. In: Marsland T., and Schaeffer J. (Eds). Computers, Chess and Cognition (1990), Springer-Verlag, New York 197-216
41. Slate D. A chess program that uses its transposition table to learn from experience. Journal of the International Computer Chess Association 10 2 (1987) 59-71
42. Schaeffer J. One Jump Ahead: Challenging Human Supremacy in Checkers (1997), Springer-Verlag, New York
43. Gasser R. Efficiently Harnessing Computational Resources for Exhaustive Search. PhD thesis (1995), ETH Zürich, Switzerland
44. Sutton R. Learning to predict by the methods of temporal differences. Machine Learning 3 (1988) 9-44
45. Sutton R., and Barto A. Reinforcement Learning: An Introduction (1998), MIT Press, Cambridge, MA
46. Dailey, D. (1999). Personal communication (email message), 27 May.
47. Baxter J., Tridgell A., and Weaver L. Experiments in parameter learning using temporal differences. Journal of the International Computer Chess Association 21 2 (1998) 84-99
48. Beal D. Learning piece values using temporal differences. Journal of the International Computer Chess Association 20 3 (1997) 147-151
49. Fürnkranz J. Machine learning in computer chess: The next generation. Journal of the International Computer Chess Association 19 3 (1996) 147-161
50. Billings D., Peña L., Schaeffer J., and Szafron D. Using probabilistic knowledge and simulation to play poker. AAAI National Conference (1999) 697-703
51. Sheppard, B. (1999). Personal communication (email message), 9 March.
52. Berliner H. Backgammon computer program beats world champion. Artificial Intelligence 14 (1980) 205-220
53. Berliner H. Computer backgammon. Scientific American 242 6 (1980) 64-72
54. Tesauro G. Neurogammon wins computer olympiad. Neural Computation 1 (1989) 321-323
55. Tesauro, G. (1998). Personal communication (email message), 14 August.
56. Tesauro G. Temporal difference learning and TD-Gammon. Communications of the ACM 38 3 (1995) 58-68
57. Tesauro, G. (1999). Personal communication (email message), 28 May.
58. Zadeh N., and Kobliska G. On optimal doubling in backgammon. Management Science 23 (1977) 853-858
59. Tesauro, G. (1999). Personal communication (email message), 6 April.
60. Berlekamp E. A program for playing double-dummy bridge problems. Journal of the ACM 10 4 (1963) 357-364
61. Ginsberg M. GIB: Steps toward and expert-level bridge-playing program. International Joint Conference on Artificial Intelligence (1999) 584-589
62. Frank I. Search and Planning under Incomplete Information: A Study Using Bridge Card Play (1998), Springer-Verlag, New York
63. Ginsberg M. Partition search. AAAI National Conference (1996) 228-233
64. Smith S., Nau D., and Throop T. Computer bridge: A big win for AI planning. AI Magazine 19 2 (1998) 93-105
65. Smith S., Nau D., and Throop T. Success in spades: Using AI planning techniques to win the world championship of computer bridge. AAAI National Conference (1998) 1079-1086
66. Whittaker M. The 1998 world computer bridge championships. Bridge Magazine 96 10 (1998) 22-24
67. Eskes O. GIB: Sensational breakthrough in bridge sofware. IMP 8 2 (1997). http://www.impbridge.nl/articles/GIB1ens.html
68. Strachey C. Logical or non-mathematical programmes. Proceedings of the Association for Computing Machinery Meeting (1952) 46-49
69. Truscott T. The Duke checkers programs. Journal of Recreational Mathematics 12 4 (1979-1980) 241-247
70. Tinsley M. Letter to the editor. Scientific American, August (1980)
71. Schaeffer J., Culberson J., Treloar N., Knight B., Lu P., and Szafron D. A world championship caliber checkers program. Artificial Intelligence 53 2-3 (1992) 273-290
72. Samuel A. Programming computers to play games. In: Alt F. (Ed). Advances in Compters 1 (1960) 165-192
73. Condon J., and Thompson K. Belle chess hardware. In: Clarke M. (Ed). Advances in Computer Chess 3 (1982), Pergamon Press, Oxford 45-54
74. Hyatt R., Gower A., and Nelson H. Cray Blitz. In: Marsland T., and Schaeffer J. (Eds). Computers, Chess and Cognition (1990), Springer-Verlag, New York 111-130
75. Berliner H., and Ebeling C. Pattern knowledge and search: The SUPREME architecture. Artificial Intelligence 38 2 (1989) 161-198
76. Felten E., and Otto S. A highly parallel chess program. Conference of Fifth Generation Computer Systems (1988)
77. Hsu F., Anantharaman T., Campbell M., and Nowatzyk A. Deep Though. In: Marsland T., and Schaeffer J. (Eds). Computers, Chess, and Cognition (1990), Springer Verlag, New York 55-78
78. Hsu F., Anantharaman T., Campbell M., and Nowatzyk A. A grandmaster chess machine. Scientific American 263 4 (1990) 44-50
79. McCarthy J. AI as sport. Science 276 6 June (1997) 1518-1519
80. Hsu F. Large scale parallelization of alpha-beta search: An algorithmic and architectural study with computer chess. PhD thesis (1990), Carnegie Mellon University, Pittsburgh, PA
81. Kasparov G. IBM owes me a rematch. Time Magazine (American edition), 26 May (1997)
82. Rosenbloom P. A world-championship-level Othello program. Artificial Intelligence 19 3 (1982) 279-320
83. Lee K.-F., and Mahajan S. The development of a world class Othello program. Artificial Intelligence 43 1 (1990) 21-36
84. Buro M. The Othello match of the year: Takeshi Murakami vs. Logistello. Journal of the International Computer Chess Association 20 3 (1997) 189-193
85. Buro M. Logistello-A strong learning Othello program (1997). http://www.neci.nj.nec.com/homepages/mic/ps/log.overview.ps.gz
86. (To appear). Buro M. Experiments with Multi-ProbCut and a new high-quality evaluation function for Othello. In: van den Herik J., and Iida H. (Eds). Games in AI Research (2000), University of Maastricht
87. Buro M. Statistical feature combination for the evaluation of game positions. Journal of Artificial Intelligence Research 3 (1995) 373-382
88. Buro M. Toward opening book learning. Journal of the International Computer Chess Association 22 2 (1999) 98-103
89. Buro, M. (1999). Personal communication (email message), 17 May.
90. Billings D. Computer poker. MSc thesis (1995), University of Alberta, Canada
91. Findler N. Studies in machine cognition using the game of poker. Communications of the ACM 20 4 (1977) 230-245
92. Caro, M. (1999). Personal communication (email message), 13 March.
93. Papp D. Dealing with imperfect information in poker. MSc thesis (1998), University of Alberta, Canada
94. Schaeffer J., Billings D., Peña L., and Szafron D. Learning to play strong poker. ICML Workshop on Machine Learning in Game Playing (1999)
95. Billings D., Papp D., Schaeffer J., and Szafron D. Opponent modeling in poker. AAAI National Conference (1998) 493-499
96. Shapiro S., and Smith H. A Scrabble crossword game-playing program. Technical Report 119 (1977), Department of Computer Science, State University of New York, Buffalo
97. In: Levy D., and Beal D. (Eds). Heuristic Programming in Artificial Intelligence (1987), Ellis Horwood, Chichester
98. Appel A., and Jacobson G. The world's fastest Scrabble program. Communications of the ACM 31 5 (1988) 572-578
99. Appel A., and Jacobson G. The world's fastest Scrabble program. Communications of the ACM 31 5 (1988) 585
100. Gordon S. A faster Scrabble move generation algorithm. Software Practice and Experience 24 2 (1994) 219-232
101. Sheppard, B. (1998). Personal communication (email message), 23 October.
102. Sheppard, B. (1999). Personal communication (email message), 1 June.
103. Müller M. Computer go: A research agenda. Journal of the International Computer Chess Association 22 2 (1999) 104-112
104. Allis V. A knowledge-based approach to connect-four. The game is solved: White wins. MSc. thesis (1988), Vrije Universiteit, Amsterdam, The Netherlands
105. Allis V. Searching for solutions in games and artificial intelligence. PhD thesis (1994), University of Limburg, The Netherlands
106. Korf R. Finding optimal solutions to Rubik's Cube using pattern databases. AAAI National Conference (1997) 700-705
107. Junghanns A., and Schaeffer J. Domain-dependent single-agent search enhancements. International Joint Conference on Artificial Intelligence (1999) 570-575
108. Keim G., Shazeer N., Littman M., et al. Proverb: The probabilistic cruciverbalist. AAAI National Conference (1999) 710-717