Author: Inmann Werner
Date: 13:54:52 10/04/98
Go up one level in this thread
On October 04, 1998 at 13:08:51, Guillem Barnolas wrote:
>
>Well, I have some questions.. and I know some of them I've made before, but I
>don't happen to find them with the filters.. I was wondering how the PV stuff
>works, I know R.Hyatt told me that when Best>Alfa it is that I'm in the PV (if
>I'm not wrong) and so then I have to update the PV with that movement and all
>the line that has brought me there, but it doesn't seem to work in my program..
>it shows me a PV and then makes another move.. and the PV doesn't seem very
>coherent.. I don't know what I'm doing wrong.. thanks...
Some C-Code like my program, how i manage the PV. It is only a simple example.
You have to call kopiere_hvar, when ypu want to insert a new PV-move.
typedef struct {
char von; /* from field*/
char nach; /* to field*/
} zug_t;
zug_t HVar[50][50]; /*HVar is the PV*/
kopiere_hvar(int aktzug)
{
int i;
/* insert new move into PV */
HVar[tiefe][tiefe]=STAPEL[aktzug];
/*STAPEL[aktzug] is current move like zug_t*/
for(i=1;;i++)
{
if(HVar[tiefe+1][tiefe+i].von==0)
{
HVar[tiefe][tiefe+i]=HVar[tiefe+1][tiefe+i];
return;
}
HVar[tiefe][tiefe+i]=HVar[tiefe+1][tiefe+i];
}
}
At the end, in HVar[0][i] stands the PV
not to use so, but to think about.
P.S: There are many PVs for each depth, therefore HVar[50][50]. At the end, only
one of them stays alive.
Werner
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.