Scalable Search in Computer Chess : Algorithmic Enhancements and Experiments at High Search Depths PDF

by Ernst A. Heinz

Part of the Computational Intelligence series

PDF

Download - Immediately Available

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

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.