Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Did you read Per-Ola Interview?

Author: Daniel Clausen

Date: 02:29:35 11/06/02

Go up one level in this thread


On November 06, 2002 at 01:59:50, Jouni Uski wrote:

>Here's part of interview:
>
>We would like to get a short charactarization of Ruffian. Where do you see the
>strong points, and where do you feel that there is room for improvement? Do you
>think that Ruffian prefers longer time controls or do you think it does a better
>job at blitz? How do you assess its value for long-time-analysis like some
>correspondance chess players use. Does Ruffian need large hashtables? Maybe you
>can give some suggestions about the optimum hashsizes when using Ruffian for the
>different time controls?
>
>Per-Ola Valfridsson (Ruffian):
>As you have noticed, Ruffian is a "fast searcher" I also estimate ruffians
>endgame as quite strong. Ruffian also has some weak spots for example: no
>knowledge about pawn storms, opposite castle or center control. The opening book
>could also be improved. There is no optimal hash size, use as mush memory you
>can. I don't see any problem as long as you avoid swapping. I have no reason to
>believe that Ruffian will do any worth or better at longer time controls. I
>havn't done any test, I'm too impatient.
>
>15. Interview team:
>What programming language have you used to write Ruffian? C++ or is most of the
>code in Assembler?
>
>Per-Ola Valfridsson (Ruffian):
>Ruffian is written in C with portability and performance in mind. The intel
>version is boosted with some inline assembler.
>
>So the secret for strong play is still SPEED.
>
>Jouni

Interesting logic.

Sargon



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.