Author: Peter Fendrich
Date: 01:57:02 09/18/03
Go up one level in this thread
On September 18, 2003 at 04:18:35, Steven Edwards wrote: >The programs Kaissa, Caps, and Paradise all had a causality facility. Such a >feature is used for forward pruning in a manner suggestive of the human move >selection process. The basic idea is: > >Given a subtree search of a position P with move M1 from P, the causality >facility produces a causal data structure that contains the various constraints >on the position and the move that allow the evaluation returned from the >subsearch to be valid. Forward pruning is achieved when a move M2, a sibling of >M1, can be applied to the causal data structure with the result that M2 doesn't >violate any of the constraints and so doesn't need to be searched. > >It's not an easy problem, and some solutions may require more resources to >calculate and probe the causal data than to do the unpruned search. > >Are there any current programs that have a causality facility? Maybe I'm stupid or is it a language problem but I don't get much of what you saying. During the search of M1 the program collects some values=constraints and builds up a causal data strucuture. That structure is used during the search of M2-Mx (siblings of M1). Right? What kind of constraint values could that be? How does that form a data structure? Do you have some example values... Regards, Peter
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.