Search found 3363 matches

by lkaufman
Fri Feb 05, 2010 9:17 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question to Larry Kaufman about Rybka
Replies: 55
Views: 8826

Re: Question to Larry Kaufman about Rybka

Depends on what you call "enough". The eval is greatly simplified, and some search parameters are changed, but is that enough to say that they really understand the program? My own feeling is no.
by lkaufman
Fri Feb 05, 2010 9:01 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question to Larry Kaufman about Rybka
Replies: 55
Views: 8826

Re: Question to Larry Kaufman about Rybka

Thanks for a clear answer, which sounds correct to me. So basically only a few people (at most) understand why the Robbo search is so fast and strong. Do you think even the authors of Robbo and other Rybka derivatives themselves understand the answer to this question?
by lkaufman
Fri Feb 05, 2010 8:28 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question to Larry Kaufman about Rybka
Replies: 55
Views: 8826

Re: Question to Larry Kaufman about Rybka

Well, that would be nice, but most of the programmers who have looked at Robo seem to agree that there is no simple secret, it's just a lot of little things. That is pretty much Don's opinion too, though he hasn't spent much time looking at Robo. But I already know enough about the eval in Rybka to ...
by lkaufman
Fri Feb 05, 2010 7:51 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question to Larry Kaufman about Rybka
Replies: 55
Views: 8826

Re: Question to Larry Kaufman about Rybka

I don't believe the issue is raw speed. Actually Komodo is pretty fast going by NPS (if these figures are really comparable among engines); only Fritz comes to mind as clearly faster. The issue is how Robbolito manages to reach higher search depths than other engines while still remaining competitiv...
by lkaufman
Fri Feb 05, 2010 7:15 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question to Larry Kaufman about Rybka
Replies: 55
Views: 8826

Re: Question to Larry Kaufman about Rybka

That is not the case with Komodo; our eval is rather small and cheap, though pretty good and improving daily. The big speedup from Rybka to Robbolito was indeed achieved partly (or mostly) by simplifying the eval, leaving out terms whose cost roughly offset their benefit. So if you used only very ch...
by lkaufman
Fri Feb 05, 2010 5:07 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question to Larry Kaufman about Rybka
Replies: 55
Views: 8826

Re: Question to Larry Kaufman about Rybka

Don is hoping to work full-time with Komodo so we plan to start charging at least for a multiprocessor version once it's ready, so we can't very well go open-source. However our eval is fully configurable by the parameter file, which are seeded with our actual values just prior to the name change, s...
by lkaufman
Fri Feb 05, 2010 3:35 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question to Larry Kaufman about Rybka
Replies: 55
Views: 8826

Re: Question to Larry Kaufman about Rybka

" because those last three plies were pruned much more heavily than in other programs prior to Rybka 1. I complained about this before, and I'll do so again: you have no way of knowing how Shredder, Junior, Fritz, Hiarcs and Sjeng work unless you've broken into our offices, so please don't claim you...
by lkaufman
Fri Feb 05, 2010 3:27 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question to Larry Kaufman about Rybka
Replies: 55
Views: 8826

Re: Question to Larry Kaufman about Rybka

" You can achieve the same by making the program twice faster in NPS without any difference to pruning (and incidentally, RobboLito is much faster than most of those programs), so your conclusion doesn't follow from the data at all. Twice faster is impossible IMHO. I have spent long hours at profile...
by lkaufman
Fri Feb 05, 2010 5:03 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Question to Larry Kaufman about Rybka
Replies: 55
Views: 8826

Re: Question to Larry Kaufman about Rybka

I don't know the original motivation for reducing the reported depth by 3, as it happened before I joined Rybka. However there was a reasonable justification for this, because those last three plies were pruned much more heavily than in other programs prior to Rybka 1. Even now, it is apparent that ...
by lkaufman
Thu Feb 04, 2010 1:55 am
Forum: Computer Chess Club: Tournaments and Matches
Topic: Komodo? Nein.... Doch!
Replies: 22
Views: 1581

Re: Komodo? Nein.... Doch!

No, I don't mind, you just should be aware that in effect you were using one version three times.