'The Chess Advantage in Black and White', published by Random House, McKay Chess Library.
It's a clever textbook, covering a complete repertoire for both sides.
How about an updated edition?
Erik
In any event, it will be interesting to see if you can substantially raise the bar on the evaluation front...
In the upper right hand corner of your screen there is a button "flat view" which you should set to "thread view". If you register you can set this in your profile, but for guests the default I think is still "flat view". It would probably be better to change that.
Eelco
Eelco
This was the first estimate of Dann Corbit but it is clearly wrong.
Rybka3 is still significantly stronger than stockfish based on all the results that I read.
Uri
Larry means - according to other forums - the step from 1.5.1 to 1.6 was partly from DELETED.
smooth scaling was made by Dan Corbit.
Whatever,
HAPPY NEW YEAR
Edit:
Oops, Larry has responded to HEM, in the meantime I was on the phone.
Or do you mean 150 ELO from the superceded 1.5.1 version?
> though it is still possible that this version is stronger than Rybka 3.
...you mean it is still possible that this version 1.6s is not at all stronger than version 1.6 (what a joke!!!)
Do you mean yet another 150 ELO jump from the current released Stockfish (v 1.6.0ja) or
150 ELO from the superceded version (1.5.1)?
> GI: The kind of singular extensions restricted to lower bound hash hits is a much stronger symptom, as recently stated by Larry Kaufman in the Rybka forum, which might be simply proved by looking with Ida-pro to the Rybka binary, if one don't trusts Larry for whatever reasons.
I'm not sure what "lower bound hash hits" means here. That seems to be the SF method (which Marco Costalba noted was different). Here are the R3/RL pseudo-codes for singular extensions at CUT nodes when not in check:
Rybka 3 Chess [CUT/ALL/Exclude node for white is 0x487ac0 in Linux gdb]
if (depth>=18 && trans_move && move_is_ok(trans_move)) // 0x48864a-0488682
// also checks that this is indeed a CUT node, and that no move is already excluded
{compare_value=Exclude(scout-30,depth-10,trans_move,...); // 0x4886d5
if (compare_value < scout-30)
{SINGULAR=2; if flags were already fiddled, increase SINGULAR some more, possibly, depending upon the height perhaps;}}IP/RL/IG/IH/FB
if (depth>=16 && trans_move && move_is_ok(trans_move))
{compare_value=Exclude(scout-depth,depth-MIN[12,depth/2],trans_move);
if (compare_value < scout-depth)
{SINGULAR=1; if (height*4<=depth) SINGULAR++;
compare_value=Exclude(scout-2*depth,depth-MIN[12,depth/2],trans_move);
if (compare_value < scout-2*depth)
{SINGULAR++; if (height*8<=depth) SINGULAR++;}}}I think the claim is that both demand
trans_move to be non-null? Considering that there is going to be an "Exclusion search" against the trans_move, it seems almost necessary for it to exist?! When I spoke with GCP, he seemed to suggest that the whole "exclusion scheme" was new to him, but I couldn't make out what he gave as an alternative ("search-within-search" rather than "exclusion-search"?).Other than that, I don't see all that much the same here. RL uses a "2-step" process to find singular moves with a variable window, while R3 does it all at once, with a fixed one. Both have "supersingular" extensions (that is, beyond a 1-ply extension -- I redacted these in the above R3 code, and I don't understand them exactly), though in RL they are purely height-based, while in R3 they seem to involve, for instance, series of singular moves.
The picture is similar at CUT nodes when in check. At PV nodes, there are more differences, as R3 puts "extensions" (passed pawn pushes, moves that give check, piece swaps) in the singularity code, while RL does it later.
>LK: I'm referring specifically to the hash move limitation
This does seem to be in R3. The depth bound (16 half-ply) is also the same I think.
>ZW: The other thing that's "new" is the weird (score - depth / 2) bound that is used. I assume that all of these values are well tuned in Rybka,
I fail to find this "weird" (score - depth / 2) bound in R3. And I think R3 uses a different depth reduction when doing the comparison.
>Nobody really wants to fess up and admit that ideas were obtained by reverse engineering,
To quote a wiki:
Fact: fine ideas cultivate for many gardens ...ideas splurged for miles in ovals
And:
Code with ****** buys own same tunings, accumulating ideas from all turnip patches. For comparisons, Russia Champion Karpov achieved thoughts from yoghurts, so and challenger shed brainwaves upon parapsychographical apparitions. Effulgent ideas sprout in totality of garden shrubs, so too exposed in capitalist ships!
But on the other hand:
Decompilation burns the intrepid puddles with the lutefisk. Impressment has not the bones. Conclusivity: Wasting of Comrades mobilities.
There you have it - is that an admission? :-P
But actually, I was referring to acceptable engines not wanting to admit that they were using ideas from R3, rather than Nelson's comrades.
>This person should pursue a career as a speechwriter!
Well, they/it claims to be 2 different people between those 3 quotations...
>But actually, I was referring to acceptable engines not wanting to admit that they were using ideas from R3, rather than Nelson's comrades.
You realise that he is now a "Suspicioned Capitalist", due to "starring in a Capitalist Propaganda video" (or something like that)? :-P
> Now they have some joker posting as a representation of the Vietnam Communist party! It would have been more impressive if he had posted as a rep from the The Dragon Capital!
How anybody could possibly think that this whole thing is anything else but a sick and twisted joke, is beyond me.
> The proletariat's take this very seriously! Oh! The members take this very seriously- I've check out their main chess forum- they have a lot of members, some from here!
Suckers - LOL
> I think I'd be real careful about labeling anyone- People have a right to decide who they want to support and that is something that they should be able to do openly and honestly without fear of recriminations taking place.
That's true.
you are very good at chess for certain, but how deep are you in programming?
There is a point in your presentation that makes me suffer in my ethical mind frame. Something that stinks, sorry if that might insult you, but I have seen something that goes beyond your person.
I fear we must re-define the role of what is a crime in software copyright (for fields like computerchess where everything is about ideas and how to code it in a most effective manner).
For me it's a crime if someone (I'm not talking about LK, how could I without informations) robs out of a code that is NOT for free but closed for commercial usage, puts it into his robbed rob, then publishs the robbed code for free and some Stockf or whatever have it in their code too. Then Stockf isnt legal (what you are proclaiming here) in my eyes but the same robbed rob in Stock veils. It's then also a crime, just IMO, if a Doch appears with your help and suddenly has all the robbed stuff and soon is among the first three in SP, then you give this for free (just quoting what you wrote) again, and then announce that you want to make money with MP Doch. Do you at least realise, sir, that you are standing on robbed rob code from Vas?
I fear that the whole concept of open source if you take MS and then the inofficial, free OpenOffice is unimportant. But it's still a crime IMO, but who cares if official institutions all use MS? But in a small area in computerchess it cannot be legal, it IS a crime, if after every new invention in Rybka, over the robbed implementation into open source like Crafty and others, suddenly over Doch someone wants to establish a competition for Rybka, but in truth it's basically all robbed from Rybka itself. That's unbelievable chuzpah method of crime, no?!
IMO the open source stuff over Crafty as a source of inspiration is working as long as known competitors in business then take everything after a _polite_ period of respect, but if suddenly someone appears without any basis, robs the whole open source and turns it in competition against the friendly donator Rybka, then this is a crime, no?
IMO the open source like Crafty is no longer tolerable if it seemingly legalizes a robbed rob code from Rybka in the last instance. We must investigate if such a pretended engagement out of universities without money interests isnt basically supporting the former robbery of stolen code. That should imediately be investigated by the State authorities in the USA. People always speak of the "crazy" Russians, but in truth absolutely innocent chaines of naive distribution of code is the main threat in computerchess for any possible business at all. Because we speak here about poor Rybka as victim, but what about the misery for the old competitors like Junior or Fritz in the business and _their_ living?
IMO we must reform our understanding of what is legal and what is crime in this field of software production. It cannot be true that robbery is publicly applauded and plans are announced how to make money on that basis.
Powered by mwForum 2.27.4 © 1999-2012 Markus Wichitill