Author: Roy Eassa
Date: 10:57:56 04/29/02
Go up one level in this thread
On April 29, 2002 at 13:49:15, Sune Fischer wrote: >On April 29, 2002 at 13:30:54, Roy Eassa wrote: > >>On April 29, 2002 at 13:15:52, Sune Fischer wrote: >> >>>for all we know, program X might do better against Y in fast games and >>>vice versa in slow games, so it probably doesn't show us that much anyway. >>> >> >> >>Has there ever been a case where program X consistently beats program Y at one >>time control and program Y consistently beats program X at a different time >>control? (Assuming, of course, that everything is else like CPU is kept the >>same.) I know it could happen in theory, but has it ever happened in practice? > >There is a commen belief that fast searchers will do better on short time >controls, and those with more heavy eval will do better in slow. >I have no idea if it is true, but there is a balance between branchfactor and >nodes per second, so isn't impossible. > >-S. I definitely don't rule out the possibility. I was just wondering if there was ever a single documented case.
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.