Algorithms for Games

Georgy M. Adelson-Velsky, Vladimir L. Arlazarov, M. V. Donskoy (Autoren)

Buch | Hardcover

207 Seiten

1987
Springer-Verlag New York Inc.
978-0-387-96629-8 (ISBN)

Titel ist leider vergriffen;
keine Neuauflage

Artikel merken

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.

1 Two-Person Games with Complete Information and the Search of Positions.- 2 Heuristic Methods.- 3 The Method of Analogy.- 4 Algorithms for Games and Probability Theory.- Summary of Notations.- References.

Übersetzer	Arthur Brown
Verlagsort	New York, NY
Sprache	englisch
Gewicht	460 g
Einbandart	gebunden
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
	Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik
	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
ISBN-10	0-387-96629-3 / 0387966293
ISBN-13	978-0-387-96629-8 / 9780387966298
Zustand	Neuware