Author: Robert Hyatt
Date: 21:05:22 08/24/02
Go up one level in this thread
On August 24, 2002 at 16:16:23, Patrik wrote:
>Hello, Dr. Hyatt.
>
>It is hard to understand how Crafty updates PV.
>
>value = -Search(-beta, -alpha);
>if (value > alpha) {
> ..........
> UpdatePV();
>}
>
>Most programs update PV like above code. It is easy to understand.
>But Crafty updates PV ouside of for loop.
>I think you did this for efficiency.
>But I don't know how Crafty saves(remembers) best move.
>I don't know what happens at terminal node.
>Coud you explain?
>
>Thank you.
You really only update the PV when the search finds a new best move, which
means the case where best_score>alpha and best_score<beta... You won't be
able to do that _inside_ the loop because you won't know the best move until
you _finish_ searching them all...
I simply back up a PV everytime I back up a "best score"...
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.