株式会社極東書店トップ ＞ 商品一覧 ＞ Algorithms for Games. Softcover reprint of the original 1st ed. 1988.
商品詳細
Algorithms for Games. Softcover reprint of the original 1st ed. 1988.
・ISBN 978-1-4612-8355-3 paper EUR 49.99
￥13,361.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Adelson-Velsky, Georgy M. / Arlazarov, Vladimir L. / Donskoy, M.V., |
|---|---|
| 出版社 | (Springer-Verlag New York Inc., US) |
| 出版年月 | 2011 |
| ページ数 | 197 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-18094＞ |
解説
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.