9783528057329 - Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths (Computational Intelligence) de Heinz, Ernst A. (21 resultados)

Condición: very good. Gently used. May include previous owner's signature or bookplate on the front endpaper, sticker on back and/or remainder mark on text block.

Condición: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Condición: Gut. Auflage: 2000. 292 Seiten Exemplar aus einer wissenchaftlichen Bibliothek Sprache: Englisch Gewicht in Gramm: 969 2540005120,0 x 1780543520768,0 x 1,67640335204576E23 cm, Taschenbuch.

Paperback. Condición: new. Paperback. The text presents results of computer-chess research in the areas of selective forward pruning, the efficient application of game-theoretical knowledge, and the behaviour of the search at increasing depths. It shows how to make sophisticated game-tree searchers more scalable at ever higher depths. Throughout the whole book, the 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 evaluations provide convincing empirical evidence for the practical usefulness of the presented techniques. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condición: New. In.

PF. Condición: New.

Condición: New. pp. 292.

Condición: New. 1999. Paperback. . . . . .

paperback. Condición: New. In shrink wrap. Looks like an interesting title!

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Paperback. Condición: Brand New. 2000 edition. 268 pages. 9.50x6.75x0.50 inches. In Stock.

Condición: New. 1999. Paperback. . . . . . Books ship from the US and Ireland.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Condición: Neu. Neuware -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. 292 pp. Englisch.

Paperback. Condición: new. Paperback. The text presents results of computer-chess research in the areas of selective forward pruning, the efficient application of game-theoretical knowledge, and the behaviour of the search at increasing depths. It shows how to make sophisticated game-tree searchers more scalable at ever higher depths. Throughout the whole book, the 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 evaluations provide convincing empirical evidence for the practical usefulness of the presented techniques. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Paperback. Condición: Brand New. 2000 edition. 268 pages. 9.50x6.75x0.50 inches. In Stock. This item is printed on demand.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 270 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Ernst A. Heinz earned his Doktor (Ph.D.) degree with Auszeichnung (summa cum laude) from the University of Karlsruhe, Germany, in July 1999 andjoined the Laboratory for Computer Science at the Massachusetts Institute ofTechnology (M.I.T.), Bo.

Condición: New. Print on Demand pp. 292 66:B&W 7 x 10 in or 254 x 178 mm Perfect Bound on White w/Gloss Lam.

Condición: New. PRINT ON DEMAND pp. 292.

Taschenbuch. Condición: Neu. Scalable Search in Computer Chess | Algorithmic Enhancements and Experiments at High Search Depths | Ernst A. Heinz | Taschenbuch | Einband - flex.(Paperback) | Englisch | 1999 | Vieweg & Teubner | EAN 9783528057329 | Verantwortliche Person für die EU: Vieweg+Teubner Verlag, Abraham-Lincoln-Str. 46, 65189 Wiesbaden, productsafety[at]springernature[dot]com | Anbieter: preigu Print on Demand.