Chess-Playing Programs and the Problem of Complexity

By Allen Newell, J. Shaw, Herbert A. Simon. 1958

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Jeff Rollason
2. Hervé Luga
3. Stéphane Sanchez
4. Yves Duthen
5. Nicolas Lassabe
6. H. Iida
7. M. Sakuta
8. Tomoyuki Kaneko

Citations in the corpus

• Genetically programmed strategies for chess endgame (2006, methodology): “One year later, he discovered the alpha-beta pruning algorithm for chess [13].”
• Computer shogi (2002, background): “A selective move generator would identify a sub-set of plausible moves using domain-specific knowledge [6,10,50]; the remaining moves would be discarded.”
• Microsoft (2019, unknown): “Despite some early misgivings (Selfridge 1956) back when chess playing programs had search trees only two deep (Newell et al. 1958), our modern chess programs completely rely on deep search trees and play chess not at all like humans.”