Author: Chris Whittington
Date: 09:08:08 11/09/97
Go up one level in this thread
On November 09, 1997 at 11:31:49, Alvaro Polo wrote: >I wonder if a chess program could be made which used two different >strategies in parallel (using two processors). > >On the one processor it would run a very knowledge based algorithm, >something like CSTal appears to be. > >On the other processor it would run a fast and deep searcher. The >tactical lines would be found by this second algorithm and forwarded to >the knowledge based one signaling them as lines to avoid. Except that CSTal often likes the positions resulting from their tactical lines. And they would reject CSTal sacrifice moves as losing material, and pass these forbidden sacrifices back to CSTal - therefore no sacrificial attacks would be generated. Sorry, CSTal doesn't want these horrible materialistic program lines. It wants to build search trees that are non-overlapping with the materialistic programs. then it is a battle of divergent views to see who is right .... Chris Whittington
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.