Opening Moves: Origins of Computer Chess
2.0 Opening Moves
2.1 Early Theorists
2.2 First Tests
2.3 Minimax and Alpha-Beta Pruning
2.4 Getting Going
2.5 Chess Software Basics

Advanced Search



Early Theorists

Computing pioneers Alan Turing in England and Claude Shannon in the United States developed fundamental theories of computation that had lasting impact on the field of computing. They also considered chess an interesting puzzle that might help solve other problems and possibly advance the dream of building a machine that could think.

In 1947, before there were computers, Turing designed the first program to play chess and tested it with paper and pencil using himself as the computer. Two years later, Shannon studied two different strategies for building “search trees.” The “Type A” strategy considered all possible moves to a fixed depth, and the “Type B” strategy used chess knowledge to explore the more promising lines to a greater depth. Almost all software for two-player games uses either of these strategies.


Share your thoughts on computer chess in the Forum
Related Collection Materials
forum
resources
feedback
tell a friend
Documents
A Mathematical Theory of Communication A Mathematical Theory of Communicat...

pdf
Alan Turing's Manual for the Ferranti Mk. I Alan Turing's Manual for the Ferran...

pdf
Images
Mathematician Claude Shannon Mathematician Claude Shannon

Computer pioneer Tom Kilburn (standing) and two colleagues at the Ferranti Mark I computer console Computer pioneer Tom Kilburn (stand...

Artifacts
No Items Found
Oral Histories
No Items Found
Moving Images
No Items Found
Software
Alan Turing's Manual for the Ferranti Mk. I Alan Turing's Manual for the Ferran...

pdf
Programming a Computer for Playing Chess Programming a Computer for Playing ...

pdf