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]


5-0 and 5-2.Deep_Thought_Team_1988.102645336.HSU.lg.jpg
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]


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

Selected Publications

[10] [11]

1980 ...

1985 ...

1990 ...

1995 ...

2000 ...

Forum Posts

External Links


  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