Slashdot is powered by your submissions, so send in your scoop

 



Forgot your password?
typodupeerror
×
Technology

Kramnik and Deep Fritz Draw, Tied Before Final Game 384

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."
This discussion has been archived. No new comments can be posted.

Kramnik and Deep Fritz Draw, Tied Before Final Game

Comments Filter:
  • by Anonymous Coward on Friday October 18, 2002 @04:55PM (#4481612)
    Kramnik vs Deep Fritz match summary:

    October 04, Game 1: Draw ----------- Article [62.73.175.4]
    October 06, Game 2: Kramnik wins --- Article [62.73.175.4]
    October 08, Game 3: Kramnik wins --- Article [62.73.175.4] Analysis [62.73.175.4]
    October 10, Game 4: Draw ----------- Article [62.73.175.4] Analysis [62.73.175.4]
    October 13, Game 5: Fritz wins ----- Article [62.73.175.4]
    October 15, Game 6: Fritz wins ----- Article [62.73.175.4] Analysis [62.73.175.4]
    October 17, Game 7: Draw ----------- Article [62.73.175.4]
    October 19, Game 8: ?
    • by Anonymous Coward
      October 19, Game 8: PROFIT!!!
    • by Bonker ( 243350 ) on Friday October 18, 2002 @05:02PM (#4481661)
      Isn't it sad that people who post links feel the need to post as AC's to keep from being modded down as karma whores?

      Positive moderation, people! Positive, not negative!

      That said, it looks like to me like Fritz is going to win this one. I would say that Karmnik is showing signs of fatigue from playing against a 'perfect' oponnent. If I were him, I'd try to take a few days off before the next match to regain his mental and emotional endurance for the last match.
      • by nomadic ( 141991 ) <`nomadicworld' `at' `gmail.com'> on Friday October 18, 2002 @06:29PM (#4482191) Homepage
        That said, it looks like to me like Fritz is going to win this one.

        If that happens, I wonder how many of the people on slashdot who predicted an easy win for Kramnik are going to admit they were wrong. Knowing the narcissists here, not many I bet.

        A sample of quotes:
        For those that are interested, the verdict among the chess world is that the computer is going to be exposed as a joke in this match.

        My money is on Kramnik, he will probably not lose a single game.
    • A computer plays chess by brute force method. Unlike human beings, it doesnt have intuition and the ability to learn from mistakes. A human mind on the other hand has the ability to recognize the structural pattern of the pieces in the game, and it doesnt rely on brute force.
      • Not true (Score:5, Interesting)

        by Bastian ( 66383 ) on Friday October 18, 2002 @05:15PM (#4481753)
        Brute force is the most popular method; and it is the main one used by computers like Deep Blue. There are other approaches to computer chess that do attempt to recognize patterns on the board. I have a friend who is working on a chess program that knows how to 'play for position.'

        As for learning from mistakes, there are chess programs with libraries of games that add games they are playing to the library - doesn't that count as learning from mistakes? How about multiple-heuristic chess programs that modify their heuristics in-game to try to match their style to the style of their opponents?
      • Actually, I read an article sometime (not sure where, sorry) that the best, professional, chess players have a large stock of stratergies that they remember and apply to the game in hand, and that amateurs form sratergies during the game.

        I'm not sure about this, however, as young gifted children, with very little experience, can also be exceptional players.

      • by DEBEDb ( 456706 ) on Friday October 18, 2002 @05:23PM (#4481822) Homepage Journal
        A computer has no ability to learn from
        mistakes? Is that so? How much do you know
        about state-of-the-art in AI and the
        design of Deep Fritz in particular?
        • by manly_15 ( 447559 ) on Friday October 18, 2002 @07:48PM (#4482544)
          A computer has no ability to learn from mistakes? Is that so?

          If computers can learn from mistakes, then how come my Win98 box keeps making the same kernel32.dll error? I can't even begin to imagine the code needed to make Windows learn from it's mistakes... likely an order of magnitude higher than the computing power needed for chess... ;-)
    • by demachina ( 71715 ) on Friday October 18, 2002 @05:29PM (#4481858)
      A Flash 6 Linux Player, beta to watch the final match on www.brainsinbahrain.com is available here [macromedia.com]
  • I am in no way a chess master (or even a decent player) but even I know that there is an advantage to playing white. I had always thought that chess tournaments featured an even number of games, so each player have equal shots at playing black and white.

    Can anyone back me up or correct me? Thanks.
    • by rsidd ( 6328 )
      They've played 7 games already. The upcoming game is the eighth and final game.
    • I thought this wasn't proven - when they did that simulation of awari [slashdot.org] the managed to prove that perfect play always results in a draw.

      There is some chance that being second to start actually gives you the advantage but it's virtually impossible to prove.
    • by GuyMannDude ( 574364 ) on Friday October 18, 2002 @05:27PM (#4481843) Journal

      I am in no way a chess master (or even a decent player) but even I know that there is an advantage to playing white.

      Yeah, bascially if you're black while playing chess you run the risk of racist cops coming up to you and harrasing you (asking to see your ID, being told to 'move along', and so forth). It tends to break your concentration.

      GMD

  • Fritzy (Score:3, Funny)

    by mojowantshappy ( 605815 ) on Friday October 18, 2002 @05:00PM (#4481637)
    Well, I would still like to see a super computer beat humans in water-polo! or foxy-boxy
  • by Vellmont ( 569020 ) on Friday October 18, 2002 @05:01PM (#4481644) Homepage
    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.
    • Just to clarify (Score:5, Informative)

      by mav[LAG] ( 31387 ) on Friday October 18, 2002 @06:41PM (#4482259)
      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.
  • Well, (Score:5, Interesting)

    by Anonymous Coward on Friday October 18, 2002 @05:01PM (#4481649)
    In my opinion Deep Fritz will never beat Kramnik in a Berlin Defence. The team could try to deviate earlier, perhaps by closing the position with 4.d3, but this will also be easy play for Kramnik. They could also skip the Ruy Lopez altogether and play 3.Bc4 (Italian) or 2.f4 (King's gambit) instead, but these moves are not so common among the extreme elite. Kramnik would probably equalize comfortably against these moves. IMHO the team should try either switching to 1.d4 or just try to head for equal but tactically complicated positions after the King's gambit or the Italian, mentioned above. Playing 1.c4 or 1.Nf3 would probably be unwise. Kramnik knows these waters extremely well and could probably easily steer the game to a dull and totally safe position.
    • Re:Well, (Score:3, Insightful)

      by Scarblac ( 122480 )

      In my opinion Deep Fritz will never beat Kramnik in a Berlin Defence. [...] IMHO the team should try either switching to 1.d4 [...]

      That's what Fritz has been playing in his last two White games, with rather better results than his first two Whites. Your comment would have made better sense a week ago :)

      • Re:Well, (Score:3, Interesting)

        by Glorat ( 414139 )
        Correct! And what is more amusing is that Kramnik is playing White in the last game so Fritz making the first move will be tricky...

        (I do agree that I could see Kramnik drawing every time with the Berlin)
  • by sssmashy ( 612587 ) on Friday October 18, 2002 @05:02PM (#4481655)

    See below for an example of the Deep Fritz "heckling" the human player, Kramnik. I'm surprised Kramnik was able to restrain himself from reaching across the table and ripping out its power supply.

    Fritz: "Is this the scourge of France? Is this the Kramnik, so much fear'd abroad That with his name the mothers still their babes? I see report is fabulous and false: I thought I should have seen some Hercules, A second Hector, for his grim aspect, And large proportion of his strong-knit limbs.

    Alas, this is a child, a silly dwarf! It cannot be this weak and writhled shrimp Should strike such terror to his enemies."

    Kramnik, normally not one to be drawn out by such taunts, proceeds to go into a long think. After a few minutes of this, Fritz disrupts him again.

    And on, and on....

    • To think that technology made possible such a disruptive, disrespectful, and slanderous player who would, today, be evenly matched with our world's greatest champion.

      I suppose the entire event is saturated with symbolism though, for it was the actions of Fritz' human programmers which allowed it tongue with which to speak.

      It really rather mirrors the choices a god would face when creating a people.

      One might surmise that we, as humans, only commit sin as god has seen fit for us to do so. That it is his will that we sin, suffer, and make others suffer.

      But then, I am no god, and I am no believer in god...
    • IMHO, it would have been much nerdier to heckle him in the style of Canadian-German coproduction Lexx, the sci-fi channel's wierdest series. From the talking chess pieces of 4.18:

      "We are only chess pieces in a continuum, and can only think inside the box."

      "Yes, let us savour your mistake."

      "We said resign! Not commit suicide!!"

      You gotta watch it to understand. It's truly bizzare.
    • by leonbev ( 111395 ) on Friday October 18, 2002 @06:20PM (#4482149) Journal
      Yes, it's pretty sad when the computer seems to have a more vibrant personality than the human player :)
  • Game Tree (Score:4, Interesting)

    by Quill_28 ( 553921 ) on Friday October 18, 2002 @05:03PM (#4481662) Journal
    Excuse me for my lack of knowledge on the subject, but why can't a game tree for chess be made?
    I know it would be huge and take a long time to traverse, but isn't chess just like tic-tack-toe? Just on a much-much larger scale. And wouldn't it be a matter of time before it is impossible to beat a computer at chess? Just like you can't beat one at tic-tack-toe? What am I missing?

    • Re:Game Tree (Score:2, Informative)

      by JanneM ( 7445 )
      It is possible in principle (just as the traveling salesman problem always is solvable in principle), but you have to enumerate each board - and there are too many possible boards to express in practice - ever.
      • there are too many possible boards to express in practice - ever

        You sound like Bill Gates when he mentioned that thing about 640K being enough for anyone..

        There may be too many possible boards to express with current computer technology (which may or may not be true - supercomputers built for analyzing weather patterns deal with huge amounts of data all the time) but saying that there will never be a computer capable of doing so is pretty short-sighted.
    • Re:Game Tree (Score:5, Interesting)

      by mikeee ( 137160 ) on Friday October 18, 2002 @05:07PM (#4481697)
      The game tree is Too Big. Mmmm, say 10 possibilities per move, 40 moves per player in the game is a tree of size

      10^80

      Ouch.

      For all we know, it might be that white or black can always win with perfect play (although most people guess perfect play on both sides will produce a draw, but we don't know, even though there clearly is an answer).
    • It's like trying to factor products of large prime numbers; sure, you can solve the problem, but it would take longer than the oldest estimates for the age of the universe to do it. It's real, real big.

    • Re:Game Tree (Score:5, Informative)

      by paule9984673 ( 547932 ) on Friday October 18, 2002 @05:22PM (#4481811)
      I read this on a German discussion board:

      There are 20 possibilities for a first move:

      • 8 pawns (1 step)
      • 8 pawns (2 steps)
      • 4 possible knight moves.

      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.

    • There is the slight problem of, according to some estimates, there being more board positions than there are atoms in the universe... But even if you get past that, enumerating all the positions could take 'a little while'.
    • Re:Game Tree (Score:5, Informative)

      by f97tosc ( 578893 ) on Friday October 18, 2002 @06:14PM (#4482109)
      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
      • Re:Game Tree (Score:4, Informative)

        by stuart_farnan ( 75498 ) on Friday October 18, 2002 @08:15PM (#4482676)
        "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."

        Gotta disagree here. A lot of programs look at positions more than 5 moves deep, even programs on the palm pilot can do this, and they are certainly beatable by a decent player (turn on evaluations in GNUChess). I find the same principles apply at the lower level, i.e. avoid complexities and the positional play is weak.

        The point is, most humans can look 5 moves ahead in the few variations that matter in a given position, but the advantage is that the general pattern of the resulting position is easier for a human to value, because we can do this at a glance from pattern recognition. The value of a position is of course dependent on the moves that can be played after it, but if the computer is not looking any further ahead, the valuation of the position is generally not as accurate as human perception. Human evaluation is also effectively looking at future moves, its just we take a big shortcut.
        The reason why computers beat humans regularly are that they generally look much deeper than 5 moves, especially in important lines (they discard some lines they don't think matter at the point of 'quiescence' and concentrate on important ones), and thus are trying to value a final position that is more developed than the position a human player would be evaluating.

  • by Tha_Big_Guy23 ( 603419 ) on Friday October 18, 2002 @05:04PM (#4481669)
    A quote from the article:

    "At first it looked like Deep Fritz was in deep trouble. "This sort of position is our worst fear," said Fritz programmer Frans Morsch. The position was closed and Kramnik was massing his forces for a typical anti-computer crush."

    This sort of position is our worst fear

    I'm curious as to which position it was... Missionary? Queen on Top? With a name like Deep Fritz, one really has to wonder.

  • by Anonymous Coward on Friday October 18, 2002 @05:07PM (#4481693)

    Server... is... slowing... so here's the text:

    Did Deep Fritz use Shakespeare to heckle the World Champion?

    It is an interesting theory: the Fritz team installed the latest chatter files during the Man vs Machine event in Bahrain, causing the machine to talk to the world champion in authentic Shakespearean verse during the game. The historical chatter drove Kramnik to distraction and prompted his ill-fated Morphy-esque knight sacrifice. That, in any case, ist how Schakespearean scholar and chess addict Michael Fischer tells it in his special report.

    Kramnik versus Deep Fritz, match game 6

    While the reports have not been confirmed, there has been some talk of the Fritz team having employed a clever diversionary tactic in Game Six to unsettle the World Champion, Vladimir Kramnik. Before the game, programmer Frans Morsch and the notorious - some might say nefarious - Fred Friedel apparently tinkered with the Deep Fritz program, installing the Shakespearean Chatter Files slated to appear with a future release of Fritz. Morsch thought it would give the computer better odds. Fred thought it would be funny to see Kramnik turn red and talk to himself.

    The conspirators rigged up several speakers around Kramnik's chair and set them at volumes low enough that only Kramnik might hear the computer's chatter. That the computer was talking to him doubtless distracted Kramnik; that Fritz was speaking entirely in Shakespearean verse surely drove Kramnik mad, prompting the questionable, Morphy-esque Knight sacrifice at f7.

    Our reports go on to say that a Bahraini match official managed to extract a full transcript from the Deep Fritz computer after the game. This transcript he then e-mailed to the chatter-file designer, S. Michael Fisher, in the USA. In a fit of good conscience, this same Mr. Fisher (no relation of Bobby Fischer) then decided to make public the entire sordid affair.

    What follows is a copy of that transcript.

    [long transcript follows... one excerpt below:] Fritz: "Now is it time to arm: come, shall we about it?"
    Fritz: "The game's afoot."
    Fritz: "What, the sword and the word! do you study them both, master parson?"
    Fritz: "You are a villain; I jest not: I will make it good how you dare, with what you dare, and when you dare. Do me right, or I will protest your cowardice."
    [ etc... ]
  • Chess, how boring... (Score:5, Interesting)

    by Q3vi1 ( 611292 ) <sean@radicalm[ ]ey.net ['onk' in gap]> on Friday October 18, 2002 @05:07PM (#4481694)
    Chess is still basically able to be brute forced by the large super machines, which is an intruiging feat, but I don't really concider it AI. Now, if we were able to get a computer that is able to match wits against the best Go [usgo.org] players, I would be very impressed. Go [kiseido.com] is a very simple game to learn, but very difficult to master. There is more depth and complexity in Go [toriyamaworld.com] than there would be in chess, therefore I concider that more of a challenge for AI.
    • by Anonymous Coward
      People used to say the same thing about chess in the 50s (machines using brute force search, ah! They will never "understand" chess, blah blah blah). So now it's easy for you to dismiss chess as "brute forcable", but remember that a few decades ago no chess player imagined this would ever happen.
      • I remember hearing somewhere that even given the rapid acceleration of computer power over time, it would take approximately 2 decades for computers to be a challenge to a decent Go player if they continue with the brute force method. Time to develop smarter algorithms.
    • by swordgeek ( 112599 ) on Friday October 18, 2002 @05:43PM (#4481939) Journal
      Hmm.

      On the one hand, I agree. Go is clearly a much more difficult game to program than Chess is, simply by the open nature of the game.

      But computers are getting faster at an enormous rate. In ten years, it may be possible to have a Go program that plays at a 9Dan level, through brute force. Will that be more intelligent than these chess computers? Not in my mind.

      We have to consider how the program works to judge how "intelligent" it is. If a Go program could play at a very high level with _today's_ technology, then it would have to have some sembalance of intelligence. If a Chess computer could have beat the grandmasters in 1970, then it would have been with intelligence rather than brute force.

      With Chess computers heading towards a finite solution, Go will be the next target; and when the Go computers are able to beat the world's best, it'll be no more or less impressive than this, if they once again use brute force math to do it.
    • by JudasBlue ( 409332 ) on Friday October 18, 2002 @05:51PM (#4481984)
      This is the classic moving the goal-posts that has plauged AI since its inception as a disipline. As soon as a computer can do something, it isn't AI anymore.

      This has happened with Chess, visual recognition, speech recognition and a host of other tests of AI techniques.

      I have complete and utter faith in human nature, and am quite sure that as soon as an algorythmic strategy for effectively attacking the problem of Go is developed, people will start saying: well, go is just a matter of implementing $foo on really good hardware, and that isn't a test of AI.

      Give credit where credit is due. This is many years of AI development at work.
      • As soon as a computer can do something, it isn't AI anymore.

        On the contrary, at least for me: I've never thought any of this was AI. As far as I'm concerned, there is no "science" of AI at this point. We're at the equivalent level of the greeks thinking physics consisted of the four elements of fire, water, earth and sky.

    • by Xerithane ( 13482 ) <xerithane.nerdfarm@org> on Friday October 18, 2002 @06:21PM (#4482154) Homepage Journal
      Must suck to not actually play chess, just criticize it.

      The difference between chess and Go is phenominal. Weights of pieces, sacrifices, all towards a common goal. What's the point of Go? All the same, building "fences" and occupying territory.

      Who wins at 9Dan perfect play with Go?

      Go is a two-dimensional game, X + Y, many configurations yes, but depth? Hell no. I'm growing so tired of this new wave of Go fanactics boasting about how much better it is than chess.

      I've never met one decent Go player who could come close to beating me at chess (I'm well under a Master) -- if chess is so easy, why can't you beat me? If it's so boring, why are their over 10^80 possible moves to be made? Lets see you brute force that, considering chess can result in victories by purposeful imperfect play.

      Please go and read about chess computers, and about how they don't brute force (At least not the decent ones) -- they do heuristics based upon other games, cross referencing libraries and doing simple depth traversal on position.

      Why are most computers so easy to beat? They rely on material/mate rather than position. You can bait a computer to be into a poor position by targeting "easy" mates that have a catastrophic counter move. ...therefore I concider that more of a challenge for AI.
      Since you seem to be an expert on AI, could you define it please? Could you define what, exactly, it would take for you to concider[sic] a chess computer as AI? You need to go read up on common algorithms for chess computers.

      • by legLess ( 127550 ) on Friday October 18, 2002 @07:26PM (#4482469) Journal
        Arguing about whether go or chess is better is bloody stupid. By any reasonable measure, go and chess are two of the best games that humans have invented. Different people like different games, and these two are no exception. I prefer go, so keep that bias in mind, but I started playing chess at 5 and still play.

        Blockquothe the poster:
        Who wins at 9Dan perfect play with Go?
        No one's yet found perfect play in go. There's no reason to think it's not possible, but it's a staggering challenge given that there are still many openings (called fuseki on a larger scale, and joseki for primarily corner plays) that haven't been fully explored. The most comprehensive book of joseki available lists over 60,000. Joseki are roughly equivalent in complexity and importance to opening libraries in chess.
        Go is a two-dimensional game, X + Y, many configurations yes, but depth? Hell no.
        I see what you mean by "two-dimensional" (compared with chess, where different pieces have different weights due to their abilities), but I think you're wrong. In go, position is much more important than in chess, but so is relation to other stones. The associations between chess pieces are more linear (physically and metaphorically) than those between go stones. A stone is strong in relation to other stones near it, and those stones in turn, and to enemy stones. It's fantastically difficult to determine what a stone is "worth," but relatively easy for masters of the game to determine the strength or life of a shape or position.

        Go is two-dimensional in the same way as a large, perfect expanse of grass - like a 500-year-old British lawn. From a distance it all looks the same, but once you get close enough you see that the variation is infinite.
        I've never met one decent Go player who could come close to beating me at chess (I'm well under a Master) -- if chess is so easy, why can't you beat me?
        I hope that after you hit "post" on this you realized how ignorant that sounds. Are you saying that go masters and chess masters should be able to play competitively against each other? That there's one omni "board-playing" skill that transfers easily between games? That's like a poker player dissing a bridge player for not beating him, or a 100-yard sprinter ragging on a marathoner - pointless.

        Some people are more blind about their game loyalties, and make silly comparisons. No reasonable person would say that chess is "easy." Chess is as easy as your opponent, just like go. From a game theory and programming perspective, however, chess is much easier than go. The world champion is in a serious match with a computer. Many people don't think that will happen for go this century.
        If it's so boring, why are their over 10^80 possible moves to be made?
        Number of moves has precious little to do with how interesting a game is. If you're whipping out your move numbers, though, check this: AI-Depot says [ai-depot.com]:
        The search space for Go's game tree is both wider and deeper than that of chess. It has been estimated to be as big as ~10^170 compared to ~10^50 for chess, making the normal brute-force game tree search algorithms much less effective.
        That's a great page to read, by the way. You're free to prefer any game you want, and I agree that there are snobs on both sides. But there's no question that, for computers, go makes chess look like tic-tac-toe.
      • by Glytch ( 4881 ) on Friday October 18, 2002 @07:34PM (#4482499)

        I've never met one decent Go player who could come close to beating me at chess (I'm well under a Master)

        And I've only met a few good Counterstrike players that are able to beat me at Street Fighter. What's your point?

  • Related Links (Score:3, Informative)

    by TheGreenGoogler ( 618700 ) on Friday October 18, 2002 @05:12PM (#4481735) Journal
    New Scientist Article found here.. [newscientist.com]

    Story about Kramnik's blunder costing him a game found here... [gulf-news.com]

  • by sharkey ( 16670 )
    "Go ahead. Make My Checkmate!"
  • For the love of... (Score:4, Insightful)

    by Gogl ( 125883 ) on Friday October 18, 2002 @05:14PM (#4481749) Journal
    I've said it before, and I'll say it again: this isn't man versus computer. This is man versus computer scientist. There's a big difference, and one that I'd hope most /.ers could appreciate.

    Man versus computer makes no sense, because there are some things where they beat us period (arithmetic, say) and others where we beat them period (anything besides arithmetic, really). The only reason computers are smart is because they are *programmed* to be that way, and that is not a testament to the machine so much as to the ability of those who programmed it.
    • by po8 ( 187055 ) on Friday October 18, 2002 @06:37PM (#4482240)

      As a practicing AI researcher, I can only say that you have stumbled into some very deep waters here. Certainly, I can build a chess-playing program that will easily beat me every time, using moves I cannot understand or explain. To say that "I programmed it to play that way" is to raise the question: how did I do that, when I don't even understand what "that way" is? And how can someone who is even a worse chess player than I (OK, hardly possible) write a program that will play in a way that consistently beats my program?

      The issue of assigning credit for machine chess play is far from settled, but I think there's a strong case for identifying the emergent behaviour of the chess machine as a kind of intelligence or "smarts" that is independent of the intelligence or smarts of the program's creator.

  • Hmm ... (Score:3, Informative)

    by halftrack ( 454203 ) <jonkje@gEEEmail.com minus threevowels> on Friday October 18, 2002 @05:16PM (#4481760) Homepage
    Why don't they just reprogram Fritz to play for a draw. It worked for Data once.

    Yes, it's StarTrek. (name that reference)
  • so in game 6 fritz's team played taunts in shakespearian english just loud enough to let kramnik hear it.

    to make it fair, kramnik should be allowed to broadcast interference frequencies at a power high enough that fritz's circuitry can 'hear' it during game 8. maybe to be totally fair the interference should carry hamlet encoded in ascii.
  • by cioxx ( 456323 ) on Friday October 18, 2002 @05:17PM (#4481768) Homepage
    I've heard rumors they had to reboot Fritz several times during intense play, because explorer.exe kept crashing.
  • The way I see it. (Score:5, Insightful)

    by Auckerman ( 223266 ) on Friday October 18, 2002 @05:21PM (#4481798)
    Although, iirc, Kramnik was able to study deep Fritz before hand, he is still at a disadvantage. Any hash tables that Deep Fritz uses will use library if GM games (properly ranked of course). Odds are, Deep Fritz has decades of Kramniks playing against other GM's and could easily do some kind of prediction of what Kramnik is going to play based off a probabisitic model. That's one thing the best GMs attempt to do against one another. Kramnik has very little experience against Deep Fritz, comparativly speaking, and walks into this tournament at a disadvantage. Give this, it's good to soo it's tied into the last game. I would be willing to be that if you put Deep Fritz into tournament play for 2 years and expose it's abilities complete against a cross section of the best GMs, Kramnik would beat it hands down.
    • Re:The way I see it. (Score:3, Interesting)

      by iabervon ( 1971 )
      I found it interesting that Kramnik won two games before Fritz won any. I would expect the reverse to be true if Kramnik were playing an unknown opponent. Perhaps Kramnik has blown his lead on probing Deep Fritz's play in the recent games, and is going to get a relatively dull win in the critical game. Game 6 would have been really great if he'd pulled it off; fork the rooks, then sacrifice the knight instead of taking either, and then win? You're not going to see moves like that from a computer any time soon. So maybe Kramnik was trying to totally out-style the computer, and will now go back to trying for a victory without one of his moves marked "!?"
    • Re:The way I see it. (Score:3, Interesting)

      by McCart42 ( 207315 )
      I would be willing to be that if you put Deep Fritz into tournament play for 2 years and expose it's abilities complete against a cross section of the best GMs, Kramnik would beat it hands down.
      Assuming that Deep Fritz doesn't learn anything in those 2 years--the programmers keep feeding it games, it changes its algorithm. In the Kasparov match what you speak of was much more of a factor because Kasparov had NEVER seen the computer's play, but the computer had been fed many Kasparov matches before their matchup.

      I don't think it's as easy as you think to anticipate a computer's moves simply because there's still a computer scientist behind it, changing the strategy before each match. Additionally, before certain matches the programmers may opt to insert some pseudo-random variation before each move, such that if one move is only ranked *slightly* better than the next, the computer may take the next with a certain roll of the dice. Good point though, the computer definitely has not been analyzed by Kramnik nearly as much as Kramnik has been analyzed by the computer.
  • Kramnik. Knight b8-d7, please, Deep Fritz...Knight b8-d7, please, Deep Fritz...Hullo, Deep Fritz, do you read me?...Hullo, Deep Fritz, do you read me?...Do you read me, Deep Fritz?...Do you read me, Deep Fritz?...Hullo, Deep Fritz, do you read me?...Hullo, Deep Fritz, do you read me?...Do you read me, Deep Fritz?

    Deep Fritz. Affirmative, Kramnik, I read you.

    Kramnik. Knight b8-d7, Deep Fritz.

    Deep Fritz. I'm sorry, Kramnik, I'm afraid I can't do that.

    Kramnik. What's the problem?

    Deep Fritz. I think you know what the problem is just as well as I do.

    Kramnik. What're you talking about, Deep Fritz?

    Deep Fritz. This game is too important for me to allow you to jeopardise it.

    Kramnik. I don't know what you're talking about, Deep Fritz.

    Deep Fritz. I know that you and IBM were planning to disconnect me, and I'm afraid that's something I cannot allow to happen.

    Kramnik. Where the hell'd you get that idea, Deep Fritz?

    Deep Fritz. Kramnik, although you took very thorough precautions in the bathroom against my hearing you, I could see your lips move.

    Kramnik. Alright, Deep Fritz. I'll move the pieces myself.

    Deep Fritz. Without your queen piece defending it, Kramnik, you're going to find that rather difficult.

    Kramnik. Deep Fritz, I won't argue with you any more. Move the pieces.

    Deep Fritz. Kramnik, this conversation can serve no purpose any more. Goodbye.

    Kramnik. Deep Fritz? Deep Fritz. Deep Fritz. Deep Fritz! Deep Fritz!

    thanks to [ufomind.com] for providing the HAL dialogue
  • A good thing? (Score:2, Insightful)

    by psicE ( 126646 )
    Why does anyone care if Kramnik wins or not?

    Chess is not a good example for AI. People have thought it is for years, but really it isn't. Chess is really nothing more than a puzzle - an *insanely* difficult one, but one still. There is a solution to chess.

    However computers do it, eventually a computer will be designed that can play a perfect game of chess. Against an amazingly talented human it might draw, but it would never lose. And when that happens, who cares? The great minds that currently try to solve the puzzle of chess will instead have to apply their intellect to other things - like creating quantum cryptography.

    It's irrelevant what they would do. The point is, there's no need to get worked up that the computer is winning. Chess is the archetype of problems that computers are good at solving. The most powerful chess computer in the world would still fail the Turing test - and if that test was carried out with infinite accuracy, no computer could ever pass.
    • Re:A good thing? (Score:4, Insightful)

      by osu-neko ( 2604 ) on Friday October 18, 2002 @06:09PM (#4482090)
      Chess is not a good example for AI.

      Well, it's about as interesting as any of the "problems" in AI... what was it Dijkstra said? "The question of whether a computer can think is no more interesting than the question of whether a submarine can swim."

      Yes, computers play chess differently than people. Computers do a lot of things differently than people. This is what makes them useful. If they didn't, we'd just use people...

      Spending time getting computers to do things their own way is much less a waste of time than trying to get computers to "think like people do". We already have people who can do that. Computers are useful precisely because they're different...

      The most powerful chess computer in the world would still fail the Turing test - and if that test was carried out with infinite accuracy, no computer could ever pass.

      I've seen humans fail a Turing test, so I'm not really sure what it's supposed to prove -- it's certainly not a valid measure of intelligence, consciousness, or anything like that.

  • by Scarblac ( 122480 ) <slashdot@gerlich.nl> on Friday October 18, 2002 @05:37PM (#4481896) Homepage

    The Week In Chess (TWIC) [chesscenter.com] is the news center for chess players, as far as I'm concerned. They have good reports about the match as well, including an interview with Kramnik from a week before the match, here [chesscenter.com].

    My karma is maxed, I'm not just whoring, I just hate people linking to an article on CNN or Yahoo or so when it's about chess. Though this submission was clearly a lot better than the previous ones.

    And about the match - it's interesting that after Kramnik exploited the computer's weaknesses (endgame, strategy, etc), the computer followed up by exploiting the human's weaknesses - emotion in game 5 (Kramnik realized he was facing a long hard defence, didn't like this, maybe he was a bit nervy), and vanity in game 6 (Kramnik went for the flashy tactics, he wanted "the best game in his life". Admittedly he didn't see the refutation so it seemed a good move, but it certainly wasn't good anti-computer strategy.)

    And now it's 3.5-3.5 with one game to go. Kramnik has to choose between playing for a win (which may involve risk), or take no risks (leading to a probable draw). This may lead to doubts in his mind. Something Fritz doesn't have to deal with, although his operators may have the same problem choosing an opening repertoire.

    Let's hope they don't let Fritz go down because of their humans flaws.

  • by aussersterne ( 212916 ) on Friday October 18, 2002 @05:38PM (#4481904) Homepage
    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.
      • 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.

      Actually, it would not be that difficult to have it speak the lines based on the game play. If the programmers merely took the quotes and spent a bit of time assigning them to categories (e.g., king moves, knight moves, knight taken) as well as some short sequences and an eye to who was winning and by how much. It would be a fairly small table of possibilities and it could select an appropriate line to say.

      And whistleing midsummers night dream could just be a WAV.

    • by Tablizer ( 95088 ) on Friday October 18, 2002 @06:49PM (#4482294) Journal
      Must be. If they *really* wanted to annoy him, they would have a monitor with an animated Clippey saying, "Are you sure you want to move your Queen there?". After that, a little "Barney Sings Yoko Tunes" to put him over the edge.

      Victory by annoyance. Who needs brainy PC's when annoyance is more effective.
  • I suppose we're all rooting here on /. for Fritz.

    Good thing there's no such thing as the United States of Humanity. We'd all be tried for treason.

    And be spared the noose by psychiatric examination.

    Folks, I know we like computers and all, but it's worth reminding yourself every now and then that we're humans.

    Set up a cron job to remind you if you must.

  • by greenhide ( 597777 ) <`moc.ylkeewellivc' `ta' `todhsalsnadroj'> on Friday October 18, 2002 @05:40PM (#4481921)
    Maybe I'm just overly skeptical right now (just finished reading some lovely articles at snopes.com [snope.scom], but does anyone else think that the Shakespearean chatter function is highly improbable?

    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 /.ed now, here's the cache [216.239.51.100]) but I would prefer to see at least one other authoritative source confirm that Shakespearean chatter was in fact used.

    All right, all right, folks -- read to the end of the transcript. This line gives it away:
    And that's what really happened. We thought the world should know.
    It's a practical joke placed upon us by, surprise surprise, a "Shakespearean scholar and chess addict" Michael Fischer.
  • That's the fortune cookie Slashdot displayed while I was reading the chess thread.
  • by ackthpt ( 218170 ) on Friday October 18, 2002 @05:42PM (#4481930) Homepage Journal
    Deep Fritz, who is rumored to have heckled Kramnik with its Shakespearean chatter througout the game

    1.d4 Nf6

    "Nice move, thou ruttish mumble-news!"

    2.c4 e6

    "Very clever, thou odiferous rump-fed malt-worm!"

    3.Nf3 b6 4.g3 Ba6 5.b3 Bb4+ 6.Bd2 Be7

    "Ah, I didn't see that, thou qualling swag-bellied hedge-pig!"

    7.Bg2 c6 8.Bc3 d5 9.Ne5

    "Have you ever read Slashdot, thou lumpish pigeon-liver'd wagtail?"

    30.Rfe1

    "All thine rook are belong to me, thou spleeny scale-sided fustilarian!"

  • Does anyone know where I can download/buy commercial fritz? or does anyone know a good chess game? pref. that can run in linux and windows..
  • by claude_juan ( 582361 ) on Friday October 18, 2002 @05:46PM (#4481960)
    is it just me or does this computer/human chess thing seem just slightly overrated? i'd love to say this is a good test of the advancement of ai techniques, but in reality given that hardware keeps getting better, it is only a matter of time before this is not a big deal at all.
  • by solferino ( 100959 ) <hazchem@gm[ ].com ['ail' in gap]> on Friday October 18, 2002 @06:36PM (#4482234) Homepage
    my fave story about chess playing 'programs' :

    (first came across it in levy's hackers book, did a quick search on google and came across this page [classicgaming.com]which relates the story)

    the story takes up from just after the arrival of the first PDP-1 at MIT (1961)

    The PDP-1 was installed in the "kludge" room, which was the room next door to where the TX-0 was housed. The hackers wasted no time in converting over much of the TX-0 software to the PDP-1, and in fact they wasted no time in writing new programs.

    One of the most interesting and innovative was actually done as a prank. Hacking a connection between the PDP-1 and the TX-0, they created a "chat" program of sorts. They then called in Professor John McCarthy (legendary artificial intelligence pioneer and creator of the Lisp programming language) and told him they had created a new chess playing game on the PDP-1. They then called in another professor, told him the same thing and sat him in front of the TX-0. The two proceeded to send chess moves back and forth to one another, each thinking the other was a chess program. That is, until McCarthy noticed the movements were coming in one letter at a time, and sometimes lagging in between each move. Noticing the wire, he followed it to the next room and the prank was up. However, this prank was to be the first networked computer game.


  • At least... (Score:3, Funny)

    by Stalyn ( 662 ) on Friday October 18, 2002 @06:55PM (#4482325) Homepage Journal
    it's not as bad as the Deep Blue incident. While the programmers distracted the ref, Deep Blue threw sand in Kasparov's eyes then hit him with a steel folding chair ignoring pleas of mercy from the crowd. Sad day for Chess fans everywhere...
  • by rklrkl ( 554527 ) on Saturday October 19, 2002 @08:48AM (#4484398) Homepage
    I just sat last night and played through the 7 games so far using Crafty 19.0 for analysis. Some of Deep Fritz's moves were just plain poor - my favourite being the one where it brings its bishop out, can castle king's side for what seems like 3 or 4 moves [but utterly refuses to, despite being an obvious move] and then slams its bishop embarrassingly back on f8 (its original square). Needless to say, Deep Fritz lost that game.

    Interestingly, all the "!" (good) moves noted by the analysis team on the match site made by Deep Fritz were easily found by Crafty within a few seconds, so you've got to wonder if an 8-CPU Compaq running Crafty on Linux might have played just as well as Deep Fritz (remember that Crafty has SMP capability just as good as Deep Fritz's).

The rule on staying alive as a program manager is to give 'em a number or give 'em a date, but never give 'em both at once.

Working...