Slashdot Mirror
Kramnik and Deep Fritz Draw, Tied Before Final Game
iskander writes "Man and Machine were content to draw in game 7 of the Brains in Bahrain match. Now it's all down to the final game, in which Kramnik will enjoy the advantage of playing with white. It is worth noting that game 6, in which Kramnik may have resigned too early, was found to be a probable draw with best play, and that Kasparov lost to Deep Blue by tossing a drawable game. However, whereas Kasparov could only excuse himself (unconvincingly) by claiming that Deep Blue had been assisted by a human during play, Kramnik could simply request the adjudication of game 6 on the grounds of infractions committed by Deep Fritz, who is rumored to have heckled Kramnik with its Shakespearean chatter througout the game. :) So, will Dirty Fritz win it all or will Humanity's champion "rise above the chatter" and win back the crown for us? If you think you know, you may want to place a bet or register your opinion on the ChessLines survey soon, because the match ends tomorrow."
Kramnik vs Deep Fritz match summary:
October 04, Game 1: Draw ----------- Article
October 06, Game 2: Kramnik wins --- Article
October 08, Game 3: Kramnik wins --- Article Analysis
October 10, Game 4: Draw ----------- Article Analysis
October 13, Game 5: Fritz wins ----- Article
October 15, Game 6: Fritz wins ----- Article Analysis
October 17, Game 7: Draw ----------- Article
October 19, Game 8: ?
It is worth noting that game 6, in which Kramnik may have resigned too early, was found to be a probable draw with best play It is also worth noting that Kramnik didn't have much time left on his clock, and it would have been difficult for him to come up with the right moves given the amount of time he had left on his clock.
AccountKiller
There are 20 possibilities for a first move:
Now there are also 20 possibilities for a response, that's already 400 possibilities for the first move and answer.
If you disregard the fact that the first moves may open new possibilities and keep calculating with 20 possibilities then the third move has already 8000 possibilities, the next one 160.000
After only 10 moves (5 on each side) this number alredy grows to 104.900.000.000.000.000.000.000.000 and the game has just started.
You would need a big Beowulf Cluster to build such a tree.
For those who aren't familiar with big numbers, it would take a modern processor (at around 10^12 moves per second) somewhere around 3^61 years to complete that game tree. How long is 3^61 years? Well... the sun will explode at 5^9 years, long before the computer ever finished searching the tree.
For those who don't seem to get it:
;)
The Shakespeare quotes article was humor, not fact. Or maybe wishful thinking...
But in any case, Deep Fritz is not clever enough (or blessed with a complex enough *ahem* 'chatter file') to actually use Shakespeare to such great effect... It did not really happen.
Sheesh.
STOP . AMERICA . NOW
A few things I've noticed:
1) The quotes are all remarkably apt for the moves--in other words, they reflect the emotion and the mental state of Kramnik and the game itself. A computer would not be able to understand the underlying meanings of the Shakespearean quotes, let alone choose the appropriate quote for each moment.
2) It played the words just loud enough for Kramnik alone to hear. How then is it that we have a full and complete transcript of what Fritz said? Never mind -- I just read the transcript again and it looks like an official got the transcript from Fritz. But I still say it's fishy.
3) It hummed the theme from Midsummer's Nights Dream? It whistled. While recordings of these could be made, and I suppose loaded in and played on command, I still find it hard to believe that this would happen.
4) Considering that Krimnik could easily, and without drawing criticism on himself, point out this clear breach, wasn't it way too much of a concern for the people developing the Fritz program? Did they really want to risk disqualification?
I was able to read the transcript once (it's
All right, all right, folks -- read to the end of the transcript. This line gives it away: It's a practical joke placed upon us by, surprise surprise, a "Shakespearean scholar and chess addict" Michael Fischer.
Karma: Chevy Kavalierma.
Excuse me for my lack of knowledge on the subject, but why can't a game tree for chess be made?
You are absolutely right - this is basically how chess programs work. As many other have pointed out, it is impossible to calculate all the moves for a game. But contrary to some posts, the strategy is not meaningless. The computer will make a game tree say 5 moves ahead, then discard all of the inplausible moves, and go down another couple of levels (there is, of course, a lot of thinking that goes into specifying exactly which paths should be discarded and a lot of other details)
And wouldn't it be a matter of time before it is impossible to beat a computer at chess?
Yes, this is exactly what has happened. Only a few people in the world can deal with a computer that evaluates all possible moves 5 or more steps ahead.
Tor
This is absolutely correct. To reply to all the other posters on this thread: time is a very important part of all competitive chess. There are strict rules about the chess clock and its use. International chess specifies 2 hours for the first 40 moves and then another two hours to reach move 60, for example (IIRC). Losing on time is a very common occurrence - especially on the Internet servers. Nothing like a quick game of 2 minutes blitz to make you appreciate time to think :)
If you want to see some game played by grandmasters when in "time trouble", I'd suggest picking up the Mammoth Book of Chess by Graham Burgess for some excellent - and amusing - examples. You don't have all the time in the world - chess is a balance between concentration and speed.
--- Hot Shot City is particularly good.