Algorithms for games.

From MaRDI portal





This book 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 solution based on the search techniqu. The book is divided into four chapters. In Chapter 1, the branch-and- bound method is developed. Here primary attention is given to the theoretical foundation of the method and to an estimate of the minimum size of the search required for its solution. Chapter 2 is devoted to heuristic methods for choosing a move in a contemplated position and a probabilistic approach is employed in establishing these methods. The theory of analytical reasoning as a basis for decision-making is developed in Chapter 3. Chapter 4 deals with the recently developed probabilistic approach to the programming of games and contains many new results. The subject matter is cohesive, well presented and there is a natural smoothness throughout the book. The book may be of interest since it deals with the ideas basic to the problems of search rather than with specific programs and programming techniques. However, an interested reader needs an elementary knowledges of the game of chess, since the examples presented are often related to chess.











This page was built for publication: Algorithms for games.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3994348)