Author: Francesco Di Tolla
Date: 15:10:07 10/07/01
Go up one level in this thread
On October 05, 2001 at 20:52:36, Christophe Theron wrote: >You could say the same for every additional ply depth: a ply is a ply, a piece >of knowledge is a piece of knowledge. An so what? The point is that the piece of extra knowledge remains there, the extra plys are reduced! That's the whole point. >I believe there is a strict equivalence between search and knowledge. They are >the same thing. Like energy and matter are the same thing in modern physics. The comparison has nothing to do (you're talking to a theoretichal physicist). >So if there is dimishing returns from deeper searches, there is dimishing >returns from better knowledge. I don't see way. I see clearly that the difference in depth between two programs reduces increasing the speed (due to the nonlinear growth of the number of nodes). On the other side I see no reason for what you imply: that understanding coming from a better evaluation fades as you increase the total search time. Imagine that one program recognizes a given pattern, or knows that, say, with a given structure you can't win any more; while the other program lacks such a knovledge. Well this difference in chess understanding will not disappear when you increase the depth for both. regards Franz
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.