Author: Uri Blass
Date: 13:07:45 09/12/01
Go up one level in this thread
On September 12, 2001 at 15:03:38, Robert Hyatt wrote: >On September 12, 2001 at 13:30:13, Uri Blass wrote: > >> >>Deeper search also shows 0.00 score. > >All that is required for a draw score is for one side to believe it is >better and the other side finds a way to force the score to 0.00 or worse, >so that the side that is better will choose 0.00 over -0.01 for example > >If the evaluation is not stable, this doesn't mean a thing. > > >> >>It does not change the fact that when all the moves except 6 are singular the >>reduced depth is not more than 6 plies. > > >Your definition of "singular" is meaningless. What is important is what the >_program_ thinks is singluar based on the search it does to make that >determination. Moves that appear to be singular to a human might not be >singular to a search, and vice-versa. My definition of singular is based on search of chess programs. If chess programs can see big difference between the evaluation of the best move and the second best move in a short time then I define the move as singular. > > > >> >>I do not care if they extend 1 ply for every singular move or 2 plies for one of >>them and 0 plies for consecutive move. >> >> But your analysis of a forced draw, based on a >>>0.00 score by a computer, is flawed. Try other programs in the same position >>>and see if _all_ of them say 0.00... >> >>I checked both shredder and Junior and they say 0.00 after a short time >> >>Uri > > >Perhaps they _misunderstand_ the position just as my program obviously does. I think that your program understands the position better than Deeper blue. It is more logical to assume that Deeper blue is wrong and not that all the top programs are wrong. >You aren't going to find any program that can do an exhaustive proof that the >position is a forced draw no matter what white does. I agree but not because of a long lines with checks but because of the fact that there is a line when white keeps equality in material and you cannot prove repetition in that line. Forced draw cannot be proved by programs in the root position but 0.xx evaluation that is smaller than 0.5 pawns for white can be proved. 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.