Author: blass uri
Date: 09:08:49 07/19/00
Go up one level in this thread
On July 19, 2000 at 10:54:08, Steffen Jakob wrote: >On July 18, 2000 at 12:17:57, blass uri wrote: > >>On July 18, 2000 at 12:10:57, stuart taylor wrote: >> >>>Let me clarify. Of course computers always look for the best move in attack, and >>>also play the move they evaluate as as best. But when they see the evaluation >>>going down, they will look perhaps a whole extra ply deeper in search of finding >>>a way to bring the evaluation back up again. >>> But if they see their evaluation going up, they do that move, sometimes very >>>quickly, atleast they don't grind away labouriously trying to find something >>>even better, even if the first "good move" is not all that good relatively. >> >>My knowledge is that Junior almost always finish the iteration of moves. >> >>If it see the evaluation goes up it will usually not play without checking all >>the other moves in the same iteration. > >This doesnt make sense because the other moves of the same depth only can make >the score better. It makes sense to go at least one ply deeper, which I do in >Hossa to avoid traps. I do not think that tactical traps when the score of programs goes up only to go later down are common in chess. It make more sense to use more time when the score is positive and goes down because this shows that the program starts to smell a tactical trap but this may be a good idea only when there are many moves to the time control. calculating 20 minutes in move 15 when the program has almost 2 hours/40 moves and the score goes down may be logical but doing it later is risky because you can get into a serious time trouble. Uri
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.