Author: Howard Exner
Date: 16:19:36 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. The communication between the two programs would be critical. Would the deeper searcher veto the knowledge based program as to what moves to avoid or would the knowledge based one decide instead? Programmers must wrestle with this trade off of depth vs. knowledge as they constantly tweak their engines. Humans are taught generally, at least according to teachers like Kotov, to employ knowledge and strategy during the opponents move. Calculations are then largely done on your own clock time. This of course is difficult for humans to do as in certain chess positions the knowledgeable thing to do is to discard strategy altogether and simply calculate. Ideally knowledge should compliment calculation. Here's a simple endgame example. 8/1Q5n/8/8/8/2p5/7K/2k5 w - - id"end04 - Not Qxh7";bm K to g file; In this position my old CM4000 program contains the knowledge that Qxh7 is bad as it was programmed to recognize this elementary draw of the advanced bishop pawn. A newer program like Rebel 8 evals Qxh7 as +6 but now on a K6-200 will choose the winning K move to the g file at around the 4 minute mark. So knowledge is definitely a big time saver here.
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.