Author: Albert Silver
Date: 13:47:26 12/20/05
Go up one level in this thread
On December 20, 2005 at 16:30:11, Stuart Cracraft wrote:
>On December 20, 2005 at 15:17:25, Alex Schmidt wrote:
>
>>Hello,
>>
>>Vasik Rajlich kindly agreed to give us an interview:
>>
>>http://www.uciengines.de/UCI-Engines/Rybka/vriv/vriv.html
>>
>>Thank you Vasik,
>>Alex
>
>Good interview. Nice to attach a face and a personality with the program's
>author. I wish they had gone into his formal studies more. He studied at MIT?
>Anybody have some detail about that?
>
>The comment about his having learned much, in regards to search, from Fruit,
>is a great clue. So he gets that search, adds some to it, then tacks on
>a monster evaluation for middle-game stuff, and voila, Rybka.
Learning a number of things from Fruit's search, and just taking at and adding
some to it, aren't exactly the same thing. He does say, "Anyway, if I really had
to give a number - my wild guess is that Rybka would be 20 rating points weaker
had Fruit not appeared."
I'm not an engine programmer, but I have never gotten the impression one could
simply tack on a monster evaluation to a search, any search, without adding the
equivalent of brakes and handbrakes to the engine's speed. Is Fruit so different
that this can be done at so little cost?
And if it isn't so different, then his search can't be simply Fruit's plus some,
can it?
Albert
>
>Although I have the source code for Fruit 2.1, the thought of going through
>any other person's program is really anathema to me nowadays. I get a feeling
>it will "taint" me. And of course, that just taint so.
>
>So what is so special about Fruit 2.1's search? Anyone analyzed it care to
>comment?
>
>Thanks,
>
>Stuart
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.