0
Your cart

Your cart is empty

Books > Computing & IT > Applications of computing > Databases > Data capture & analysis

Buy Now

Scalable Search in Computer Chess - Algorithmic Enhancements and Experiments at High Search Depths (Paperback) Loot Price: R2,934
Discovery Miles 29 340
Scalable Search in Computer Chess - Algorithmic Enhancements and Experiments at High Search Depths (Paperback): Ernst A. Heinz

Scalable Search in Computer Chess - Algorithmic Enhancements and Experiments at High Search Depths (Paperback)

Ernst A. Heinz

 (sign in to rate)
Loot Price R2,934 Discovery Miles 29 340 | Repayment Terms: R275 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

The book presents new results of computer-chess research in the areas of selective forward pruning, the efficient application of game-theoretical knowledge, and the behavior 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.

General

Imprint: Academic Press Inc
Country of origin: United Kingdom
Release date: April 2000
Authors: Ernst A. Heinz
Dimensions: 241 x 170 x 15mm (L x W x T)
Format: Paperback
Pages: 268
ISBN-13: 978-3-528-05732-9
Categories: Books > Computing & IT > Applications of computing > Databases > Data capture & analysis
Books > Sport & Leisure > Hobbies, quizzes & games > Indoor games > Board games > Chess
Promotions
LSN: 3-528-05732-7
Barcode: 9783528057329

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners