Author: Uri Blass
Date: 03:37:19 06/25/01
Go up one level in this thread
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. 3)The Deep Fritz that plays against kramnik is not the same program that played against Nemeth but a better program. Kramnik is not going to have the right to play against it a lot of games to find weaknesses and is only going to get printout of games of this program based on interview with him. I expect kramnik to win the match but the games of nemeth prove nothing because these games are not against the same Fritz that plays kramnik. A surprise is possible and maybe the programmer of Fritz is going to surprise us by a significant improvement. The surprise that I think about is sound pruning algorithm that is going to do the program 100 times faster at tournament time control. Sound pruning algorithm means that the program always get the same main line at the same depth like the previous program but need less nodes and less time to do it. 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.