(Volume I).- 1 Backgammon.- 1.1. BKG-A Program That Plays Backgammon.- 1.2. Backgammon Computer Program Beats World Champion.- 1.3. End Positions in Backgammon.- 1.4. Optimal Doubling in Backgammon.- 1.5. On Optimal Doubling in Backgammon.- 2 Chess.- 2.1. A Chess-Playing Machine.- 2.2. Chess-Playing Programs and the Problem of Complexity.- 2.3. Before the Jet Age.- 2.4. Recent Progress in Computer Chess.- 2.5. Master Level and Beyond.- 2.6. Experiences Gained in Constructing and Testing a Chess Program.- 2.7. Creating a Chess Player.- 3 Checkers (Draughts).- 3.1. Logical or Nonmathematical Programs.- 3.2. Some Studies in Machine Learning Using the Game of Checkers. I.- 3.3. Some Studies in Machine Learning Using the Game of Checkers. II-Recent Progress.- 4 Scrabble.- 4.1. A Scrabble Crossword Game-Playing Program.
Computer Games I is the first volume in a two part compendium of papers covering the most important material available on the development of computer strategy games. These selections range from discussions of mathematical analyses of games, to more qualitative concerns of whether a computer game should follow human thought processes rather than a "brute force" approach, to papers which will benefit readers trying to program their own games. Contributions include selections from the major players in the development of computer games: Claude Shannon whose work still forms the foundation of most contemporary chess programs, Edward O. Thorpe whose invention of the card counting method caused Las Vegas casinos to change their blackjack rules, and Hans Berliner whose work has been fundamental to the development of backgammon and chess games.
Springer Book Archives