Algorithms for Games

  • G. M. Adelson-Velsky
  • V. L. Arlazarov
  • M. V. Donskoy

Table of contents

  1. Front Matter
    Pages i-x
  2. G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy
    Pages 1-32
  3. G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy
    Pages 33-76
  4. G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy
    Pages 77-143
  5. G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy
    Pages 144-174
  6. Back Matter
    Pages 175-197

About this book

Introduction

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.

Keywords

DEX algorithms chess form game programming games information knowledge probability probability theory programming

Authors and affiliations

  • G. M. Adelson-Velsky
    • 1
  • V. L. Arlazarov
    • 1
  • M. V. Donskoy
    • 1
  1. 1.Institute for Systems StudiesMoscow B-312USSR

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4612-3796-9
  • Copyright Information Springer-Verlag New York 1988
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-8355-3
  • Online ISBN 978-1-4612-3796-9
  • About this book