Author: Christophe Theron
Date: 17:52:36 10/05/01
Go up one level in this thread
On October 05, 2001 at 15:21:15, Francesco Di Tolla wrote:
>
>>
>>What's wrong is that if search tends to be less effective with increasing speed,
>>actually "knowledge" (probably meaning "evaluation" in your mind) has exactly
>>the same problem.
>>
>>In chess, Search <=> Knowledge
>>
>>I believe in dimishing returns from improved search, and I also believe in
>>dimishing returns from improved knowledge ("improved evaluation").
>
>I don't see why:
>when you reach any given depth a better evaluatinon function remains a better
>evaluations function.
>
>Of course a deeper search is always welcome, but due to nonlinear-growth of the
>number of nodes to be searched a faster hardwer grants less gain comparatively,
>while better undestanding remains more or less etter understanding, since the
>evaluation function has a more or less constant wieght at any level of ply.
>
>This is pure speculation of mine of course
>regards
>Franz
You could say the same for every additional ply depth: a ply is a ply, a piece
of knowledge is a piece of knowledge.
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.
So if there is dimishing returns from deeper searches, there is dimishing
returns from better knowledge.
And this is also pure speculation of mine, but there are some facts to back up
this.
Christophe
This page took 0.01 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.