Author: Robert Hyatt
Date: 06:58:52 10/23/01
Go up one level in this thread
On October 23, 2001 at 08:56:18, Gordon Rattray wrote: >Suppose that during the analysis of a position, a chess engine shows evaluations >similar to this: > >depth 7: Qe1 eval: 0.58 >depth 8: Qe1 eval: 0.42 >depth 9: Qe1 eval: 0.39 >depth 10: Qe1 eval: 0.33 > >i.e. as the depth increases, the move choice stays the same, and the evaluation >is slowly but consistently decreasing. > >I release that in general the next evaluation could be anything, but I am right >in thinking that the probability of it decreasing further is higher than normal? > Or to take it to extremes, I think the above is more likely to decrease further >than the following: > >depth 7: Qe1 eval: 0.33 >depth 8: Qe1 eval: 0.39 >depth 9: Qe1 eval: 0.42 >depth 10: Qe1 eval: 0.58 > >Did each line involve a "fail low"? Or am I getting my terms mixed up? > >Do chess programs take account of the above and, e.g., are more likely to search >further before moving? > >Gordon That generally suggests that there is a horizon-effect happening, and that eventually the best move will be bad enough that a new best move will be found. But searchng until you find it is not possible in a timed game, for obvious reasons...
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.