Algorithms for Games

____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. Front Matter....Pages i-x Two-Person Games With Complete Information and the Search of Positions....Pages 1-32 Heuristic Methods....Pages 33-76 The Method of Analogy....Pages 77-143 Algorithms for Games and Probability Theory....Pages 144-174 Back Matter....Pages 175-197 Contents: Two-Person Games with Complete Information and the Search of Positions Heuristic Methods The Method of Analogy Algorithms for Games and Probability Theory Appendix Summary of Notations References Subject Index.