Author: Sune Fischer
Date: 13:59:48 10/27/02
Go up one level in this thread
On October 27, 2002 at 15:46:07, Uri Blass wrote: > >My definition of 1 ply error is an error that computer can see a big change in >the score based on a search of one ply. Are you kidding. That sacrifice was very deep, he calculated for 45 minutes. What a computer thinks at 1 ply is irrelevant, it can't possibly have seen a fraction of the considerations Kramnik did. >The mitsake of kramnik in game 5 was 1 ply error because after the mistakes >programs can see in 1 ply that kramnik is losing a piece(they search the first >move check and extend after the moves because they extend checks and after it >they go to qsearch but it is enough for them to see that kramnik is losing a >piece. I might agree with you if you include regular qsearch on top of that 1 ply, but if they do extensions at 1 ply and actually find the refutation only at 10 plies deep, then it's of course a 10 ply error. The iteration counter is just an arbitrary number in that context. >The mistake of kramnik in game 6 is also 1 ply error because programs can see >big change in the score based on search of 1 ply. >I do not agree that the refutation is more than 1 ply. >Programs usually evaluate from the first ply that the sacrifice is wrong. > >Playing sacrifices for the beauty and not because they are correct is a mistake >of weak players and not of players at the level of kramnik. I don't think so, chess is art and chess players have different styles. As the saying goes: "when you have found a good move, look for a better one". Clearly Kramnik wanted to play the beautiful sacrifice, but be also wanted to be sure it was correct, hence the 45 minutes of thinking. He must have miscalculated, that's all (I don't conspire to him losing on purpose). If his opponent had been a human, things might have been different :) -S. >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.