In 1949 Shannon published a groundbreaking paper on computer chess entitled Programming a Computer for Playing Chess^{[1]} . It describes how a machine or computer could be made to play a reasonable game of chess. His process for having the computer decide on which move to make is a minimax procedure, based on an evaluation function of a given chess position.

Dr. Claude E. Shannon demonstrating to Chessmaster Edward Lasker his (home-made) electric chess automation, build in 1949. The machine could handle up to six pieces, and was designed to test various programming methods. With one hundred and fifty relay operations required to complete a move, it arrived at the reply to an opponent's play in ten to fifteen seconds. It had built into it a random element, and as a result did not necessarily always make the same move when faced with the same position.

Computer pioneer Claude Shannon and chess champion Edward Lasker at MIT,
ponder the computational aspects of playing chess at Shannon's early relay-based
chess machine ^{[4]}

Without the sense of alpha-beta, and inspired by the experiments of Adriaan de Groot^{[10]} , Shannon and early programmers favored Type B strategy. Type B searches use some type of static heuristics in order to only look at branches that look important - with some risk to oversee some serious tactics not covered by the plausible move selector. Type B was most popular until the 1970's, when Type A programs had enough processing power and more efficient brute force algorithms to become stronger. Today most programs are closer to Type A, but have some characteristics of a Type B as mentioned in selectivity.

^Groot, A.D. de (1946). Het denken van den Schaker, een experimenteel-psychologische studie. Ph.D. thesis, University of Amsterdam; N.V. Noord-Hollandse Uitgevers Maatschappij, Amsterdam. Translated with the help of George Baylor, with additions (in 1965) as Thought and Choice in Chess. Mouton Publishers, The Hague. ISBN 90-279-7914-6. (amazon)

Home * People * Claude ShannonClaude Elwood Shannon(April 30, 1916 – February 24, 2001)an American electrical engineer, mathematician and researcher from MIT and since 1941 Bell Laboratories. One of the pioneers of the information theory .

In 1949 Shannon published a groundbreaking paper on computer chess entitled

Programming a Computer for Playing Chess^{[1]}. It describes how a machine or computer could be made to play a reasonable game of chess. His process for having the computer decide on which move to make is a minimax procedure, based on an evaluation function of a given chess position.^{[2]}## Table of Contents

## Photos

## Chess Automation

Quote of the text on the back on the photo, as given in ICCA Journal, Vol. 12, No. 4:^{[3]}:Dr. Claude E. Shannon demonstrating to Chessmaster Edward Lasker his (home-made) electric chess automation, build in 1949. The machine could handle up to six pieces, and was designed to test various programming methods. With one hundred and fifty relay operations required to complete a move, it arrived at the reply to an opponent's play in ten to fifteen seconds. It had built into it a random element, and as a result did not necessarily always make the same move when faced with the same position.ponder the computational aspects of playing chess at Shannon's early relay-based

chess machine

^{[4]}## WCCC 1980

^{[5]}Tony Marsland, Dave Slate, David Levy, Claude Shannon, Ken Thompson, Betty Shannon,

Tom Truscott

^{[6]}## WCCC 1989

^{[7]}^{[8]}## Shannon's Types

Claude Shannon categorized two types of search^{[9]}:Without the sense of alpha-beta, and inspired by the experiments of Adriaan de Groot

^{[10]}, Shannon and early programmers favored Type B strategy. Type B searches use some type of static heuristics in order to only look at branches that look important - with some risk to oversee some serious tactics not covered by the plausible move selector. Type B was most popular until the 1970's, when Type A programs had enough processing power and more efficient brute force algorithms to become stronger. Today most programs are closer to Type A, but have some characteristics of a Type B as mentioned in selectivity.## Selected Publications

1938).A Symbolic Analysis of Relay and Switching Circuits. Transactions of the AIEE, Vol. 57, No 12, Master's thesis 1940, Massachusetts Institute of Technology1948).A Mathematical Theory of Communication. pdf1949).Programming a Computer for Playing Chess. pdf from The Computer History Museum1950).A Chess-Playing Machine. Scientific American, Vol. 182 (No. 2, February 1950), pp. 48-51. Reprinted in The World of Mathematics, edited by James R. Newman, Simon & Schuster, NY, Vol. 4, 1956, pp. 2124-2133. Included in Part B1953).Computers and Automata. Proceedings of the Institute of Radio Engineers Vol. 41, No. 10^{[11]}^{[12]}^{[13]}1955).A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence.1956).Automata Studies. Annals of Mathematics Studies Number 34, Google books, oldcomputerbooks.com1989).An Interview with Claude Shannon, September 25, 1980 in Linz, Austria. ICCA Journal, Vol. 12, No. 41989).Thank You, Dr. Shannon. ICCA Journal, Vol. 12, No. 41993).Claude Shannon: Collected Papers. IEEE Press, ISBN 0-7803-0434-92001).CLAUDE SHANNON (1916-2001): FUNDAMENTAL CONTRIBUTIONS. ICGA Journal, Vol. 24, No. 12001).CLAUDE SHANNON (1916-2001): THANK YOU. ICGA Journal, Vol. 24, No. 12001).OBITUARY CLAUDE SHANNON (1916 – 2001): PERSONAL MEMORIES. ICGA Journal, Vol. 24, No. 22003).Cybernetics and Information Theory in the United States, France and the Soviet Union. in Mark Walker, Science and Ideology: A Comparative History » Claude Shannon, Norbert Wiener, covers the 1951 Paris Cybernetic Congress## See also

## External Links

## References

1949).Programming a Computer for Playing Chess. pdf1946).Het denken van den Schaker, een experimenteel-psychologische studie. Ph.D. thesis, University of Amsterdam; N.V. Noord-Hollandse Uitgevers Maatschappij, Amsterdam. Translated with the help of George Baylor, with additions (in1965) asThought and Choice in Chess. Mouton Publishers, The Hague. ISBN 90-279-7914-6. (amazon)2002).A hierarchical approach to computer Hex. Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence, pdf, Vadim Anshelevich acknowledged Claude Shannon, who build an analogue Hex-playing machine using electrical resistor circuits, which was model in Anshelevich's program Hexy2003).Search and evaluation in Hex. Technical report, University of Alberta, pdf2009).Bridg-It – Beating Shannon’s Analog Heuristic. pdf## What links here?

Up one level