Algorithms for Games (Paperback, Softcover reprint of the original 1st ed. 1988)

""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.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Release date:	October 2011
First published:	1988
Authors:	Georgy M. Adelson-Velsky
Translators:	Arthur Brown
Authors:	Vladimir L. Arlazarov • M. V Donskoy
Dimensions:	235 x 155 x 11mm (L x W x T)
Format:	Paperback
Pages:	197
Edition:	Softcover reprint of the original 1st ed. 1988
ISBN-13:	978-1-4612-8355-3
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General
LSN:	1-4612-8355-8
Barcode:	9781461283553

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!