Author: Johan de Koning
Date: 19:28:10 08/18/03
Go up one level in this thread
On August 17, 2003 at 10:10:24, Sune Fischer wrote: >On August 16, 2003 at 02:28:30, Johan de Koning wrote: > >>>Clearing TTs makes the engine, IMO, significantly weaker at short time controls. >>>It is simply too expensive to throw away the little information the engine has >>>collected, and the fraction of a second the clearing itself takes is no small >>>handicap (guess there are tricks to speed this up? :). >> >>Time control is not an issue here since. > >How so? It seems I forgot 6 backspaces. :-) I should have better replaced the entire line with: Why do you emphasize short time controls? As GCP allready replied, clearing needn't take time. Eg a 1-bit age count in each entry will do the job. Also the nature of the search is the same for both bullet and correspondence time controls. The one thing I can think of is that with short time control and large TT there will be very few overwrites. [...] >I have come to learn, that chess is really a game of chance, everything being >horizon limited makes it all pretty random anyhow. Certainly. Or if you like: I agree chess is very likely a game of chance. > Maybe pridictability is even >a bad thing here, it disrupts the natural laws of statistics, making it possibly >even harder to test. I think now you're stretching it. :-) ... Johan
This page took 0.01 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.