| 书目名称 | Scalable Search in Computer Chess |
| 副标题 | Algorithmic Enhancem |
| 编辑 | Ernst A. Heinz |
| 视频video | |
| 概述 | Anspruchsvolle und brandneue Forschungsergebnisse des Computer-Schach. |
| 丛书名称 | Computational Intelligence |
| 图书封面 |  |
| 描述 | This book presents the results of our past two-and-a-half years of research aimed at increasing the scalability and performance of game-tree search in computer chess. We elaborate on our respective works in the areas of (I) selective forward pruning, (II) the efficient application of game-theoretical knowledge, and (III) the behaviour of the search at increasing depths. The broad range of topics covered by the three distinct parts of the book seek to provide interesting material for everybody interested in the field of "Compu tational Intelligence", regardless of their individual focus (researcher, student, or other). The text does not require readers to know about chess and computer game-playing beforehand. The initial chapter entitled "Computer-Chess Primer" introduces all the necessary basics and fundamentals thereof. The remaining chapters, however, go far beyond those topics. They show how to make sophisticated game-tree searchers still more scalable at ever higher depths. Throughout the whole book, our high-speed and master-strength chess program DARKTHOUGHT serves as a realistic test vehicle to conduct numerous experiments at unprecedented search depths. The extensive exper |
| 出版日期 | Book 2000 |
| 关键词 | Computational Intelligence; Computer Chess; DarkThought; Pruning; Scalability; Search; Search Behaviour; al |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-322-90178-1 |
| isbn_softcover | 978-3-528-05732-9 |
| isbn_ebook | 978-3-322-90178-1Series ISSN 2522-0519 Series E-ISSN 2522-0527 |
| issn_series | 2522-0519 |
| copyright | Springer Fachmedien Wiesbaden 2000 |
发表于 2025-3-21 16:19:31
