FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Algorithms for Games

Algorithms for Games

Georgy M. Adelson-Velsky
    Product form
      FORMAT: Paperback / softback

      R 1,541.80 Price and availability exclusive to website

      YOU COULD EARN 1,541.80 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 256.96 per month!
      3x monthly payments of R 513.93 with
      4x fortnightly payments of R 385.45 with
      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.
      Format: Paperback / softback CONTRIBUTORS: Georgy M. Adelson-Velsky EAN: 9781461283553 COUNTRY: United States PAGES: WEIGHT: 330 g HEIGHT: 235 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 2011-10-08 CITY: GENRE: COMPUTERS / Computer Science, MATHEMATICS / Combinatorics WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Computer science

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      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.
      Format: Paperback / softback CONTRIBUTORS: Georgy M. Adelson-Velsky EAN: 9781461283553 COUNTRY: United States PAGES: WEIGHT: 330 g HEIGHT: 235 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 2011-10-08 CITY: GENRE: COMPUTERS / Computer Science, MATHEMATICS / Combinatorics WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Computer science

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account