Computer Chess Club Archives




Subject: Re: Thanks for extracting this!

Author: Alessandro Damiani

Date: 02:24:30 01/01/06

Go up one level in this thread

On January 01, 2006 at 02:36:28, Uri Blass wrote:

>On December 31, 2005 at 20:50:30, Vincent Diepeveen wrote:
>>On December 31, 2005 at 20:20:47, Greg Simpson wrote:
>>>Vasik had very logical and persuave ideas.  I particularly liked the point that
>>>trading one third speed searching for twenty times the evauation per position
>>>almost has to be good if done right.
>>If that describes what he's doing then it seems however Vasik has taken the
>>other way around, the junior way. The utmost minimum of knowledge in leafs.
>I do not understand this comparison.
>Rybka is a slow searcher and Junior is a fast searcher.
>What is the reason that you think that rybka has minimum of knowledge in leafs?

How do you know Rybka is a slow searcher? Just by looking at its obfuscated
nps?? For instance, in

[D]8/8/pppppppK/NBBR1NRp/nbbrqnrP/PPPPPPPk/8/Q7 w - - 0 1

do you really think it takes quite long to find the mate in 1 because of a huge
static analysis? ;)


This page took 0.02 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.