Search found 2254 matches

by Milos
Sun Jan 03, 2010 2:12 pm
Forum: Computer Chess Club: General Topics
Topic: Robbolito 0.09 New Edition VS Rybka 3
Replies: 284
Views: 56332

Re: Robbolito 0.09 New Edition VS Rybka 3

The real giveaway that something untoward happened and is going on is the fact that the so-called "author" of the Ippo/Robbo code is anonymous. I doubt that will change either. A real hit and run job. There are several reasons as to why somebody would want to sting Vas in such a manner, some mentio...
by Milos
Sat Jan 02, 2010 7:35 pm
Forum: Computer Chess Club: General Topics
Topic: Vas Rajlich Video...
Replies: 89
Views: 12447

Re: Vas Rajlich Video...

The part of "Even if 1 line is directly copied, GPL is violated and this is the end of story." is nonsense because I am sure that different people can even come with the same single line independetely. This is hard to believe, and I tend to agree with Bob on this. I also think that expressing these...
by Milos
Sat Jan 02, 2010 2:42 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On engine testing again!
Replies: 46
Views: 5166

Re: On engine testing again!

To me a far greater issue is that some improvements are really regressions at longer time controls, or visa versa. That has way more impact than self vs foreign. Good point here. And it's more short time control improvements that hurt long time controls, simply because it's so much faster to test t...
by Milos
Sat Jan 02, 2010 2:35 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Using Heinz in 2010 is not optimal
Replies: 6
Views: 1858

Re: Using Heinz in 2010 is not optimal

Few good points and this: Another possible idea is to use always R=3 in the first N nodes of the search(for some constant N that may be 500,000 or a different number)and if you get depth X after N nodes then later use R=4 for depth>X might be especially useful since in endgame where depth goes high ...
by Milos
Sat Jan 02, 2010 12:51 am
Forum: Computer Chess Club: General Topics
Topic: Vas Rajlich Video...
Replies: 89
Views: 12447

Re: Vas Rajlich Video...

But i don't want strong speculations or almost sure facts. I want a 100% proof. You can't even have a 100% proof that grass is green. This is not math, you need to have some conventions on what is a copied code, and what is sufficient for you. Regarding your attitude (which is really a troll), you ...
by Milos
Sat Jan 02, 2010 12:23 am
Forum: Computer Chess Club: General Topics
Topic: Vas Rajlich Video...
Replies: 89
Views: 12447

Re: Vas Rajlich Video...

But how do you know that he did not take only ideas from Fruit? Have you seen Rybka 1.0beta code? Asking this kind of question after so much discussion on this topic here on CCC is nothing but a troll. At least try to ask a meaningful question like: "Have you seen Rybka 1.0beta source code?" And th...
by Milos
Fri Jan 01, 2010 10:08 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Using Heinz in 2010 is not optimal
Replies: 6
Views: 1858

Using Heinz in 2010 is not optimal

Many are still following Heinz results. R=2 at root, R=3 at leaves. It's simply wrong! Few simple facts. The depths when this was established and tested were 8, 10 and 12. Typical depths today are 15-20. Even with 8, 10, 12, adaptive model R=2/3 worked the best. So, not only 2 or 3 was the best. Con...
by Milos
Wed Dec 30, 2009 11:33 pm
Forum: Computer Chess Club: General Topics
Topic: Has Stockfish 1.6s DC Finally Dethroned Rybka?!!
Replies: 29
Views: 7039

Re: Why only Rybka?

alpha123 wrote:
2: RobboLito 0.85g4 1 CPU 6.0/12 2-1-3 ····· 1-2-3 36.50
Where did you get g4?! :shock:
Misha forgot to mention, g4 was on 32bits, while others were 64. :D
by Milos
Wed Dec 30, 2009 11:15 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Smooth scaling -- an explanation
Replies: 39
Views: 9700

Re: Smooth scaling -- an explanation

I guess that each and every program will have its own optimal R factor, and also that the factor will change if they add LMR and it will change if they add other reductions. This is exactly the point. Neither, 2 nor 3 nor 4 is carved in stone. It has to be determined for each program what is the op...
by Milos
Wed Dec 30, 2009 11:06 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Smooth scaling -- an explanation
Replies: 39
Views: 9700

Re: Smooth scaling -- an explanation

Regarding your explanation I was just saying that when you write in your example depth = 5, actually it is depth = 2,5*OnePly so that when you say that with depth = 5 you have the same reduction by 4 of the original, this is not correct because the original with a depth = 5 (aka 2,5*OnePly) gets a ...