Author: Ernst A. Heinz
Date: 14:18:37 02/10/01
Go up one level in this thread
Hi Eran, >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? > >I would appreciate your help. Basic search techniques such as plain minimax and alpha-beta are usually covered in introductory textbooks on Artificial Intelligence. Hopefully, the highly condensed "Computer-Chess Primer" chapter of my book will make sense to you afterwards. The chapter deals with the basic search techniques on an intentionally "aloft" level of abstraction. Good luck and please continue to enjoy your explorations in adversarial search and computer chess! =Ernst=
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.