Georgy M. Adelson-Velsky Vladimir L. Arlazarov M. V. Donskoy
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,...
Algorithms for Games aims to provide a concrete example of the programming of a two-person game with complete information, and to demons...