IM larry kaufman in OTB chess has a different opinion.bob wrote:As I said, I have given up trying to explain. I've not said that GMs can beat programs OTB very often, although they can still do it. I have simply explained _how_ the computer is beating the GM. And based on my experience, my reasoning is correct. I've watched it over the years. We started beating GMs at blitz in the late 70's, not because we outplayed them, but we let them make mistakes that turned out to be fatal. Today the same idea is holding on, and it is approaching the point where a GM simply can not play with enough accuracy over a long enough period of time, to hold off the computers. But to say that computers can positionally outplay top GM players is just silly, for anyone with enough chess skill to understand the ideas involved...Dr.Wael Deeb wrote:He can't,the truth and the statistical data are obvious for everyone to see....George Tsavdaris wrote:That's not polite.Terry McCracken wrote:Bob, don't waste your time with them, they know far more than we do.bob wrote:I'm only going to say this one more time and then move on to other topics. Correspondence play in the 1960's and 1970's did _not_ use computers, yet the variations were calculated out to depths that I considered impossible. Berliner had some gems and did _not_ need a computer to help him, since none were available back then.Matthias Gemuh wrote:bob wrote:Easy to say, but programs have a fixed and fairly shallow horizon. GMs sometimes calculate variations to 40-50 plies. Programs don't.Matthias Gemuh wrote:bob wrote:
A GM can _way_ out-calculate a computer along sharp tactical lines for the most part,
That is not true for today's hardware and top engines !!!!!.
Matthias.
If you mean in correspondence chess, aided by engines, you are right.
Otherwise there is no proof for your claim.
Statistics prove that you are wrong:
if the GMs were that strong, they would not be blundering as frequently as they do in important human-human tournaments.
Just pick _any_ one of such tournaments and count the blunders at _shallow_ depth. There is no way they can calculate variations to 40-50 plies without using engines.
Matthias.
GMs blunder because they are human, and make mistakes in time pressure, or when distracted, etc. But overall their moves are quite good. Otherwise I guess all the "greatest games" books need to be trashed as too full of blunders to be useful?
This is one of those "impossible to prove" situations so there is little point in continuing the back and forth discussion. You can have the last word. I still believe GM players are far stronger than computers overall in terms of positional play. And in the case of certain types of very deep and forcing tactics. Computers don't miss anything within their search horizon, and this horizon has gotten deep enough that they give GM players great trouble now. A GM can certainly calculate as deep as or deeper than a computer program. But at a cost of mental energy, and eventually fatigue will decide the outcome in many games... it is more a case of the GMs losing than it is a case of the computers winning... and it now happens frequently enough that GMs are beginning to not do very well against computers. Whether they would do better with one game a week is unknown since such an event would take forever.
In a conversation where 2 sides disagree, one side states its arguments and the other answers by trying to refute them and provide better. Etc, and conversation continues.
By saying, like you did, with an ironic way that you know better, and also expecting everyone to agree with what you say is ridiculous.
You can't force everyone to agree with you and if they don't, to start being ironic against them is a bad thing....
You should try to refute their statements instead.
No more human strategical superiority nonsense,set on the table and prove it,or let one of your GM searching 500 plies ahead do it....
A computer is so bad at recognizing weak pawns, weak squares and such. But its tactics carry it anyway...
http://rybkaforum.net/cgi-bin/rybkaforu ... 3#pid71643
"The key to Rybka's strength (and other programs too, though to a lesser degree) is that a decent evaluation after a very deep search will produce better positional play than a super evaluation after a much shallower or narrower search. No practical number of takebacks will change this; the human GM will be outplayed positionally despite his better evaluation, because he cannot possibly compete in the realm of search"
Uri
