25,161
edits
Changes
Created page with "'''Home * People * Murray Campbell''' FILE:murraycampbell_qa_full.jpg|border|right|thumb|link=http://www.wired.com/science/discoveries/news/2007/05/murray..."
'''[[Main Page|Home]] * [[People]] * Murray Campbell'''
[[FILE:murraycampbell_qa_full.jpg|border|right|thumb|link=http://www.wired.com/science/discoveries/news/2007/05/murraycampbell_qa| Murray Campbell <ref>[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</ref> ]]
'''Murray S. Campbell''',<br/>
a Canadian computer scientist and chess player, most famous for being member of the [[Deep Blue]] team and beating [https://en.wikipedia.org/wiki/Garry_Kasparov 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].
=Computer Chess=
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]] from [[Computer Chess Forums|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]] <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 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, [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=
[[FILE:deep-thought-team-1988.102645336.hsu.jpg|none|border|text-bottom|640px|link=http://www.computerhistory.org/chess/stl-430b9bbd52f71/]]
[[Murray Campbell]], [[Feng-hsiung Hsu]], [[Thomas Anantharaman]], [[Mike Browne]] and [[Andreas Nowatzyk]],<br/>
after winning the [[Edward Fredkin#Prize|Fredkin Intermediate Prize]] for Deep Thought's Grandmaster-level performance. <ref>[http://www.computerhistory.org/chess/stl-430b9bbd52f71/ Deep Thought team with Fredkin Intermediate Prize] 1988, Gift of [[Feng-hsiung Hsu]] hosted by [[The Computer History Museum]]</ref>
=Quotes=
by [[Hans Berliner]] on Campbell's role in [[HiTech]] team <ref>[[Hans Berliner]] ('''1988'''). ''HiTech Becomes FirstComputer Senior Master''. AI Magazine Volume 9 Number 3 (© AAAI), [http://www.aaai.org/ojs/index.php/aimagazine/article/viewFile/946/864 pdf]</ref>:
Murray Campbell has helped with the opening book, and has now implemented the [[Singular Extensions|Singular Search]] ([[Thomas Anantharaman|Anantharaman]] 1988 <ref>[[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 [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]], republished (1990) in [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1, pp. 99-109. ISSN 0004-3702</ref>) 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#Video|Kasparov versus Deep Thought 1989 documentary]]
* [[Deep Blue#MurrayCampbell|Murray Campbell on Deep Blue - Video]]
* [[History#ComputerChess|Computer Chess - A Movie]]
* [[History#AIPerspective|The History of Computer Chess - an AI Perspective - Video]]
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/c/Campbell:Murray.html dblp: Murray Campbell]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==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]] ('''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]], [https://webdocs.cs.ualberta.ca/~tony/TechnicalReports/TR81-9.pdf pdf]
* [[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]
* [[Tony Marsland]], [[Murray Campbell]] ('''1982'''). ''A Study of Parallel Tree Search Algorithms''. Technical Report TR 82-4, Computing Science Department, [[University of Alberta]], [https://webdocs.cs.ualberta.ca/~tony/TechnicalReports/TR82-4.pdf pdf]
* [[Murray Campbell]], [[Tony Marsland]] ('''1983'''). ''A Comparison of Minimax Tree Search Algorithms''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 20, No. 4, [http://webdocs.cs.ualberta.ca/~tony/OldPapers/TR82-3.pdf pdf]
* [[Murray Campbell]], [[Hans Berliner]] ('''1983'''). ''A Chess Program That Chunks''. [[AAAI]] 1983, [http://www.aaai.org/Papers/AAAI/1983/AAAI83-012.pdf pdf]
* [[Hans Berliner]], [[Murray Campbell]] ('''1984'''). ''[http://www.sciencedirect.com/science/article/pii/0004370284900067 Using Chunking to Solve Chess Pawn Endgames]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 23, No. 1
==1985 ...==
* [[Murray Campbell]] ('''1985'''). ''[http://portal.acm.org/citation.cfm?id=320516 The graph-history interaction: on ignoring position history]''. Computer Science Department, [[Carnegie Mellon University]], Proceedings of the 1985 ACM annual conference, [http://wiki.cs.pdx.edu/wurzburg2009/nfp/campbell-ghi.pdf 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
* [[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]]
==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, [http://www.disi.unige.it/person/DelzannoG/AI2/hsu.html Online Reprint]
* [[Thomas Anantharaman]], [[Murray Campbell]], [[Feng-hsiung Hsu]] ('''1990'''). ''Singular Extensions: Adding Selectivity to Brute-Force Searching.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artifical Intelligence], Vol. 43, No. 1
* [[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1990'''). ''Measuring the Performance Potential of Chess Programs.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 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 [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: 65-67
==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''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artifical Intelligence], Vol. 134, No. 1-2
=Forum Posts=
* [https://groups.google.com/d/msg/rec.games.chess/oGxblycMMOo/OVMJxRpiEgwJ Checkers match] by [[Murray Campbell]], [[Computer Chess Forums|rgc]], August 20, 1992 » [[Checkers]]
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/55f386354b360923 Murray Campbell lecture at University of Washington] by [[Bruce Moreland]], [[Computer Chess Forums|rgcc]], September 22, 1997
=External Links=
* [https://en.wikipedia.org/wiki/Murray_Campbell Murray Campbell from Wikipedia]
* [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]
* [http://chess.ca/campbell-murray Campbell Murray | The Chess Federation of Canada - La Fédération Canadienne des Échecs]
* [http://ebiquity.umbc.edu/person/html/Murray/Campbell/ Murray Campbell at University of Maryland, Baltimore County (UMBC)]
* [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
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:murraycampbell_qa_full.jpg|border|right|thumb|link=http://www.wired.com/science/discoveries/news/2007/05/murraycampbell_qa| Murray Campbell <ref>[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</ref> ]]
'''Murray S. Campbell''',<br/>
a Canadian computer scientist and chess player, most famous for being member of the [[Deep Blue]] team and beating [https://en.wikipedia.org/wiki/Garry_Kasparov 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].
=Computer Chess=
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]] from [[Computer Chess Forums|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]] <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 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, [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=
[[FILE:deep-thought-team-1988.102645336.hsu.jpg|none|border|text-bottom|640px|link=http://www.computerhistory.org/chess/stl-430b9bbd52f71/]]
[[Murray Campbell]], [[Feng-hsiung Hsu]], [[Thomas Anantharaman]], [[Mike Browne]] and [[Andreas Nowatzyk]],<br/>
after winning the [[Edward Fredkin#Prize|Fredkin Intermediate Prize]] for Deep Thought's Grandmaster-level performance. <ref>[http://www.computerhistory.org/chess/stl-430b9bbd52f71/ Deep Thought team with Fredkin Intermediate Prize] 1988, Gift of [[Feng-hsiung Hsu]] hosted by [[The Computer History Museum]]</ref>
=Quotes=
by [[Hans Berliner]] on Campbell's role in [[HiTech]] team <ref>[[Hans Berliner]] ('''1988'''). ''HiTech Becomes FirstComputer Senior Master''. AI Magazine Volume 9 Number 3 (© AAAI), [http://www.aaai.org/ojs/index.php/aimagazine/article/viewFile/946/864 pdf]</ref>:
Murray Campbell has helped with the opening book, and has now implemented the [[Singular Extensions|Singular Search]] ([[Thomas Anantharaman|Anantharaman]] 1988 <ref>[[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 [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]], republished (1990) in [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1, pp. 99-109. ISSN 0004-3702</ref>) 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#Video|Kasparov versus Deep Thought 1989 documentary]]
* [[Deep Blue#MurrayCampbell|Murray Campbell on Deep Blue - Video]]
* [[History#ComputerChess|Computer Chess - A Movie]]
* [[History#AIPerspective|The History of Computer Chess - an AI Perspective - Video]]
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/c/Campbell:Murray.html dblp: Murray Campbell]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==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]] ('''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]], [https://webdocs.cs.ualberta.ca/~tony/TechnicalReports/TR81-9.pdf pdf]
* [[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]
* [[Tony Marsland]], [[Murray Campbell]] ('''1982'''). ''A Study of Parallel Tree Search Algorithms''. Technical Report TR 82-4, Computing Science Department, [[University of Alberta]], [https://webdocs.cs.ualberta.ca/~tony/TechnicalReports/TR82-4.pdf pdf]
* [[Murray Campbell]], [[Tony Marsland]] ('''1983'''). ''A Comparison of Minimax Tree Search Algorithms''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 20, No. 4, [http://webdocs.cs.ualberta.ca/~tony/OldPapers/TR82-3.pdf pdf]
* [[Murray Campbell]], [[Hans Berliner]] ('''1983'''). ''A Chess Program That Chunks''. [[AAAI]] 1983, [http://www.aaai.org/Papers/AAAI/1983/AAAI83-012.pdf pdf]
* [[Hans Berliner]], [[Murray Campbell]] ('''1984'''). ''[http://www.sciencedirect.com/science/article/pii/0004370284900067 Using Chunking to Solve Chess Pawn Endgames]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 23, No. 1
==1985 ...==
* [[Murray Campbell]] ('''1985'''). ''[http://portal.acm.org/citation.cfm?id=320516 The graph-history interaction: on ignoring position history]''. Computer Science Department, [[Carnegie Mellon University]], Proceedings of the 1985 ACM annual conference, [http://wiki.cs.pdx.edu/wurzburg2009/nfp/campbell-ghi.pdf 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
* [[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]]
==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, [http://www.disi.unige.it/person/DelzannoG/AI2/hsu.html Online Reprint]
* [[Thomas Anantharaman]], [[Murray Campbell]], [[Feng-hsiung Hsu]] ('''1990'''). ''Singular Extensions: Adding Selectivity to Brute-Force Searching.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artifical Intelligence], Vol. 43, No. 1
* [[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1990'''). ''Measuring the Performance Potential of Chess Programs.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 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 [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: 65-67
==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''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artifical Intelligence], Vol. 134, No. 1-2
=Forum Posts=
* [https://groups.google.com/d/msg/rec.games.chess/oGxblycMMOo/OVMJxRpiEgwJ Checkers match] by [[Murray Campbell]], [[Computer Chess Forums|rgc]], August 20, 1992 » [[Checkers]]
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/55f386354b360923 Murray Campbell lecture at University of Washington] by [[Bruce Moreland]], [[Computer Chess Forums|rgcc]], September 22, 1997
=External Links=
* [https://en.wikipedia.org/wiki/Murray_Campbell Murray Campbell from Wikipedia]
* [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]
* [http://chess.ca/campbell-murray Campbell Murray | The Chess Federation of Canada - La Fédération Canadienne des Échecs]
* [http://ebiquity.umbc.edu/person/html/Murray/Campbell/ Murray Campbell at University of Maryland, Baltimore County (UMBC)]
* [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
=References=
<references />
'''[[People|Up one level]]'''
