Author: Bob Durrett
Date: 16:49:43 11/11/03
Go up one level in this thread
On November 11, 2003 at 02:38:40, Uri Blass wrote: >On November 11, 2003 at 02:31:40, Drexel,Michael wrote: > ><snipped> >>The idea Nf5 is nothing special. >>However even if you find that idea in a blitz game you usually would lose much >>more time. You have to check whether white has any tactical options on the >>a1-h8 diagonal or not. >>You might also think about what happens if white simply retreats his bishop to >>f2. >>3 seconds for that move is pretty fast. >> >>It is not a clear evidence of cheating however. >> >>Michael > >It is possible that the 3 seconds is not the full story and the player already >started to think about it when it was the opponent move. > >How much time the opponent used to calculat his previous move? > >Uri Regardless of the answer in this specific case, Uri brings up an excellent point: Repeatability of moves, will depend to some extent on the CONTENTS of the hash table, assuming the game is out of the opening book and not yet into tablebases. The contents of the hash tables will depend on the history of the game. Times taken for each move leading up to a position must all be considered because some of the material stored in the hash tables may have originated several or many moves back. [This presumes that my idea about hash tables is consistent with the way hash tables are actually used in practice.] Bob D.
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.