Author: Dann Corbit
Date: 11:17:37 10/11/00
Go up one level in this thread
On October 11, 2000 at 10:58:19, Severi Salminen wrote: >Hi! > >Please suggest me a book about computer chess basics. I would like this book to >cover: different search methods (AB, Negascout, PVS...), different position >representation models (especially bitboards...), move ordering methods (history >heuristics and killers) basic null move search , basic evaluation terms and >hashtable implementation. I have Computer Chess Compendium, but I it only a >collection of articles and it doesn't have "everything" covered. I have also >read Heinz's book but it does not cover these elementary basics. I think Ernst Heinz's book "Scalable Search in Computer Chess" is probably the best thing that there is. He does not contrast with lots of other techniques, but rather focuses on the reasons for each of the decisions that he made. In any case, it is well written and an excellent explanation of many computer chess algorithms and techniques. Besides that book there is very little available in the form of a published technical book. Most everything else is a postscript document, but you can get those free on the internet.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.