Algorithms for Games
By: by G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy
Contributors: Arlazarov, V. L.; Donskoy, M. V.
Publisher: Springer New York
Published: 1988
Place of publication: New York, NY
Language: eng
Format: [electronic resource] /
Number of pages: 197
ISBN-13: 9781461283553; 9781461237969
Subjects: Mathematics; Combinatorial analysis; Computer science
Description: 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.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.
Table of contents: title: Contents: Two-Person Games with Complete Information and the Search of Positions; title: Heuristic Methods; title: The Method of Analogy; title: Algorithms for Games and Probability Theory; title: Appendix; title: Summary of Notations; title: References; title: Subject Index.