Skip to main content
  • Book
  • © 1988

Algorithms for Games

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-1-4612-3796-9
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (4 chapters)

  1. Front Matter

    Pages i-x
  2. Two-Person Games With Complete Information and the Search of Positions

    • G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy
    Pages 1-32
  3. Heuristic Methods

    • G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy
    Pages 33-76
  4. The Method of Analogy

    • G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy
    Pages 77-143
  5. Algorithms for Games and Probability Theory

    • G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy
    Pages 144-174
  6. Back Matter

    Pages 175-197

About this book

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
  • combinatorics

Authors and Affiliations

  • Institute for Systems Studies, Moscow B-312, USSR

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

Bibliographic Information

  • Book Title: Algorithms for Games

  • Authors: G. M. Adelson-Velsky, V. L. Arlazarov, M. V. Donskoy

  • DOI: https://doi.org/10.1007/978-1-4612-3796-9

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag New York Inc. 1988

  • Softcover ISBN: 978-1-4612-8355-3

  • eBook ISBN: 978-1-4612-3796-9

  • Edition Number: 1

  • Number of Pages: X, 197

  • Additional Information: Title of the original Russian edition: Programmirovanie igr

  • Topics: Discrete Mathematics, Computer Science

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-1-4612-3796-9
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.99
Price excludes VAT (USA)