Chess-Playing Programs and the Problem of Complexity

@article{Newell1958ChessPlayingPA,
  title={Chess-Playing Programs and the Problem of Complexity},
  author={Allen Newell and J. C. Shaw and Herbert A. Simon},
  journal={IBM J. Res. Dev.},
  year={1958},
  volume={2},
  pages={320-335}
}
This paper traces the development of digital computer programs that play chess. The work of Shannon, Turing, the Los Alamos group, Bernstein, and the authors is treated in turn. The efforts to program chess provide an indication of current progress in understanding and constructing complex and intelligent mechanisms. 
Programming a computer to play chess
This paper presents an account of the mathematical foundations of the construction of game playing programs and methods of putting them on computers. We give a description of the principles used inExpand
THOUGHTS ON COMPUTER PROGRAMS THAT PLAY CHESS
TLDR
The early chess Playing program borrowed little from what was known of human chess plaYing processes, but produced a gradual movement toward incorporating into the programs some of the selective task-dependent heuristics that humans rely upon in their chess playing. Expand
From MiniMax to Manhattan
TLDR
The technology behind today's chess programs, how it has developed, its current, status, and some directions for the future are looked at. Expand
The Greenblatt chess program
TLDR
The state of the program as of August 1967 is described and some of the details of the heuristics and algorithms employed are given. Expand
COMPUTER CHESS AND SEARCH
Article prepared for the 2nd edition of the ENCYCLOPEDIA OF ARTIFICIAL INTELLIGENCE, S. Shapiro (editor), to be published by John Wiley, 1992.
Computer Chess Compendium
  • D. Levy
  • Computer Science
  • Springer New York
  • 1988
TLDR
This book is aimed at chess players and computer enthusiasts, particularly those with an interest in artifical intelligence, together with the best games by chess computers, including the first five World Microcomputer Championships. Expand
Chess as problem solving: the development of a tactics analyzer.
TLDR
The author considers the fact that chess programs have made almost no gain in strength, as measured on the human scale, in the period 1968 - 1973, as indicative that the popular model of computer chess is near the limits of its exploitability. Expand
Some Necessary Conditions for a Master Chess Program
TLDR
The outline of a model of chess playing that avoids the Horizon Effect and appears extendable to play Master level chess is presented, together with some results already achieved. Expand
Current Chess Programs: A Summary Of Their Potential And Limitations
TLDR
A summary of the major ideas contained in current chess playing programs is presented and suggestions made for the improvement and development of future chess-playing programs. Expand
A Gamut of Games
TLDR
The past successes, current projects, and future research directions for AI using computer games as a research test bed are reviewed. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
A chess playing program for the IBM 704
TLDR
The program which enables a human being to play a game of chess with theIBM 704 computer is described, which is capable of playing a complete game of Chess, including such moves as castling, promoting, and capturing en passant. Expand
Experiments in Chess
TLDR
Some experiments performed on a fast computing machine (M~.nIAC I -Los Alamos) on the coding of computers to play the game of chess are reported on. Expand
Programming a computer for playing chess
This paper is concerned with the problem of constructing a computing routine or “program” for a modern general purpose computer which will enable it to play chess. Although perhaps of no practicalExpand
Empirical explorations of the logic theory machine: a case study in heuristic
TLDR
The Logic Theory Machine is devised to learn how it is possible to solve difficult problems such as proving mathematical theorems, discovering scientific laws from data, playing chess, or understanding the meaning of English prose. Expand
The chess machine: an example of dealing with a complex task by adaptation
  • A. Newell
  • Computer Science
  • AFIPS '55 (Western)
  • 1955
TLDR
The modern general-purpose computer can be characterized as the embodiment of a three-point philosophy: there shall exist a way of computing anything computable, the computer shall be so fast that it does not matter how complicated the way is, and man will be able to discern the way and instruct the computer. Expand
Programming the logic theory machine
A companion paper has discussed a system, called the Logic Theory Machine (LT), that discovers proofs for theorems in symbolic logic in much the same way as a human does. It manipulates symbols, itExpand
A command structure for complex information processing
The general purpose digital computer, by virtue of its large capacity and general-purpose nature, has opened the possibility of research, into the nature of complex mechanisms per se. The challengeExpand
Faster than thought
...
1
2
3
...