Author: Severi Salminen
Date: 13:09:06 02/09/01
Go up one level in this thread
>As a beginner in chess engine programming, I study the book "Scalable Search in >Computer Chess" and other downloadable articles about the basic search >techniques: minimax, negamax, and alpha-beta pruning. Unfortunately, I do not >understand them, because they are not crystal-clear. In other words, I have a >hard time figuring out how the basic search techniques work and how to apply >them to chess engine programs. I am a bit surprised to see that the basic search >techniques are difficult. Moreover, any book teaching a beginning chess >programming does not exist nowadays. > >What can I do exactly in order to understand them very clearly please? First of all Heinz's book is not for beginners. It describes basic searching methods but not clear enought that an average beginner might understand them. You could try David Levy's Computer Chess Handbook (if I recall correctly). It is much clearer and more detailed - allthough it does not cover more sophisticated methods (bitboards, etc.). Secondly, what is it that you don't understand? Say what you _do_ understand and I'll try to tell more. Thirdly, visit at http://www.chessopolis.com/cchess.htm There you'll find many good and easy to understand sites describing basic search techniques. Remember to take time. First try to understand minimax only - nothing more. When you understand how and why minimax works you'll understand all other methods easier. Read 10 times if necessary, draw a picture and don't go on if you didn't understand something. Severi
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.