Author: Dann Corbit
Date: 10:34:25 12/15/99
Go up one level in this thread
On December 15, 1999 at 07:54:33, Amir Ban wrote: [snip] >All true. Ok, so rephrase the question: For programs that scale the same way, >how does time control affect their relative strengths ? I think if (and only if) programs use algorithms that are of the exact same O(f(n)) then they will hit the wall together. On the other hand, if the dominant part of some program is O(exp(n)) and another is O(n!) then the more optimal program must dominate at some time control. So, if the fundamental algorithms are identical, they will pretty much level out, but if not, one program will dominate. >Unlike Christophe, I think they will keep the same margin, but I can't find a >good argument to justify this. James Walker made a good argument, that if move ordering is ideal, you keep approximately the same advantage. >There were some who thought there is "tactical sufficiency" at some depth, which >means that any advantage based on extra depth will vanish at some time control. >I don't believe in it. I think there were some studies done to refute that. I think the "... Goes Deep" studies by Hyatt and Heinz prove your assertion. In fact, it is pretty obvious that if you can think exactly 7 moves ahead at all times and your opponent can think exactly 6 moves ahead you have a clear advantage. Why would this change for *any* ply count? Obviously -- it won't. As long as you can see farther, you will win more than one who sees less. [snip]
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.