Difference between revisions of "Murray Campbell"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| (12 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
'''Murray S. Campbell''',<br/> | '''Murray S. Campbell''',<br/> | ||
| − | 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]] [https://en.wikipedia.org/wiki/Thomas_J._Watson_Research_Center T. J. Watson Research Center] in [https://en.wikipedia.org/wiki/Yorktown_Heights,_New_York Yorktown Heights, New York]. | + | a Canadian computer scientist and chess player <ref>[https://en.wikipedia.org/wiki/Murray_Campbell Murray Campbell from Wikipedia]</ref>, 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]] [https://en.wikipedia.org/wiki/Thomas_J._Watson_Research_Center T. J. Watson Research Center] in [https://en.wikipedia.org/wiki/Yorktown_Heights,_New_York Yorktown Heights, New York]. |
| Line 10: | Line 10: | ||
Murray Campbell got hooked in computer chess at the [[University of Alberta]] in [https://en.wikipedia.org/wiki/Edmonton Edmonton], Canada, where he worked with [[Tony Marsland]] on [[Parallel Search|parallel search]] and [[Principal Variation Search|principal variation search]] <ref>[[Tony Marsland]], [[Murray Campbell]] ('''1982'''). ''Parallel Search of Strongly Ordered Game Trees.'' [[ACM#Surveys|ACM Computing Surveys]], Vol. 14, No. 4, [http://www.cs.ualberta.ca/%7Etony/OldPapers/strong.pdf pdf]</ref> <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=254906&t=26974 Re: PVS] by [[Robert Hyatt]], [[CCC]], March 12, 2009</ref>. 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|chunking]] [[Pawn Endgame|pawn endgame]] program [[Chunker]], and received his Ph.D. in 1987 for his work on ''chunking as an abstraction mechanism in solving complex problems'' <ref>[[Murray Campbell]] ('''1988'''). ''Chunking as an Abstraction Mechanism''. Ph.D. thesis, [[Carnegie Mellon University]]</ref>. Along with [[Gordon Goetsch]], he researched on the [[Null Move Pruning|null move heuristic]] - none [[Recursion|recursively]] with a modest [[Depth Reduction R|depth reduction]] <ref>[[Gordon Goetsch]], [[Murray Campbell]] ('''1990'''). ''Experiments with the Null-move Heuristic''. [[Computers, Chess, and Cognition]]</ref>. | Murray Campbell got hooked in computer chess at the [[University of Alberta]] in [https://en.wikipedia.org/wiki/Edmonton Edmonton], Canada, where he worked with [[Tony Marsland]] on [[Parallel Search|parallel search]] and [[Principal Variation Search|principal variation search]] <ref>[[Tony Marsland]], [[Murray Campbell]] ('''1982'''). ''Parallel Search of Strongly Ordered Game Trees.'' [[ACM#Surveys|ACM Computing Surveys]], Vol. 14, No. 4, [http://www.cs.ualberta.ca/%7Etony/OldPapers/strong.pdf pdf]</ref> <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=254906&t=26974 Re: PVS] by [[Robert Hyatt]], [[CCC]], March 12, 2009</ref>. 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|chunking]] [[Pawn Endgame|pawn endgame]] program [[Chunker]], and received his Ph.D. in 1987 for his work on ''chunking as an abstraction mechanism in solving complex problems'' <ref>[[Murray Campbell]] ('''1988'''). ''Chunking as an Abstraction Mechanism''. Ph.D. thesis, [[Carnegie Mellon University]]</ref>. Along with [[Gordon Goetsch]], he researched on the [[Null Move Pruning|null move heuristic]] - none [[Recursion|recursively]] with a modest [[Depth Reduction R|depth reduction]] <ref>[[Gordon Goetsch]], [[Murray Campbell]] ('''1990'''). ''Experiments with the Null-move Heuristic''. [[Computers, Chess, and Cognition]]</ref>. | ||
| − | 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 | + | 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 joined the ChipTest team 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|evaluation function]]. He worked closely with the team's chess consultant, [https://en.wikipedia.org/wiki/Joel_Benjamin Joel Benjamin], in preparing the opening book <ref>[http://www.research.ibm.com/deepblue/meet/html/d.4.3.html Murray Campbell IBM Research Scientist]</ref>. |
=Photos= | =Photos= | ||
| Line 28: | Line 28: | ||
=Selected Publications= | =Selected Publications= | ||
| − | <ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/c/Campbell:Murray.html dblp: Murray Campbell]</ref> <ref>[ | + | <ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/c/Campbell:Murray.html dblp: Murray Campbell]</ref> <ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> |
==1980 ...== | ==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]], [https://webdocs.cs.ualberta.ca/~tony/TechnicalReports/TR80-7.pdf pdf] | * [[Tony Marsland]], [[Murray Campbell]], A. L. Rivera ('''1980'''). ''Parallel Search of Game Trees.'' Technical Report TR 80-7, Computing Science Department, [[University of Alberta]], [https://webdocs.cs.ualberta.ca/~tony/TechnicalReports/TR80-7.pdf pdf] | ||
| Line 42: | Line 42: | ||
* [[Murray Campbell]] ('''1988'''). ''Chunking as an Abstraction Mechanism''. Ph.D. thesis, [[Carnegie Mellon University]] | * [[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 | * [[Gordon Goetsch]], [[Murray Campbell]] ('''1988'''). ''Experimenting with the Null Move Heuristic in Chess''. [[AAAI]] Spring Symposium Proceedings | ||
| + | * [[Murray Campbell]], [[Feng-hsiung Hsu]], [[Gordon Goetsch]] ('''1988'''). ''[https://content.iospress.com/articles/icga-journal/icg11-2-3-21 Report on the 1988 Fredkin Masters Open]''. [[ICGA Journal#11_23|ICCA Journal, Vol. 11, No. 2-3]] | ||
* [[Thomas Anantharaman]], [[Murray Campbell]], [[Feng-hsiung Hsu]] ('''1988'''). ''Singular extensions: Adding Selectivity to Brute-Force Searching''. [[AAAI]] Spring Symposium, Computer Game Playing, also in [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]], and ('''1990''') in [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1 | * [[Thomas Anantharaman]], [[Murray Campbell]], [[Feng-hsiung Hsu]] ('''1988'''). ''Singular extensions: Adding Selectivity to Brute-Force Searching''. [[AAAI]] Spring Symposium, Computer Game Playing, also in [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]], and ('''1990''') in [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1 | ||
* [[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1989'''). ''Measuring the Performance Potential of Chess Programs''. [[Advances in Computer Chess 5]] | * [[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1989'''). ''Measuring the Performance Potential of Chess Programs''. [[Advances in Computer Chess 5]] | ||
| Line 53: | Line 54: | ||
* [[Feng-hsiung Hsu]], [[Murray Campbell]], [[Joe Hoane]] ('''1995'''). ''Deep Blue System Overview''. International Conference on Supercomputing 240-244 | * [[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 [https://mitpress.mit.edu/authors/david-g-stork David G. Stork] (ed.), ''[https://mitpress.mit.edu/books/hals-legacy Hal's Legacy - 2001's Computer as Dream and Reality]''. [https://en.wikipedia.org/wiki/MIT_Press MIT-Press], [http://web.stanford.edu/class/sts145/Library/campbell.pdf pdf] <ref>[https://www.stmintz.com/ccc/index.php?id=357151 An interesting link] by [[Steven Edwards]], [[CCC]], March 29, 2004</ref> <ref>[https://en.wikipedia.org/wiki/HAL_9000 HAL 9000 from Wikipedia]</ref> | * [[Murray Campbell]] ('''1997'''). ''"An Enjoyable Game": How HAL Plays Chess''. in [https://mitpress.mit.edu/authors/david-g-stork David G. Stork] (ed.), ''[https://mitpress.mit.edu/books/hals-legacy Hal's Legacy - 2001's Computer as Dream and Reality]''. [https://en.wikipedia.org/wiki/MIT_Press MIT-Press], [http://web.stanford.edu/class/sts145/Library/campbell.pdf pdf] <ref>[https://www.stmintz.com/ccc/index.php?id=357151 An interesting link] by [[Steven Edwards]], [[CCC]], March 29, 2004</ref> <ref>[https://en.wikipedia.org/wiki/HAL_9000 HAL 9000 from Wikipedia]</ref> | ||
| − | * [[Murray Campbell]] ('''1999'''). ''Knowledge Discovery in Deep Blue.'' [[ACM#Communications|Communications of the ACM]], Vol. 42, No. 11: | + | * [[Murray Campbell]] ('''1999'''). ''Knowledge Discovery in Deep Blue.'' [[ACM#Communications|Communications of the ACM]], Vol. 42, No. 11 |
| + | * [[Murray Campbell]], [[Joe Hoane]], [[Feng-hsiung Hsu]] ('''1999'''). ''Search Control Methods in Deep Blue''. [[AAAI]] Technical Report SS-99-07, [https://pdfs.semanticscholar.org/211d/7268093b4dfce8201e8da321201c6cd349ef.pdf pdf], [https://web.archive.org/web/20160914070926/http://aaaipress.org/Papers/Symposia/Spring/1999/SS-99-07/SS99-07-004.pdf pdf] | ||
==2000 ...== | ==2000 ...== | ||
* Vijay S. Iyengar, Jon Lee, [[Murray Campbell]] ('''2001'''). '' Evaluating multiple attribute items using queries.'' ACM Conference on Electronic Commerce | * Vijay S. Iyengar, Jon Lee, [[Murray Campbell]] ('''2001'''). '' Evaluating multiple attribute items using queries.'' ACM Conference on Electronic Commerce | ||
* [[Murray Campbell]], [[Joe Hoane]], [[Feng-hsiung Hsu]] ('''2002'''). ''Deep Blue''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artifical Intelligence], Vol. 134, No. 1-2 | * [[Murray Campbell]], [[Joe Hoane]], [[Feng-hsiung Hsu]] ('''2002'''). ''Deep Blue''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artifical Intelligence], Vol. 134, No. 1-2 | ||
| + | ==2010 ...== | ||
| + | * [[Murray Campbell]] ('''2018'''). ''[http://science.sciencemag.org/content/362/6419/1118 Mastering board games]''. [https://en.wikipedia.org/wiki/Science_(journal) Science], Vol. 362, No. 6419 » [[AlphaZero]] | ||
| + | |||
=Forum Posts= | =Forum Posts= | ||
| Line 66: | Line 71: | ||
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=50402 The Mathematics Genealogy Project - Murray Campbell] | * [http://genealogy.math.ndsu.nodak.edu/id.php?id=50402 The Mathematics Genealogy Project - Murray Campbell] | ||
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=190 Murray Campbell's ICGA Tournaments] | * [https://www.game-ai-forum.org/icga-tournaments/person.php?id=190 Murray Campbell's ICGA Tournaments] | ||
| − | * [http:// | + | * [http://www-03.ibm.com/ibm/history/ibm100/us/en/icons/deepblue/team/ IBM100 - Deep Blue - The Team] |
| − | * [http:// | + | * [http://www.computerhistory.org/chess/orl-43456387d6cd4/ Oral History of Murray Campbell], [[The Computer History Museum]], September 08, 2005 |
* [http://www.wired.com/science/discoveries/news/2007/05/murraycampbell_qa A Decade After Kasparov's Defeat, Deep Blue Coder Relives Victory], [https://en.wikipedia.org/wiki/Wired_(magazine) Wired News] Interview with Murray Campbell by [http://www.robertandrews.co.uk/ Robert Andrews], May 11, 2007 | * [http://www.wired.com/science/discoveries/news/2007/05/murraycampbell_qa A Decade After Kasparov's Defeat, Deep Blue Coder Relives Victory], [https://en.wikipedia.org/wiki/Wired_(magazine) Wired News] Interview with Murray Campbell by [http://www.robertandrews.co.uk/ Robert Andrews], May 11, 2007 | ||
| Line 74: | Line 79: | ||
'''[[People|Up one level]]''' | '''[[People|Up one level]]''' | ||
| + | [[Category:Researcher|Campbell]] | ||
| + | [[Category:Chess Programmer|Campbell]] | ||
| + | [[Category:Chess Player|Campbell]] | ||
| + | [[Category:Oral History|Campbell]] | ||
| + | [[Category:Berliner Quotes|Campbell]] | ||
Latest revision as of 17:09, 16 November 2020
Home * People * Murray Campbell
Murray Campbell [1]
Murray S. Campbell,
a Canadian computer scientist and chess player [2], 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.
Contents
Computer Chess
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 [3] [4]. 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 [5]. Along with Gordon Goetsch, he researched on the null move heuristic - none recursively with a modest depth reduction [6].
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 joined the ChipTest team 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 [7].
Photos
Murray Campbell, Feng-hsiung Hsu, Thomas Anantharaman, Mike Browne and Andreas Nowatzyk,
after winning the Fredkin Intermediate Prize for Deep Thought's Grandmaster-level performance. [8]
Quotes
by Hans Berliner on Campbell's role in HiTech team [9]:
Murray Campbell has helped with the opening book, and has now implemented the Singular Search (Anantharaman 1988 [10]) 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
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
- 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, 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, pdf
- Murray Campbell, Hans Berliner (1983). A Chess Program That Chunks. AAAI 1983, pdf
- Hans Berliner, Murray Campbell (1984). Using Chunking to Solve Chess Pawn Endgames. Artificial Intelligence, Vol. 23, No. 1
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
- Murray Campbell, Feng-hsiung Hsu, Gordon Goetsch (1988). Report on the 1988 Fredkin Masters Open. ICCA Journal, Vol. 11, No. 2-3
- Thomas Anantharaman, Murray Campbell, Feng-hsiung Hsu (1988). Singular extensions: Adding Selectivity to Brute-Force Searching. AAAI Spring Symposium, Computer Game Playing, also in ICCA Journal, Vol. 11, No. 4, and (1990) in Artificial Intelligence, Vol. 43, No. 1
- Hans Berliner, Gordon Goetsch, Murray Campbell, Carl Ebeling (1989). Measuring the Performance Potential of Chess Programs. Advances in Computer Chess 5
1990 ...
- Gordon Goetsch, Murray Campbell (1990). Experiments with the Null-move Heuristic. Computers, Chess, and Cognition
- Feng-hsiung Hsu, Thomas Anantharaman, Murray Campbell, Andreas Nowatzyk (1990). Deep Thought. Computers, Chess, and Cognition
- Feng-hsiung Hsu, Thomas Anantharaman, Murray Campbell, Andreas Nowatzyk (1990). A Grandmaster Chess Machine. Scientific American, Vol. 263, No. 4, Online Reprint
- 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 [13] [14]
- Murray Campbell (1999). Knowledge Discovery in Deep Blue. Communications of the ACM, Vol. 42, No. 11
- Murray Campbell, Joe Hoane, Feng-hsiung Hsu (1999). Search Control Methods in Deep Blue. AAAI Technical Report SS-99-07, pdf, pdf
2000 ...
- Vijay S. Iyengar, Jon Lee, Murray Campbell (2001). Evaluating multiple attribute items using queries. ACM Conference on Electronic Commerce
- Murray Campbell, Joe Hoane, Feng-hsiung Hsu (2002). Deep Blue. Artifical Intelligence, Vol. 134, No. 1-2
2010 ...
- Murray Campbell (2018). Mastering board games. Science, Vol. 362, No. 6419 » AlphaZero
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's ICGA Tournaments
- IBM100 - Deep Blue - The Team
- Oral History of Murray Campbell, The Computer History Museum, September 08, 2005
- A Decade After Kasparov's Defeat, Deep Blue Coder Relives Victory, Wired News Interview with Murray Campbell by Robert Andrews, May 11, 2007
References
- ↑ A Decade After Kasparov's Defeat, Deep Blue Coder Relives Victory, Wired News Interview with Murray Campbell by Robert Andrews, May 11, 2007
- ↑ Murray Campbell from Wikipedia
- ↑ Tony Marsland, Murray Campbell (1982). Parallel Search of Strongly Ordered Game Trees. ACM Computing Surveys, Vol. 14, No. 4, pdf
- ↑ Re: PVS by Robert Hyatt, CCC, March 12, 2009
- ↑ Murray Campbell (1988). Chunking as an Abstraction Mechanism. Ph.D. thesis, Carnegie Mellon University
- ↑ Gordon Goetsch, Murray Campbell (1990). Experiments with the Null-move Heuristic. Computers, Chess, and Cognition
- ↑ Murray Campbell IBM Research Scientist
- ↑ Deep Thought team with Fredkin Intermediate Prize 1988, Gift of Feng-hsiung Hsu hosted by The Computer History Museum
- ↑ Hans Berliner (1988). HiTech Becomes FirstComputer Senior Master. AI Magazine Volume 9 Number 3 (© AAAI), pdf
- ↑ 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
- ↑ dblp: Murray Campbell
- ↑ ICGA Reference Database
- ↑ An interesting link by Steven Edwards, CCC, March 29, 2004
- ↑ HAL 9000 from Wikipedia
