<電子ブック>
Algorithms for Games / by Georgy M. Adelson-Velsky, Vladimir L. Arlazarov, M.V. Donskoy
版 | 1st ed. 1988. |
---|---|
出版者 | (New York, NY : Springer New York : Imprint: Springer) |
出版年 | 1988 |
本文言語 | 英語 |
大きさ | X, 197 p : online resource |
著者標目 | *Adelson-Velsky, Georgy M author Arlazarov, Vladimir L author Donskoy, M.V author SpringerLink (Online service) |
件 名 | LCSH:Discrete mathematics LCSH:Computer science FREE:Discrete Mathematics FREE:Computer Science |
一般注記 | 1 Two-Person Games with Complete Information and the Search of Positions -- 2 Heuristic Methods -- 3 The Method of Analogy -- 4 Algorithms for Games and Probability Theory -- Summary of Notations -- References 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 HTTP:URL=https://doi.org/10.1007/978-1-4612-3796-9 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9781461237969 |
|
電子リソース |
|
EB00227291 |
類似資料
この資料の利用統計
このページへのアクセス回数:2回
※2017年9月4日以降