Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths (Computational Intelligence)
8 Angebote vergleichen
Preise | 2013 | 2015 | 2021 |
---|---|---|---|
Schnitt | € 164,27 | € 101,83 | € 155,22 |
Nachfrage |
1
Scalable Search in Computer Chess (1999)
~EN PB NW
ISBN: 9783528057329 bzw. 3528057327, vermutlich in Englisch, Vieweg & Teubner, Taschenbuch, neu.
Lieferung aus: Schweiz, Versandfertig innert 4 - 7 Werktagen.
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 experimental evalu ations provide convincing empirical evidence for the practical usefulness of the techniques presented by us. These results will certainly be of special interest to researchers and programmers of computer strategy-games alike (chess, checkers, Go, and Othello in particular). Last but not least, I like to mention that I am most grateful to the series editors for offering me the opportunity to publish my book under their auspices. Taschenbuch, 14.12.1999.
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 experimental evalu ations provide convincing empirical evidence for the practical usefulness of the techniques presented by us. These results will certainly be of special interest to researchers and programmers of computer strategy-games alike (chess, checkers, Go, and Othello in particular). Last but not least, I like to mention that I am most grateful to the series editors for offering me the opportunity to publish my book under their auspices. Taschenbuch, 14.12.1999.
2
Scalable Search in Computer Chess
DE NW
ISBN: 9783528057329 bzw. 3528057327, in Deutsch, Vieweg+Teubner, neu.
Lieferung aus: Deutschland, zzgl. Versandkosten, Versandfertig in 2 - 3 Tagen.
Algorithmic Enhancements and Experiments at High Search Depths, 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 experimental evalu ations provide convincing empirical evidence for the practical usefulness of the techniques presented by us. These results will certainly be of special interest to researchers and programmers of computer strategy-games alike (chess, checkers, Go, and Othello in particular). Last but not least, I like to mention that I am most grateful to the series editors for offering me the opportunity to publish my book under their auspices.
Algorithmic Enhancements and Experiments at High Search Depths, 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 experimental evalu ations provide convincing empirical evidence for the practical usefulness of the techniques presented by us. These results will certainly be of special interest to researchers and programmers of computer strategy-games alike (chess, checkers, Go, and Othello in particular). Last but not least, I like to mention that I am most grateful to the series editors for offering me the opportunity to publish my book under their auspices.
3
Symbolbild
Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths (Computational Intelligence) (1999)
DE PB NW
ISBN: 9783528057329 bzw. 3528057327, in Deutsch, Vieweg+Teubner Verlag, Taschenbuch, neu.
Von Händler/Antiquariat, Book Deals [60506629], Lewiston, NY, U.S.A.
Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: This book presents new results of computer-chess research in the areas ofselective forward pruning, the efficient application of game-theoreticalknowledge, and the behaviour of the search at increasing depths. It showshow to make sophisticated game-tree searchers more scalable at ever higherdepths. Throughout the whole book, the high-speed and master-strengthchess program "DarkThought" serves as a realistic test vehicle to conductnumerous experiments at unprecedented search depths. The extensiveexperimental evaluations provide convincing empirical evidence for thepractical usefulness of the presented techniques.
Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: This book presents new results of computer-chess research in the areas ofselective forward pruning, the efficient application of game-theoreticalknowledge, and the behaviour of the search at increasing depths. It showshow to make sophisticated game-tree searchers more scalable at ever higherdepths. Throughout the whole book, the high-speed and master-strengthchess program "DarkThought" serves as a realistic test vehicle to conductnumerous experiments at unprecedented search depths. The extensiveexperimental evaluations provide convincing empirical evidence for thepractical usefulness of the presented techniques.
4
Symbolbild
Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths (Computational Intelligence) (2000)
DE PB NW
ISBN: 9783528057329 bzw. 3528057327, in Deutsch, GWV-Vieweg, Taschenbuch, neu.
Von Händler/Antiquariat, Revaluation Books [2134736], Exeter, United Kingdom.
268 pages. 9.50x6.75x0.50 inches. In Stock.
268 pages. 9.50x6.75x0.50 inches. In Stock.
5
Symbolbild
Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments in High Search Depths (Paperback) (2000)
DE PB NW RP
ISBN: 9783528057329 bzw. 3528057327, in Deutsch, ELSEVIER SCIENCE TECHNOLOGY, United Kingdom, Taschenbuch, neu, Nachdruck.
Lieferung aus: Deutschland, Versandkostenfrei.
Von Händler/Antiquariat, The Book Depository EURO [60485773], Slough, United Kingdom.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Von Händler/Antiquariat, The Book Depository EURO [60485773], Slough, United Kingdom.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
6
Symbolbild
Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths (Computational Intelligence) (1999)
DE PB US
ISBN: 9783528057329 bzw. 3528057327, in Deutsch, Vieweg+Teubner Verlag, Taschenbuch, gebraucht.
Von Händler/Antiquariat, Booked Again [55383221], Summit, NJ, U.S.A.
Like new condition.
Like new condition.
7
Scalable Search in Computer Chess
DE NW EB
ISBN: 9783322901781 bzw. 3322901785, in Deutsch, Springer Nature, neu, E-Book.
Lieferung aus: Vereinigte Staaten von Amerika, Lagernd.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
8
Scalable Search in Computer Chess : Algorithmic Enhancements and Experiments at High Search Depths
DE NW EB DL
ISBN: 9783322901781 bzw. 3322901785, in Deutsch, Springer Berlin Heidelberg, neu, E-Book, elektronischer Download.
Lieferung aus: Vereinigtes Königreich Großbritannien und Nordirland, Despatched same working day before 3pm.
Lade…