Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Building the Principal Variation in MTD(f) searches

Author: Dave Gomboc

Date: 11:58:00 07/19/99

Go up one level in this thread


On July 18, 1999 at 14:27:58, Dan Andersson wrote:

>Probably one or a few re-searches only, I have not noticed that drawback in my
>project. The problem is to implement lazy evaluation, thus the correlation
>between pawn-values and evaluation as you mentioned.
>I use a alpha-betaized evaluation function (it orders the evaluation factors in
>a binary search and cuts off when it is out of alpha or beta boundaries and

Could you describe this in more detail?

>returns alpha or beta) and save the state of the evaluation function in the hash
>table if the position was not fully evaluated, to continue evaluating later if
>needed. This way I get the benefits of MTD and lazy evaluation. i.e alpa-beta
>evaluation cut evaluation time by 75% and it allows bootsrapping evaluation
>values.

Dave



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.