Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Search question: returning "more"

Author: Russell Reagan

Date: 17:15:53 12/16/02

Go up one level in this thread


On December 16, 2002 at 03:14:17, Tony Werten wrote:

>In XiniX I use a global array, wich is adressed by current depth. (root is zero
>) So when I want to know if fe kingsafety changed, I just compare
>struc[current_depth] with struc[current_depth-1] ( I only need it "backwards")

Let me see if I understand what we have so far. We have a method like Bruce's
example of collecting the principle variation, where the caller passes a pointer
to the recursively called function, and the result copied over if necessary.
Next we have the global array method that you talked about, of which there are
two flavors. First, as you talked about, a kind of history array, which will
work as long as you only need to use data from past plies. Second, you could use
a triangular array like what is often used to store the pv info during the
search. Is that all we have?

Russell



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.