Home * People * Murray Campbell

		Murray S. Campbell, a Canadian computer scientist and chess player, most famous for being member of the Deep Blue team and beating Gary Kasparov in 1997. Campbell is actually a research scientist at the IBM T. J. Watson Research Center in Yorktown Heights, New York. Murray Campbell got hooked in computer chess at the University of Alberta in Edmonton, Canada, where he worked with Tony Marsland on parallel search and Principal variation search [1][2]. He left Canada to enroll at Carnegie Mellon University (CMU) as a doctoral candidate in Computer Science. Supported by his advisor Hans Berliner, he developed the chunking pawn endgame program Chunker, and received his Ph.D. in 1987 for his work on chunking as an abstraction mechanism in solving complex problems [3]. Along with Gordon Goetsch, he researched on the Null move heuristic - none recursively with a modest Depth Reduction R [4] Campbell was member of the HiTech team around Berliner, while Feng-hsiung Hsu and Thomas Anantharaman were already developing ChipTest, the predecessor of Deep Thought. In 1986, Murray Campbell left the HiTech team for ChipTest and Deep Thought, and in 1989, Campbell and Hsu joined IBM to develop Deep Blue. Murray Campbell's main function in the Deep Blue team was the development of the evaluation function. He worked closely with the team's chess consultant, Joel Benjamin, in preparing the opening book [5].
Murray Campbell [6]

Photos

Murray Campbell, Feng-hsiung Hsu, Thomas Anantharaman, Mike Browne, Andreas Nowatzyk, after winning the Fredkin Intermediate Prize for Deep Thought's Grandmaster-level performance. [7]

Quotes

by Hans Berliner on Campbell's role in HiTech team ^[8]:

Murray Campbell has helped with the opening book, and has now implemented the Singular Search (Anantharaman 1988 [9]) algorithm on HiTech. He has been my alter-ego when it comes to discussion of chess ideas, and what can be done to allow HiTech to understand this or that.

See also

• Kasparov versus Deep Thought 1989 documentary
• Murray Campbell on Deep Blue - Video
• Computer Chess - A Movie
• The History of Computer Chess - an AI Perspective - Video

Selected Publications

^{[10] [11]}

1980 ...

• Tony Marsland, Murray Campbell, A. L. Rivera (1980). Parallel Search of Game Trees. Technical Report TR 80-7, Computing Science Department, University of Alberta, pdf
• Tony Marsland, Murray Campbell (1981). A Survey of Enhancements to the Alpha-Beta Algorithm. Proceedings of the ACM'81, pp. 109-114. Los Angeles.
• Tony Marsland, Murray Campbell (1981). Parallel Search of Strongly Ordered Game Trees. Technical Report TR 81-9, Department of Computing Science , University of Alberta, pdf
• Tony Marsland, Murray Campbell (1982). Parallel Search of Strongly Ordered Game Trees. ACM Computing Surveys, Vol. 14, No. 4, pp. 533-551. pdf
• Tony Marsland, Murray Campbell (1982). A Study of Parallel Tree Search Algorithms. Technical Report TR 82-4, Computing Science Department, University of Alberta, pdf
• Murray Campbell, Tony Marsland (1983). A Comparison of Minimax Tree Search Algorithms. Artificial Intelligence, Vol. 20, No. 4, pp. 347-367. ISSN 0004-3702, pdf
• Murray Campbell, Hans Berliner (1983). A Chess Program That Chunks. AAAI 1983 49-53, pdf
• Hans Berliner, Murray Campbell (1984). Using Chunking to Solve Chess Pawn Endgames. Artificial Intelligence, Vol. 23, No. 1, pp. 97-120. ISSN 0004-3702.

1985 ...

• Murray Campbell (1985). The graph-history interaction: on ignoring position history. Computer Science Department, Carnegie Mellon University, Proceedings of the 1985 ACM annual conference, pdf
• Murray Campbell (1988). Chunking as an Abstraction Mechanism. Ph.D. thesis, Carnegie Mellon University
• Gordon Goetsch, Murray Campbell (1988). Experimenting with the Null Move Heuristic in Chess. AAAI Spring Symposium Proceedings, pp. 14-18.
• Thomas Anantharaman, Murray Campbell, Feng-hsiung Hsu (1988). Singular extensions: Adding Selectivity to Brute-Force Searching. AAAI Spring Symposium, Computer Game Playing, pp. 8-13. Also published in ICCA Journal, Vol. 11, No. 4, republished (1990) in Artifical Intelligence, Vol. 43, No. 1, pp. 99-109. ISSN 0004-3702.
• Hans Berliner, Gordon Goetsch, Murray Campbell, Carl Ebeling (1989). Measuring the Performance Potential of Chess Programs. Advances in Computer Chess 5

1990 ...

• Feng-hsiung Hsu, Thomas Anantharaman, Murray Campbell, Andreas Nowatzyk (1990). Deep Thought. Computers, Chess, and Cognition, pp. 55-78
• Feng-hsiung Hsu, Thomas Anantharaman, Murray Campbell, Andreas Nowatzyk (1990). A Grandmaster Chess Machine. Scientific American, Vol. 263, No. 4, pp. 44-50. ISSN 0036-8733. Online Reprint
• Gordon Goetsch, Murray Campbell (1990). Experiments with the Null-move Heuristic. Computers, Chess, and Cognition, pp. 159-168
• Thomas Anantharaman, Murray Campbell, Feng-hsiung Hsu (1990). Singular Extensions: Adding Selectivity to Brute-Force Searching. Artifical Intelligence, Vol. 43, No. 1
• Hans Berliner, Gordon Goetsch, Murray Campbell, Carl Ebeling (1990). Measuring the Performance Potential of Chess Programs. Artifical Intelligence, Vol. 43, No. 1

1995 ...

• Feng-hsiung Hsu, Murray Campbell, Joe Hoane (1995). Deep Blue System Overview. International Conference on Supercomputing 240-244
• Murray Campbell (1997). "An Enjoyable Game": How HAL Plays Chess. in David G. Stork (ed.), Hal's Legacy - 2001's Computer as Dream and Reality. MIT-Press, pdf ^{[12] [13]}
• Murray Campbell (1999). Knowledge Discovery in Deep Blue. Communications of the ACM, Vol. 42, No. 11: 65-67

2000 ...

• Vijay S. Iyengar, Jon Lee, Murray Campbell (2001). Evaluating multiple attribute items using queries. ACM Conference on Electronic Commerce: 144-153
• Murray Campbell, Joe Hoane, Feng-hsiung Hsu (2002). Deep Blue. Artifical Intelligence, Vol. 134, No. 1-2, pdf

Forum Posts

• Checkers match by Murray Campbell, rgc, August 20, 1992 » Checkers
• Murray Campbell lecture at University of Washington by Bruce Moreland, rgcc, September 22, 1997

External Links

• Murray Campbell from Wikipedia
• The Mathematics Genealogy Project - Murray Campbell
• Murray Campbell from The Computer History Museum
• Murray Campbell's ICGA Tournaments
• Campbell Murray | The Chess Federation of Canada - La Fédération Canadienne des Échecs
• Murray Campbell at University of Maryland, Baltimore County (UMBC)
• A Decade After Kasparov's Defeat, Deep Blue Coder Relives Victory, Wired News Interview with Murray Campbell by Robert Andrews, May 11, 2007
• Checkmate: Members of IBM’s Deep Blue Team Discuss the World of Computer Chess, June 1, 2013 » Computer Chess - A Movie, Deep Blue
• 20 Years after Deep Blue: How AI Has Advanced Since Conquering Chess by Larry Greenemeier, Scientific American, June 2, 2017 ^[14] » Kasparov versus Deep Blue 1997

References

1. ^ Tony Marsland, Murray Campbell (1982). Parallel Search of Strongly Ordered Game Trees. ACM Computing Surveys, Vol. 14, No. 4, pp. 533-551. ISSN 0360-0300, pdf
2. ^ Re: PVS by Robert Hyatt from CCC, March 12, 2009
3. ^ Murray Campbell (1988). Chunking as an Abstraction Mechanism. Ph.D. thesis, Carnegie Mellon University
4. ^ Gordon Goetsch, Murray Campbell (1990). Experiments with the Null-move Heuristic. Computers, Chess, and Cognition, pp. 159-168
5. ^ Murray Campbell IBM Research Scientist
6. ^ A Decade After Kasparov's Defeat, Deep Blue Coder Relives Victory, Wired News Interview with Murray Campbell by Robert Andrews, May 11, 2007
7. ^ Deep Thought team with Fredkin Intermediate Prize 1988, Gift of Feng-hsiung Hsu from The Computer History Museum
8. ^ Hans Berliner (1988). HiTech Becomes FirstComputer Senior Master. AI Magazine Volume 9 Number 3 (© AAAI), pdf
9. ^ Thomas Anantharaman, Murray Campbell, Feng-hsiung Hsu (1988). Singular extensions: Adding Selectivity to Brute-Force Searching. AAAI Spring Symposium, Computer Game Playing, pp. 8-13. Also published in ICCA Journal, Vol. 11, No. 4, republished (1990) in Artificial Intelligence, Vol. 43, No. 1, pp. 99-109. ISSN 0004-3702
10. ^ DBLP: Murray Campbell
11. ^ ICGA Reference Database (pdf)
12. ^ An interesting link by Steven Edwards, CCC, March 29, 2004
13. ^ HAL 9000 from Wikipedia
14. ^ Scientific American article on Computer Chess by Mark Lefler, CCC, June 03, 2017

What links here?

Up one level