Author: blass uri
Date: 09:17:57 07/18/00
Go up one level in this thread
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. Uri
This page took 0.01 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.