Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Alpha/Beta algorithm

Author: Steve Coladonato

Date: 11:43:56 05/04/00

Go up one level in this thread


On May 04, 2000 at 13:57:27, Dan Andersson wrote:

>No you are looking at he same depth, but the time spent disproving the move will
>be less as you know the bounds the value cannot exceed w.o causing cutoff. Go
>and read about AB somewhere and you will understand. Look at the programming
>links.

Dan,

I found this site and will try and digest some stuff from here before pursuing
this further.

http://www.xs4all.nl/~verhelst/chess/programming.html

Thanks to all for their input.

Steve



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.