Archive for August, 2005

Scalable Search in Computer Chess

Monday, August 29th, 2005

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

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. Read the rest of this entry »

Advances in Computer Chess 5

Thursday, August 25th, 2005

Read the rest of this entry »

Advances in Computer Chess 4

Thursday, August 25th, 2005


Proceedings of the International Conference, Brunel University, UK, 1984. Read the rest of this entry »