Author: Christophe Theron
Date: 16:00:27 10/07/01
Go up one level in this thread
On October 07, 2001 at 18:24:07, Francesco Di Tolla wrote:
>>This goes against the already old urban legend saying that "more knowledged
>>programs" (programs with slower evaluations) will be superior on faster
>>computers (which is clearly denied year after year).
>
>Then why not using a pure "bean counter"? This should beat any program just
>because of the extra fraction of a ply it can reach.
>
>regards
>Franz
I don't understand how you can come to this conclusion using what I said...
I'm not saying that knowledge is useless or that more knowledge cannot beat more
depth, I'm just saying that I believe that there is also dimishing returns from
improved knowledge at deeper ply depths.
Christophe
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.