Re: The Evidence against Rybka
Posted: Wed Oct 05, 2011 4:56 pm
do not disagree at all. However, THAT is exactly what we have been "getting" as you know...
"it just has to be wrong..."
"it just has to be wrong..."
Independent Computer Chess Discussion Forum
https://open-chess.org/
I don't think there is any level of immaculate organization that would make a difference. I think most people who don't bother to read it suffer from one or more of the following:BB+ wrote:It is a bit annoying that there are still some who seem quite unaware of even the basis for the ICGA decision to disqualify Rajlich's entries [whether or not they agree with it]. This could be due to the information not being immaculately organised, though mis-information/mis-direction must play some part too. Perhaps if I find the time, I will write something briefly on this. The FSF guy was also interested in such a summary, but he then seemed to say that the current information was enough, so I never bothered.People really do need to download the report.
I don't think that has been challenged, people on the other side have accepted that Rybka is "based" on Fruit.BB+ wrote:I would say that by themselves these snippets are not as significant as the "evaluation overlap" finding, though they do serve to bolster the overall picture that the "origins" of Rybka 1.0 Beta were indeed in Fruit 2.1.
If Houdini is the topic of discussion, I'd find more interesting to discuss why is it lagging behind Rybka and other engines like Critter for analysis of Correspondence games despite the new learning feature that was introduced and that its elo is much higher for unassisted games? Is it the evaluation or what?kingliveson wrote:How 'bout we talk more interesting topics like why Houdini is destroying the competition
No, please don'tBB+ wrote:I removed the comments, as it appears that's been called "fantasy code". Perhaps I should just give up trying.What is this code for? - please don't tell me it's from the UCI parser....![]()
Actually it is, the compiler just subtracted 121 from it during optimization (853 + 121 = 974).Rebel wrote:From Zach's document:
Rook mobility (Rybka)
static const int RookSemiKingFileOpening = 121;
static const int RookKingFileOpening = 974;
974 not in R1 executable
Code: Select all
0x401b86: add $0x79,%esi if so, add 121 in opening
0x401b89: test %rdx,%rax and if file is same as bK
0x401b8c: je 0x401baf
0x401b8e: add $0x355,%esi add 853 more in opening
Remember, you're looking for little-endian values (first byte is the lowest 8 bits).Rebel wrote: Shelter values (Rybka)
const int shelter_value[5] = { 1121, 0, 214, 749, 915 }
1121 not in R1 executable
749 not in R1 executable
915 not in R1 executable
Yes, there are rational explanations. It took me about 5 minutes to find the answers to these two examples, bring on the rest of em and hopefully they will be easy to explain also.Rebel wrote: I have a lot more of those but I think 2 examples suffice.
I assume there is rational explanation for this as since the volume excludes a simple typo.
HI Wylie,wgarvin wrote:Actually it is, the compiler just subtracted 121 from it during optimization (853 + 121 = 974).Rebel wrote:From Zach's document:
Rook mobility (Rybka)
static const int RookSemiKingFileOpening = 121;
static const int RookKingFileOpening = 974;
974 not in R1 executable
From R1x64eval.txt on the ICGA wiki:Code: Select all
0x401b86: add $0x79,%esi if so, add 121 in opening 0x401b89: test %rdx,%rax and if file is same as bK 0x401b8c: je 0x401baf 0x401b8e: add $0x355,%esi add 853 more in opening
I know but IDA takes care of that.Remember, you're looking for little-endian values (first byte is the lowest 8 bits).
Okay, let's do them one by one.Yes, there are rational explanations. It took me about 5 minutes to find the answers to these two examples, bring on the rest of em and hopefully they will be easy to explain also.