Computer Chess Club Archives

Search

Terms

Messages

Subject: Understanding Basic Search Techniques is Hard! Please Help.

Author: Eran

Date: 08:29:52 02/09/01


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.

Thank you,
Eran

Re: Understanding Basic Search Techniques is Hard! Please Help. Ernst A. Heinz 14:18:37 02/10/01
Re: Understanding Basic Search Techniques is Hard! Please Help. Ricardo Gibert 15:22:23 02/09/01
- Re: Understanding Basic Search Techniques is Hard! Please Help. Jon Dart 11:16:51 02/10/01
Re: Understanding Basic Search Techniques is Hard! Please Help. Severi Salminen 13:09:06 02/09/01
- Thank you very much for your help :-) I will try . . . . (NT) Eran 01:25:37 02/10/01

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.