Author: Uri Blass
Date: 04:13:42 06/25/01
Go up one level in this thread
On June 25, 2001 at 07:00:56, Graham Laight wrote: >On June 25, 2001 at 06:37:19, Uri Blass wrote: > >>On June 25, 2001 at 05:10:46, Graham Laight wrote: >> >>>If Eduard Nemeth can beat Deep Fritz in a G/10, what chance does Fritzy have >>>against Kramnik at full time control - even with extra processors? >>> >>>Answer - not a lot. >> >>1)Deep Fritz can play better at long time control and avoid mistakes that it >>does at blitz. >> >>I remember that adams also believed in the same theory against Junior and chose >>an opening when he beated Junior at blitz. >> >>Unfortunately Deep Junior played better at tournament time control played better >>so adams could not achieve more than a draw. >> >>2)More time should help the computer more than the humans if the programmers are >>good enough because computer never get tired when humans get tired. > > >This is a new experience for me. It is the first time I've read that computers >will do better at tournament time controls than fast time controls. > >That people who know chess computing can credibly say this represents a PARADIGM >SHIFT as far as I'm concerned. I said if the programmers are good enough. I did not say that the programmers of today are good enough. I think that knowledge of pruning illogical lines without changing the evaluation may help to make it truth and in this case the same program may be only twice faster in blitz but 100 times faster at tournament time control. I suspect that by the right ideas the branching factor may get smaller at longer time control because I suspect that sound ideas of pruning illogical lines may become more effective at long time control. 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.