Algorithms for Games (1988)
By: and and
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 1988
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9781461237969
- Related ISBNs:
- 9780387966298
- Publisher:
- Springer New York
- Date of Addition:
- 02/23/21
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
- Translator:
- Arthur Brown
Reviews
Other Books
- by Georgy M. Adelson-Velsky
- by Vladimir L. Arlazarov
- by M.V. Donskoy
- in Nonfiction
- in Computers and Internet
- in Mathematics and Statistics