Programming a Computor [sic - Computer] for Playing Chess [reproduced offprint on 11 x 8 1/2 inch paper]

[London]: [Taylor & Francis], 1950. Later printing. Wraps. Very Good. Later printing. [1], [1-blank], 256-275 pages. 10 7/8 x 8 3/8 inches. A reproduced copy of the original Philosophical Magazine printed on regular sized paper. Stapled upper left corner. Mild corner wear, otherwise a nice clean copy. Wraps. This paper was first presented at the National IRE Convention, March 9, 1949, in New York. "The Philosophical Magazine," Ser. 7, Vol 41, March 1950 (pp. 256-275) first published this paper. Offered here as a reproduced copy of the original offprint, from Shannon's files.

Levy, in his "Computer Chess Compendium," states, "This chapter serves as a historical introduction to the remainder of the volume. The very first paper, Shannon's seminal work dating back to 1949 [ Paper 1.1 in Levy's book ], was first presented as a lecture on March 9th of that year to the National Convention of the Institute of Radio Engineers in New York. Shannon pioneered computer chess as we know it today, and his ideas have been employed in almost every chess program ever written..." (introduction)

"The first technical paper on computer chess." (Origins of Cyberspace)

"In their paper on 'Chess-playing programs and the problem of complexity,' Newell, Shaw, and Simon had this to say about Shannon's paper: 'The relevant history [of chess-playing programs] begins with a paper by Claude Shannon in 1949. He did not present a particular chess program but discussed many of the basic problems involved. The framework he introduces has guided most of the subsequent analysis of the problem ... The basic framework introduced by Shannon for thinking about chess problems consists of a series of questions: 1. Alternatives. Which alternative moves are to be considered? 2. Analysis. a. Which continuations are to be explored and to what depth? b. How are positions to be evaluated strategically - in terms of their patterns? c. How are the static evaluations to be integrated into a single value for an alternative? 3. Final choice procedure. What procedure is to be used to select the final preferred move? We would hazard that Shannon's paper is chiefly remembered for the specific answers he proposed to these questions: consider all alternatives; search all continuations to a fixed depth, n; evaluate with a numerical sum; minimax to get the effective value for an alternative; and then pick the best one (Newell and Simon, 1963 p 42-44)" (Origins of Cyberspace quoting Feigenbaum pp 39-70)

PROVENANCE: The personal files of Claude E. Shannon. There were multiple examples of this item in Shannon's files.

REFERENCES:
Sloane and Wyner, "Claude Elwood Shannon Collected Papers," #54
Hook and Norman, "Origins of Cyberspace," #882
Levy, David: "Computer Chess Compendium," Springer-Verlag: 1988. (Paper 1.1)
Feigenbaum, E. A. and Feldman, J. "Computers and Thought" (New York: McGraw-Hill, 1963).