Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: PV History question

Author: Inmann Werner

Date: 03:41:05 10/15/99

Go up one level in this thread


On October 14, 1999 at 19:52:29, Nicolas Carrasco wrote:

>Dear Guys,
>
>I have been working in order to make a search results description as for example
>to see like:
>
>I moved e2-e4 because of: 1.e2-e4 1..e7-e6 2.g1-f3 2..b8-c6 ..............
>
>But I have tried how to put "PV[0].b[ply]= move[ply].b[i];" on the correct place
>but falied.
>
>Note: "0" is a constant. I made an array of PV[50] for Iterative deepening.
>


you need something like PV[50][50].
here is some simple source , how to stuff the PV into the array.
it is only a example, but working.

move_t HVar[50][50]  is the PV array structure
tiefe means depth
STAPEL[aktzug] is the last made move.

at the befinning of alpha_beta......

HVar[tiefe][tiefe].von=0;

---------
if a PV move is found.....

kopiere_hvar(int aktzug)
{
	int i;
	/* Neue Hauptvariante ist Fortsetzung dieser Variante */
	HVar[tiefe][tiefe]=STAPEL[aktzug];
	for(i=1;i<45;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];
	}
}

Greetings

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.