Author: blass uri
Date: 05:26:41 11/16/99
Go up one level in this thread
On November 15, 1999 at 14:40:28, Ratko V Tomic wrote: <snipped> >While the net strength of program may increase, the D+1 ply program will still >lose about 20% of time to the otherwise identical D ply program. That is a clear >demonstration not only of the existence of some phenomena (or mechanisms or >causes) which act negatively on the strength of the program with increasing >depth, but also that the magnitude of their effects may be large enough to >overcome, and not infrequently so, the effects of all the positive phenomena of >the increased depth. Otherwise, if the net effect of the increased depth, when >all pluses and minuses are tallied, is exclusively positive, the D ply program >would never win against D+1 ply program. I do not agree because of 2 reasons: 1)The D ply can win the D+1 ply because of the opening book and in this case if you change the colours with the same opening the D+1 ply program is going to win. 2)It is possible that the D+1 ply get a position that it does not understand and both side evaluate it as better for the D+1 ply but it is not. It can happen also in a game between humans when one human does a move that (s)he a considers as a tactical mistake after the opponent's move and only some moves after it both sides discover that the move was winning. 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.