Algorithms for Games

1. Front Matter

   Pages i-x

   PDF

2. Two-Person Games With Complete Information and the Search of Positions

   • G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy

   Pages 1-32

3. Heuristic Methods

   • G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy

   Pages 33-76

4. The Method of Analogy

   • G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy

   Pages 77-143

5. Algorithms for Games and Probability Theory

   • G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy

   Pages 144-174

6. Back Matter

   Pages 175-197

   PDF

Algorithms for Games aims to provide a concrete example of the programming of a two-person game with complete information, and to demonstrate some of the methods of solutions; to show the reader that it is profitable not to fear a search, but rather to undertake it in a rational fashion, make a proper estimate of the dimensions of the "catastrophe", and use all suitable means to keep it down to a reasonable size. The book is dedicated to the study of methods for limiting the extent of a search. The game programming problem is very well suited to the study of the search problem, and in general for multi-step solution processes. With this in mind, the book focuses on the programming of games as the best means of developing the ideas and methods presented. While many of the examples are related to chess, only an elementary knowledge of the game is needed.

• DEX
• algorithms
• chess
• form
• game programming
• games
• information
• knowledge
• probability
• probability theory
• programming
• combinatorics

• Institute for Systems Studies, Moscow B-312, USSR

  G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy

Policies and ethics