Slashdot Mirror


Men vs. Machines

FFriedel writes "In October classical chess world champion Vladimir Kramnik is scheduled to play Deep Fritz in Bahrain. Now Garry Kasparov, who lost his title to Kramnik in 2000, but is still ranked as the strongest player in the world, has announced that he will play the computer chess world champion Deep Junior in Jerusalem at almost exactly the same time. Both programs are distributed by ChessBase. In 1997 Kasparov lost his famous match against Deep Blue."

245 comments

  1. Any word yet... by rueben · · Score: 0

    When they will test out computers against man in other games that Man wins at currently? I remember Wired had an article about games that Man can beat computers at. I am sure that a computer could whoop some ass at Scrabble against a human, but what about backgammon?

    1. Re:Any word yet... by igrek · · Score: 2

      Best world players are still slightly better than best programs (two best backgammon programs around are Snowie and JellyFish).

    2. Re:Any word yet... by Anonymous Coward · · Score: 0

      Not so with all games. There are programs for Go and Checkers that can beat the experts.

    3. Re:Any word yet... by Anonymous Coward · · Score: 0

      No program beats a human go player. Not in the next 10 years.

    4. Re:Any word yet... by aes12 · · Score: 0

      Not quite true. "Many Faces of Go", the best one they have currently, can't beat decent players, but can beat weak players, like myself. :)

  2. He Should Just Take up Go. by BlackGriffen · · Score: 2

    From what I understand, they can't make a program that can beat even a decent player at that game. GNU Go whips me consistently at the lowest lever, though.

    BlackGriffen

    1. Re:He Should Just Take up Go. by NHerradura · · Score: 1

      Well, at least when I play Go online I know that I'm not playing against a computer. =)

    2. Re:He Should Just Take up Go. by A55M0NKEY · · Score: 1

      It whips me too. Shit I can't even figure out the rules.

      --

      Eat at Joe's.

    3. Re:He Should Just Take up Go. by BlackGriffen · · Score: 2
      The American Go Association has a tutorial available on this web page. I need to study them further, because the advice seems sound, it just hasn't sunk in to my playing style yet.

      BlackGriffen

  3. For the chess nuts by MxTxL · · Score: 2

    It's an exciting time for the chess nuts out there. Anyone that follows chess should be fairly excited by this. Of course, the chess followers are rooting for the human, while the AI folks are rooting for the computer.

    It's been noted for years that one benchmark of a machine's ability to think intelligently was to beat a grandmaster in chess. That goal has been significantly harder to achieve than beating the Turing test. Now just for a Go playing computer, a harder still benchmark.

    1. Re:For the chess nuts by spencerogden · · Score: 4, Insightful

      That's bull. How is chess harder than the turing test? It has pretty much been proven that brute force calculation can win the game of chess. We still have very little idea of how to beat the turing test. I would say the chess is infinitely easier than the turing test...

    2. Re:For the chess nuts by Raul654 · · Score: 3

      I agree with the parent. First of all, (and I do this to be specific, not to be an nitpicker) let's be specific - you are talking using the recognized "turing test", where a computer and people try to convince judges via telatype that they are human. [Turing's original test was slightly different, and included gender as a factor, but that has been disgarded as a red herring]. Now, the reason I say I want to be specific is because in order to "pass" the test, the computer has to fool humans 70% of the time, not just once. No computer has ever come close - IIRC, the last Loebner winner as in the 15% range. So saying that beating a grandmaster in chess is harder than passing the turning test is complete bull

      --


      To make laws that man cannot, and will not obey, serves to bring all law into contempt.
      --E.C. Stanton
    3. Re:For the chess nuts by caferace · · Score: 5, Funny
      That's true. I know a bunch of engineers that would be hard pressed to match the turing test.

      Some of them are pretty good at chess though.

    4. Re:For the chess nuts by psycho_tinman · · Score: 1

      I disagree with your statement that "one benchmark of a machine's ability to think intelligently is to beat a grandmaster in chess".. Simply, chess can be reduced to a series of patterns and combinations that have very little to do with intelligence per se

      If a simple database search through millions or billions of records which returns matches can be termed "intelligent", then the current set of chess playing computers are indeed intelligent.. But humans play chess differently, there is a lot more intuition, and far far less brute force techniques to evaluate a particular move..

      As others have noted, the Deep Blue vs Kasparov match was tailormade by the programmers to defeat ONLY Kasparov.. his past games, his playing style were all analysed in depth and preprogrammed into the machine.. if you like, call it the difference between rote learning and knowledge.. What humans do with chess now is knowledge management, computers are STILL stuck in rote learning, and from what I know, its unlikely that computers will make the step forward into true knowledge management in the near future..

      Don't get me wrong, I share your excitement at another chance to see a computer vs human chess match.. but I can't understand why ppl use this as an indication of the advances made to truly intelligent computers; when in reality, its nothing of the sort; just a combination of database technology, rule evaluation and faster processors..

    5. Re:For the chess nuts by MxTxL · · Score: 3, Interesting

      Look at a few of the bots out there. Alicebot for example. You get this bot talking to someone over ICQ for a little bit and they will not know the difference. The machine wouldn't be able to beat an AI researcher who knows how to ask it the correct questions to reveal that it's a machine, but to a regular human they could have a long conversation and the human would never know.

    6. Re:For the chess nuts by MxTxL · · Score: 3, Interesting

      I have to take issue with the idea that humans have anything more than rule evaluation and database searching in their brains. Human development, in my opinion, seems to suggest that everything we do is based on having screwed it once before. Burn your hand on something? Don't touch it again. Old milk tastes nasty? Don't drink it again.

      This is a great point for debate, but i am of the opinion that the human brain is just a large collection of facts (a database), a really fast processor, and really efficient algorithms for searches. Original thought, i feel, is done in a similar way to computers.... generate all the possibilities and evaluate the outcome, choose the best one... we can do it tremendously better than machines and that is why it appears to be original thought, but is merely extrapolating from current rules.

    7. Re:For the chess nuts by Raul654 · · Score: 3, Insightful

      I have to take exception with your point on original thought - here's what comes to mind. You say that original thought comes from generating and discounting possible approaches. The example that came to my mind are works by MC Esher. He draws parodixes - things that cannot exist in nature. How could he have created them, being that he could *not* have encountered them, or anything simliar?

      --


      To make laws that man cannot, and will not obey, serves to bring all law into contempt.
      --E.C. Stanton
    8. Re:For the chess nuts by Znork · · Score: 2

      Well, Eschers works arent really paradoxes, the ones I surmise you are thinking about are the failure of a 2d medium to correctly reflect 3d. The basic concepts are easy to come by; random doodling is likely to produce the original effects. An easy algorithm to produce the original interesting concepts would be to take a number of lines, connect them in random ways, discard uninteresting ones and keep the ones that show interesting effects. Evolve the interesting ones and combine with other objects.

      Random generation of hypothesis and discarding of faulty ones is easily mistaken for 'original insightful thought', especially since the discarded flawed ideas will likely never be talked about, making it seem as if the conclusion was arrived at from out of the blue.

      Further, there isnt anything inherently unrandomizable about paradoxes. Paradoxes are merely an indication of a failure to discard faulty random data or a failure to generate an inclusive explanation for the data.

    9. Re:For the chess nuts by Anonymous Coward · · Score: 0

      You don't have to encounter something, you can see hallucinations.

    10. Re:For the chess nuts by JPriest · · Score: 1

      See also AOLiza for some AIM chat logs of a perl port of the famous 1966 Eliza.

      --
      Saying Java is nice because it works on all OS's is like saying that anal sex is nice because it works on all genders.
    11. Re:For the chess nuts by kreyg · · Score: 2

      I can agree with that to some degree - we have an algorithm which, given sufficient run time, play chess flawlessly. The main problem is that there are way too many possible calculations to run it flawlessly on current hardware within the lifetime of the universe. And you'd need to use most of the matter in the universe (give or take) to store the complete results. Brute force can only win until somebody else brute forces deeper.

      On the other hand, we barely have the remotest clue (and that's being generous) of how to create an artificial intelligence algorithm to simulate human conversation. (I would personally argue that the term "artificial intelligence" is more or less meaningless, which compounds the problem somewhat.) But, we can at least be sure that human-brain-compatible hardware can run it in real time.

      Basically, the hardware and software problems for each problem are quite different, but both are still pretty hard.

      --
      sig fault
    12. Re:For the chess nuts by Bert+Peers · · Score: 2

      ~ random doodling is likely to produce the original effects~

      If your original claim about the way the brain works is correct, then it would all be too deterministic to be able to doodle at random ! Where is the randomness coming from ? Ie, shifting the problem of inspiration from the final work down to the doodling does not answer anything, it just pushes the genesis of the concept to a lower level.
      And, if you accept a random seed somewhere in the pipeline, then you can also view the brain as not just a database, processor and searching algo, but also as a convertor that channels the random seed into a useful result -- doodling in this case, chess intuition in the other. Which would bring the problem back to having to teach a computer to do something we currently have no mathematical concept of (the channeling).

    13. Re:For the chess nuts by Anonymous Coward · · Score: 0

      33 is interesting enough.

    14. Re:For the chess nuts by Znork · · Score: 2

      Well, the original claim wasnt mine. Random input is coming from all around. Everything from random firing of neurons based on our inherent imbalances in the chemical setup in the brain to every sense affected by random input from the world.

      The basics of the channeling we can emulate in the form of neural networks. The human mind is a bit more complicated than a database, processor and searching algorithm, so it would depend on how wide definitions you allow for those concepts. Neural networks can fall into a searching algorithm definition, and teaching them isnt that complicated.

    15. Re:For the chess nuts by dfgdfgdfg · · Score: 1
      It has pretty much been proven that brute force calculation can win the game of chess.
      The game of chess will be totally brute-forced in 2168.
      --
      -- 1.e4 c6 2.d4 d5 3.Sc3 de4: 4.Se4: Sd7 5.Sg5 Sgf6 6.Ld3 e6 7.S1f3 h6 8.Se6:
    16. Re:For the chess nuts by kalimar · · Score: 1
      An easy algorithm to produce the original interesting concepts would be to take a number of lines, connect them in random ways, discard uninteresting ones and keep the ones that show interesting effects. Evolve the interesting ones and combine with other objects.

      That sounds like an easy algorithm until you try and reduce 'interesting' to rules in the algorithm. What is 'interesting'? Two lines intersecting at 90 degree angles? Lines that don't? Lines that intersect only in their middle? Lines that never intersect in their 'left' half?
      Aesthetics is one of the hardest things to implement in an algorithm because it's so subjective.

      On the topic of chess though, as many people have said, it's all a matter of brute force. I used to be interested in seeing computers play chess. But since I found Go (and I'm in no way a good player of Go), chess is rather boring. Find a way to consistently win at Tic-Tac-Toe and I'll be interested. Program a grandmaster Go player and I'll be interested. But throwing some more CPUs, more memory, and the complete games of PlayerX into a computer just doesn't do anything.

    17. Re:For the chess nuts by zevans · · Score: 1

      This isn't intended to sound facetious (although it will): I know dozens of people who live their entire lives by responding to a series of patterns and combinations.

      The gist of this Slashdot discussion appears to define intelligent machines to be those that are capable of thinking outside of the box and playing chess intuitively. Most *people* don't do that.

      Regards,
      Zack

      --
      "... and more and more now there are all kinds of electronic goodies available" -- Pink Floyd 1972
    18. Re:For the chess nuts by Znork · · Score: 2

      The interesting ones would be those that almost produced a match for a known object when passed through a neural network trained for object recognition but failed when analyzed for consistency with geometric rules for 2d projection. If you want a definition likely to produce something like Eschers objects.

      Of course, Eschers drawings themselves have further been passed through another sieve. While similar drawings have probably been generated since the invention of the crayon by countless of children failing to portrait a cube or a stair accurately, the Escher drawings pass through the sieve of popularization. The children or other artists producing similar things havent gotten popularized, which gives the appearance again of something original and insightful. Still, despite appearance, it remains brute-force randomization passed through filters for meaning, rather than sudden insight.

      Anyway, on the topic of chess I pretty much agree with you. I dont really find it very interesting either.

    19. Re:For the chess nuts by Anonymous Coward · · Score: 0

      It seems sad that AI is boiled down to "fooling" people. But, this is the whole underpinning of programming as we know it. A computer doesn't "play" chess. We are just "fooled" into thinking that we are playing another opponent. ALL of the intelligent processes are on the human side of of the board so to speak. Intelligence isn't calculation. I Don't think AI will ever really move forward until we start to look at intelligence and programming in a different way.

    20. Re:For the chess nuts by sphealey · · Score: 2
      That's bull. How is chess harder than the turing test? It has pretty much been proven that brute force calculation can win the game of chess. We still have very little idea of how to beat the turing test. I would say the chess is infinitely easier than the turing test...
      I would go a little farther than that. Computers should be able to beat humans at chess - just as backhoes can outdig a laborer with a shovel. In fact, computers should have been able to beat humans at chess sometime around 1960, when the calculating ability of the computer exceeded that of the fastest human calculator/estimator. Yet they couldn't, and even today (with computers being 7 orders of magnitude faster than they were in 1960), it takes an extraordinary amount of effort to build a computer that can beat a grandmaster.

      Which I think shows that we don't have the least idea how humans play chess or how they think. It's as if John Henry could still show up at a railroad cut in 2002 and have a fighting chance to beat a D-12 Cat!

      If I were an AI or chess-playing-computer researcher, I would be ashamed to show my face in public!

      sPh

    21. Re:For the chess nuts by sphealey · · Score: 2
      It's been noted for years that one benchmark of a machine's ability to think intelligently was to beat a grandmaster in chess. That goal has been significantly harder to achieve than beating the Turing test.
      Significantly harder? Besides playing chess, Gary Kasparov writes political essays and participates in Russian politics, participates in the management of the international chess world, reads, speaks, and can therefore translate among several languages, and (he hasn't told me personally but I am willing to bet) can drive an automobile, swim, play ping-pong, and pitch woo to significant others of his choice.

      When Deep Blue can play chess and do those other tasks as well, we can talk about making an appointment for a Turing Test! Chess is about the easiest AI problem imaginable.

      sPh

    22. Re:For the chess nuts by Anonymous Coward · · Score: 0

      I did a lot better on the turing test after I took the Kaplan prep course.

    23. Re:For the chess nuts by Scooter · · Score: 1

      I agree - chess can be reduced to an algorithm - albeit a somewhat complex one.

      Surely as processors get faster etc etc, pitting humans against computers in a competition to do what computers do best is pretty pointless. It's not as if you can deceive/bluff the software now is it?

    24. Re:For the chess nuts by spencerogden · · Score: 2

      I'm pretty sure it isn't neccessary to search out the -whole- search space of possible moves.

    25. Re:For the chess nuts by scrytch · · Score: 2

      In fact, computers should have been able to beat humans at chess sometime around 1960, when the calculating ability of the computer exceeded that of the fastest human calculator/estimator

      Calculation, yes. Storage, no. A human brain stores exabytes or more of information (using a lossy format, yes), much of it in very efficient indexes. John Henry could probably place a pin quicker than most machines (the accuracy of robot assemblers and the like relies on controlled conditions) though that probably wouldn't make him feel any better...

      --
      I've finally had it: until slashdot gets article moderation, I am not coming back.
    26. Re:For the chess nuts by Anonymous Coward · · Score: 0

      "It has pretty much been proven that brute force calculation can win the game of chess."

      That is a bunch of bull. Anyone taking bets on who is going to win these matches?

    27. Re:For the chess nuts by AndrewCox · · Score: 1

      Are there official rules/guidelines for the Turing test out there somewhere? What I'm wondering is whether or not they also judge a human at the same time. Would a human pass the turing test 70% of the time?

      --
      The Red Pill ... all I'm o
    28. Re:For the chess nuts by AuMatar · · Score: 1

      Easy. Throw a bot in an AOL chat room. I garuntee you that it can pass.

      --
      I still have more fans than freaks. WTF is wrong with you people?
    29. Re:For the chess nuts by fferreres · · Score: 2

      I describe it as a pattern matcher and a patterns database, with some lousy oracles (pain, etc). The pattern matcher is in itself determined by patterns. It's circular.

      How you think is affected by how you procesed patterns in the past. If you are lazzy or not curious (each incremental match is less important). If your pattern matcher matches lots of non-matches, you are also doomed (once you reach a critical point of false positives vs. true positives, the pattern matcher gets corrupted beyond repair).

      I'm truly damaged beyond repair :)

      --
      unfinished: (adj.)
  4. Deep, man. by RasputinAXP · · Score: 4, Funny
    What's with the "Deep" designation? Are the programmers for the chess projects all aging hippies?

    "Kasparov would move Qe4 here, man."

    "Whoa, deep blue, man."

    "Hey guys, we need a name...for...hey!"

    And thus it's perpetuated.

    1. Re:Deep, man. by garcia · · Score: 1

      no, most aging hippies are previous stoners. They are less likely to be UNBELIEVABLE chess players because of that fact ;)

    2. Re:Deep, man. by Gogo+Dodo · · Score: 1
      The "Deep" part notates that whatever is the multi-processor version. So Deep Junior is the multi-processor version of Junior.

      I imagine they did that in honor of Deep Blue which was multiple processors. Deep Blue was called Deep Thought for awhile and then IBM "IBM-ized" it as Deep Blue.

    3. Re:Deep, man. by tap · · Score: 5, Informative

      It's a Hitchhiker's Guide reference. In the series by Douglas Adams, there is a computer that called "Deep Thought" that finds the answer to life, the universe, and everything else. (Which is 42). A famous chess playing computer was named Deep Thought. IBM's Deep Blue is a take on that name and IBM's "corporate color" of blue.

    4. Re:Deep, man. by Anonymous Coward · · Score: 0

      There is a Deep Junior and Junior. They are essentially the same except that Deep Junior runs on machines with multiple processors.

    5. Re:Deep, man. by Proquar · · Score: 1

      They should have kept with Mac-friendly name.. Deep Thought, or is that too long a bow, seeing as Douglas Adams was a well-known Mac-user.

      --
      ---- *dog sitting next to a computer, with his beady eyes shifting left to right*
    6. Re:Deep, man. by theRhinoceros · · Score: 2

      The name goes back to Deep Thought, one of the earlier projects which sought to beat human grandmasters.

      Once IBM got on the bandwagon, they named their machine Deep Blue (Big Blue, get it?) as a homage/spoof of the earlier effort.

      And now the newer programs are Deep x where x is whatever name you this is partcularly witty. It's sort of a spoof of a spoof at this point, and largely beyond immediate appreciation by the average person. Sorta like how Japanese ships have "maru" in their names.

      For more info on the history and nomenclature, look here.

    7. Re:Deep, man. by Anonymous Coward · · Score: 0

      They should make a computer that can effectively play the Spy Game.

      Then they could call it Deep Throat.

    8. Re:Deep, man. by Anonymous Coward · · Score: 0

      What's with the "Deep" designation? Are the programmers for the chess projects all aging hippies?

      Have you never heard of a colour described as deep blue? And you know that IBM == "Big Blue".

    9. Re:Deep, man. by ideonode · · Score: 1

      Well, DNA chose the name Deep Thought as a parody of Deep Throat (the Watergate mole / porn flick).

    10. Re:Deep, man. by haggar · · Score: 2

      Yes, the "Deep Thought" was a 64 node of Ultrasparc 20 workstations, and the program was developed by a guy called Feng-hsiung Hsu. Some of the feats of Deep Thought can be found here and here .
      Kasparov was the first of the international masters to beat Deep Thought. He was also the first world champion to be defeated by any computer... which at the time happened to be IBM's Deep Blue.

      --
      Sigged!
    11. Re:Deep, man. by PaschalNee · · Score: 1

      Isn't the name from that movie?

    12. Re:Deep, man. by bowronch · · Score: 1

      What's with the "Deep" designation? Are the programmers for the chess projects all aging hippies?


      Think Douglas Adams...

      Deep Thought was a computer chess machine built at Carnegie-Mellon University in the 1980's. It was a predecessor to Deep Blue, the chess machine that defeated Garry Kasparov in a match. Neither machine exists at this time.

      BTW anybody interested in computer chess might be interested in my program BACE which should have the ability to learn to play better as it goes along... unfortunately the learning process is not working right now, but it does play a decent game of chess (rated ~1900 blitz on FICS)
      --
      My Stuff: pspChess and foobar2000 plugins
    13. Re:Deep, man. by zmalone · · Score: 1

      UltraSPARC 20? Do you mean SPARCStation 20, Ultra 30, or Ultra 10? At present, your statement does not correspond to any Sun machines. Interesting that IBM was using Sun machines there too though, it seems as though a lot of internal IBM research seems to be done on Sun Ultra machines.

    14. Re:Deep, man. by haggar · · Score: 2

      Sparcstations, as far as I remember. Definitely they were not Ultra 10 or Ultra 30.

      --
      Sigged!
    15. Re:Deep, man. by scrytch · · Score: 3, Interesting

      Score 5, wrong. The name indeed comes from "Deep Thought", but the reference goes quite a bit further back than that, namely to a "chess playing automaton" that predated computers, and turned out to be a hoax, as it contained a diminuitive chess grandmaster within its confines.

      One should expect this from slashdot I guess.

      --
      I've finally had it: until slashdot gets article moderation, I am not coming back.
    16. Re:Deep, man. by durdur · · Score: 1

      FYI while the original designation "Deep Thought" comes from Douglas Adams, most chess programs that now have the "Deep" prefix use it to indicate that they run on multiprocessor machines (as Deep Thought did). It used to be only a few programs could make use of multiple processors, but now several of the popular commercial chess programs and some amateur chess programs support SMP.

    17. Re:Deep, man. by Anonymous Coward · · Score: 0

      Deep Thought and Deep Blue were two different computers. They were created by the same man though, Hsu.

    18. Re:Deep, man. by mondoterrifico · · Score: 0

      Sigh. Incorrect but somehow modded 5 for informative. The designation Deep refers to the fact that these programs are designed to use more then 1 cpu at a time.

    19. Re:Deep, man. by Chai_Bot · · Score: 2, Funny

      I wonder has anyone used the name 'shallow hal' for a chessplaying program/machine?

  5. What's the point? by cdf12345 · · Score: 1

    this seems pointless

    The problem is that these machines are being programmed to play against 1 opponent, and are being fed data about that player's past games, habits, techniques...

    Deep Blue won because it was programmed to defeat Kasparov, and only Kasparov.
    Until a computer is programmed to accept a blind challenge without background information about their opponent, I will continue to be unimpressed.

    --
    Chicago2600.net more than a lifestyle, its a survival trait.
    1. Re:What's the point? by Anonymous Coward · · Score: 3, Funny

      Human chess players never learn about their opponent's behaviors beforehand?

      If you know the computer will know how you will play, you should play in a different way. But the computer will obviously know you will know it knows how you play, and thus expect this. As a result, you should alter your strategy back to your original. The computer will also realize you will do this though, so you should again try to alter your playing manner.

    2. Re:What's the point? by jackb_guppy · · Score: 1

      Amen!

      When they change the program nightly to adjust for his play, he was not playing against the computer but 6 hidden people.

    3. Re:What's the point? by MxTxL · · Score: 3, Interesting

      My father has been a chess fanatic for years upon years. He's read books upon books and is really good. He can beat any mere mortal that he plays. There are a bunch of people on Yahoo! games and other online chess networks that he can play and can compete with, but they are a distinct minority... it comes down to the rankings. Point is, my dad is really good.

      There was a chess program for the Vic 20 that could whip my dad's ass every time. Machines have been whipping general players asses for a very long time. My dad is really good but for all of that my dad is still an amateur and could never hope to make a showing in a real competition. It's only the great grandmasters that give the machines trouble... these grandmasters are several orders of magnitude better than the amateur players like my father and are far better than most pros. It says a *LOT* that a machine is able to beat someone like Kasparov... even knowing his moves ahead of time.

      It's true that the machine was made just to beat kasparov, but that was probably from a lack of programmer time..... it could be programmed the same, and a Bobby Fisher module added, and a Karpov module and a Kramnik module and so on.

    4. Re:What's the point? by mpsmps · · Score: 1

      What's your point? No grandmaster ever plays a serious game without reviewing all of their opponents recent past games from a computer database. Are you suggesting the machines shouldn't do the same?

    5. Re:What's the point? by kspiteri · · Score: 1

      The largest advantage Deep Blue had was that while its programmers could analyse all Kasparov's games, Deep Blue never played any competitive chess. Kasparov had to play against an unknown opponent, and had no chance of observing its style/weeknesses.

    6. Re:What's the point? by Anonymous Coward · · Score: 0

      Score 1??

    7. Re:What's the point? by Anonymous Coward · · Score: 0

      I'm what you'd call a "good average" player, but I could beat just about all of the chess computers you'd find in a shop up until a few years ago. Reason is that I knew they largely relied on brute force type algorithms and didn't do well in evaluating positions, so I'd steer the game away from wild tactical stuff where the machine had an advantage, and steer them towards really quiet positional games. That's where I had the advantage; at that time, most humans had an advantage over machines in these scenarios, as you can rely on "feel for the game" and standard principles like gaining space, not leaving isolated pawns, etc.

      At a guess, I'd have beaten the machine that beat your Dad most of the time, but it sounds like your Dad could well have kicked my arse. It's just a question of knowing your opponent.

      These days, chess computers have more strategic knowledge "built in" via better positional evaluation algorithms, and enough CPU grunt to be able to calculate X moves ahead in even the quietest games. Putting it another way, they'd kill me now.

    8. Re:What's the point? by RockyJSquirel · · Score: 1

      I remember the Vic 20.

      Anyway if your dad knew a little about computer chess then he would have had no trouble beating the Vic, since the Vic didn't have enough memory for a hash table and so would have been incompetent in all end games. You see in the end game when there are very few pieces on the board, a human can figure out the invariants in the position and look many more moves ahead, or even use end game principles and not look ahead at all.

      The trick for a computer is that in a end game, you see the same board configurations over and over again in the search tree, so that if the program makes a table of all of the positions its already evaluated it can look many moves deeper than it could without a hash table (I don't remember how deep, maybe 4 to 6 times as deep).

      I'm terrible at chess, but I can still beat programs that run in very little memory by trading away all of my pieces as quickly as possible and blasting the poor program in the end game.

      I won't say that doing that is any fun though.

      Rocky J. Squirrel

    9. Re:What's the point? by Anonymous Coward · · Score: 0

      Kasparov never had the chance to see Deep Blue play. It's almost like a football team getting another team's playbook and learning all the plays before playing them. Even if the team 2 knows in advance that team 1 has their plays, they're still at a serious disadvantage.

    10. Re:What's the point? by kammat · · Score: 1

      (With much apologies to the original quote)

      "... but you should know better than to use the Sicilian Defence when DEATH is on the line! HAHAHAHAHAHAHAHAHAHAHAHAHA*urk*"

    11. Re:What's the point? by Skuto · · Score: 2

      >The problem is that these machines are being
      >programmed to play against 1 opponent, and are
      >being fed data about that player's past games,
      >habits, techniques...

      This gets posted at least 10 times a story like this hits /., and everybody keeps moaning it, but it's just patently false.

      Programs like Fritz, Junior and even Deep Blue are tuned to perform as well as possible against a wide range of testing opponents or known testpositions.

      You can't just feed the computer some games from it's future opponent and have it magically adapt itself to this. About the only thing that is done in reality is to have the computer play into an opening that it is know to play well. For a human vs computer match, this just means trying to get an open position where tactics become predominant over longtime strategy.

      And that is independent of whether you're playing Kramnik, Kasparov, Anand. It's the same for any human opponent.

      --
      GCP

  6. That seemed further than Third. by TD_3G · · Score: 1

    I wonder if that other boy was just refreshing all night.... We assume that the slash-dot effect is not from sheer mass of users but from the fact that they habitually find themselves refreshing pages, as if they can get first post anywhere.

    But to stay on topic, I think the most amazing thing about this is that given point value systems, which do exist in chess, or the simple idea of "how to win" the more advanced technology gets the better they are going to become. It won't be long till computers can be programmed and run efficiently code that allows them to add up all possible endings for a single game of chess since the first moves and then calculate which would be the best move to make based upon how many endings turn out in favor of the computer. Where did that Fischer boy go to?

    --
    ...
    1. Re:That seemed further than Third. by fatbastard10101 · · Score: 1

      Bobby Fischer is still in seclusion, despite some rumors last year that he was playing grandmasters online anonymously. He is, by all reports, even more bizarre than before. Here are some transcripts of his interviews about being persecuted by some Jewish conspiracy.
      http://www.everything2.com/index.pl?n ode_id=785448
      http://www.everything2.com/index.pl?node_id=1214 00 6

      In re: your comments on the evolution of chess, you are probably right. Computers will become stupid fast and will be able to defeat any human (not just a specific target) through brute force. But chess will still be fun for humans, and will be an especially good tool for preparing young minds. Plus, there will be increased popularity in chess variants, such as Fischer random (http://www.everything2.com/index.pl?&node_id=1102 235) and others.

    2. Re:That seemed further than Third. by fatbastard10101 · · Score: 1

      I also read that Fischer could be arrested if he returned to the U.S.A. for violating U.S. sanctions on Yugoslavia by playing Spassky there in '92.

    3. Re:That seemed further than Third. by A55M0NKEY · · Score: 1

      I read in a comment that since computations must take a certain minimum energy, just to power a laptop during the computation of all the possible games of chess you would have to convert the mass of jupiter to pure energy.

      --

      Eat at Joe's.

  7. Jerusalem? by Pig+Hogger · · Score: 0, Offtopic

    How long before some Hamas logic-bomb virus detonates itself in the computer????

    1. Re:Jerusalem? by Anonymous Coward · · Score: 0

      How long before the israelis call the building a "weapons factory" and blow it up with american blombs and then build a colony on top of it's ruins?

    2. Re:Jerusalem? by Anonymous Coward · · Score: 0

      Fighting a tyranical oppressor in an attempt to free your people seems rather logical to me...

  8. Kasparov vs. Deep Blue... by Wakko+Warner · · Score: 1

    Here's what happens when you give a concert at MIT and need something to talk about.

    - A.P.

    --
    "Remember when the U.S. had a drug problem, and then we declared a War On Drugs, and now you can't buy drugs anymore?"
  9. Just a matter of time... by RallyNick · · Score: 1

    Human brain doesn't develop, or maybe it does it very slowly. Machine speed doubles every so often. You've got a flat line and an exponential. Sooner or later they will intersect, and after that it's all hopeles... Is it news?

    1. Re:Just a matter of time... by Anonymous Coward · · Score: 0

      Yes, the point at which it happens is news, because shortly after, WE WILL ALL BE ENSLAVED BY OUR NEW COMPUTER OVERLORDS!!! We must merge with computers before they take over.

    2. Re:Just a matter of time... by Anonymous Coward · · Score: 0

      hm, maybe the human brain only develops very slowly, but human knowledge grows exponentially.

    3. Re:Just a matter of time... by Anonymous Coward · · Score: 0

      And hammers and screwdrivers will autonomously begin to build houses.

    4. Re:Just a matter of time... by Anonymous Coward · · Score: 0

      the ability to learn!=speed. Artificial intelligence is the like the alchemists goal of turning lead into gold, it just can't be done.

    5. Re:Just a matter of time... by RallyNick · · Score: 1

      true, and memory doubles every so often too.

  10. Deep Blue = Unfair by asv108 · · Score: 2
    IANACP (I am not a Chess Player)

    But I do remember quite a few people criticizing the Deep Blue stunt because IBM trained Deep Blue by examining every Kasparov match on record. Kasparov had no idea what to expect since Deep Blue never played anyone else. Did Deep Blue every play any other grandmasters?

    1. Re:Deep Blue = Unfair by jjohnson · · Score: 2, Insightful

      Prior to Kasparov's match, Deep Blue hadn't played any significant chess players in matches (though I believe there was a consulting grandmaster).

      At any rate, they could have provided Kasparov with a history of Deep Blue's games against other computers; they could also have provided Kasparov with Deep Blue's analyses of other match games. Either would have been easy to produce, and given Kasparov ample material to study.

      I suspect Kasparov's arrogance led him not even to ask for such. He certainly didn't seem to take the match itself seriously (a mistake Kramnik is not repeating), and I don't recall hearing that Kasparov was explicitly denied those materials.

      --
      Anyone who loves or hates any language, platform, or manufacturer, doesn't know what they're talking about.
    2. Re:Deep Blue = Unfair by spotter · · Score: 2

      I also think they tinkered with it during the match, which annoyed kasparov, as the program that started the match wasnt the same as the one at the end.

    3. Re:Deep Blue = Unfair by haystor · · Score: 1
      I suspect Kasparov's arrogance led him not even to ask for such. He certainly didn't seem to take the match itself seriously (a mistake Kramnik is not repeating), and I don't recall hearing that Kasparov was explicitly denied those materials.

      At the time of this match there was a split in the international chess community. Kasparov and a few of the other top rated players had taken off on their own and recognized Kasparov as World Champion. FIDE said that he abdicated and declared someone else champion. My theory is that IBM used this rift to dictate the terms of the match. Basically that if Kasparov didn't agree to play the 6 game match without ever having seen a game by Deep Blue then they would put their millions of dollars of advertising behind another chess player and promote him as the chess champion in their commercials.

      --
      t
    4. Re:Deep Blue = Unfair by Slowping · · Score: 1, Informative

      I don't know if Deep Blue was altered during the match, but I do know that Deep Blue pretty much beat every other grand master on the planet getting to Kasparov. Deep Blue had to fight his way there like any other challenger.

      --
      (\(\
      (^.^)
      (")")
      *beware the cute-bunny virus
    5. Re:Deep Blue = Unfair by Sheridan · · Score: 1
      No it didn't.

      This wasn't the final of a competition such as the World Championship. It was a specifically arranged one-off match between a named pair of opponents (Kasparov and Deep Blue). There weren't any "qualification" stages through which Deep Blue had to make it to play this match. The match with Kasparov went ahead because a sponsor was willing to put up a $1.1 million prize fund to see these two players in a match.

    6. Re:Deep Blue = Unfair by Anonymous Coward · · Score: 0

      Instead of pulling lies out of your ass, might I suggest you quietly shut up and enlighten yourself on the matter first?

    7. Re:Deep Blue = Unfair by Bert+Peers · · Score: 2
      What's kind of interesting though is that in his interviews, Kasparov always places a great emphasis on "match preparation" himself. He always goes on and on about how he has these laptops with millions of moves in it, so that when he knows his opponent has a tendency to use a certain set of openings, he goes to his DB and studies those variations.


      So far, no interviewer I've seen has had the balls to ask the imho logical next question : is it really Kasparov that is such a great chess player, or is it specifically the combo Kasparov + the-database-laptop ? Suppose Kasparov wins, can we really say that the human beats the machine ? From the interviews, I get the impression that he wouldn't be half as strong if he didn't have his machines to fall back to, cyborg style.

    8. Re:Deep Blue = Unfair by Skuto · · Score: 1

      The predecessors of Deep Blue 2 (Deep Though, Deep Thought II, Deep Blue I) played public games which were available to Kasparov.

      Deep Blue 2 was barely finished in time for the match, so they had simply nothing that they could give to Kasparov.

      The whole fuzz about Deep Blue being specifically trained against Kasparov is nonsense. The machine played the best chess it could, regardless of the opponent. The only thing that was taylored was the opening book, which is nothing to complain about for Kasparov considering he is famous for doing the same.

      Realistically, all of that was just whining by an poor loser. I wonder if he'll pull the same stint in the unlikely even Junior wins.

      --
      GCP

    9. Re:Deep Blue = Unfair by Anonymous Coward · · Score: 1, Insightful

      The Laptop must be a great help to be sure, but he is that good. When he actually plays, he doesn't have access to the lap top (he only uses it during prep time). His opponents may have similar data bases and they all do considerable analysis of various positions including the openings and end game, because certain patterns frequently appear there that cannot be analyzed properly during a game due to time constraints.

    10. Re:Deep Blue = Unfair by Portfolio · · Score: 1

      Mod this up. This is the one out of a hundred posts that has the facts right.

      Although it was quite an achievement in Deep Blue to implement a tuned, parallel chess evaluation function and 4-ply search in silicon, it would be an even greater achievement to understand Kasparov well enough to construct an opponent model of him for use in a chess program. It is notoriously hard to tune a chess program for a particular style, much less to play well against the style of a particular opponent. Much of the observable style of a chess program is emergent behaviour based on subtle differences in hundreds of coefficients down in the evaluation function.

      I do believe IBM was unfair to the chess community in mothballing the system after its final match. IBM only saw Deep Blue as a successful marketing promotion, which could only be devalued by risking losses in further competition. Quite a far cry from all preceding chess program research, in which the researchers were eager to test their programs' mettle. As far as I know, Deep Blue has only played one private match with another computer (a version of Genius), although there are many annual computer chess competitions.

  11. who am i rooting for? by zephc · · Score: 2

    all i can say is "GO BANANA!"

    (simpson's reference)

    --
    "I would say that 99 per cent of what my father has written about his own life is false." - L. Ron Hubbard Jr.
    1. Re:who am i rooting for? by shepd · · Score: 1

      >all i can say is "GO BANANA!"

      Well, I'd like to suggest, "GO STINKY!", or "Go Washing Machine!", but hey, that's just me and my waste of brain donated to the Simpsons.

      --
      If you could be told what you can see or read, then it follows that you could be told what to say or think - BoC
    2. Re:who am i rooting for? by Anonymous Coward · · Score: 0

      You *know* I'm the potato man!

  12. Man-Canine World Championship by Ridge · · Score: 1, Funny

    In a related note, tomorrow I'll be playing Deep Poo for the Man-Canine World Championship.

    Although I am unranked, I'm not overly nervous as my dog Poo licks her butt. Unfortunately, our last match ended in a draw when Poo decided that my queen looked mighty tasty. Luckily, I was able to recover said queen from Poo's poo in the neighbor's yard. I hosed it down pretty well and we should be able to begin anew tomorrow.

  13. Vaporware by Rubyflame · · Score: 1

    I think Slashdot has had stories about the upcoming Kramnik-Fritz match for over a year now, and there have been at least four of them. Is this match ever going to actually happen, or what?

    --

    All it takes is nukes and nerves.
  14. Game Theory by papasui · · Score: 2

    I know some people who believe that being able to play the perfect game of Chess will fundamentally change the world because they will be able to relate the strategy used in Chess to the real world. Unfortunetly this only would work should the rules of the game stay constant, in the real world rules will change and an adapative algorithm will be needed to properly evaluate a given situation.

    1. Re:Game Theory by Anonymous Coward · · Score: 0

      I know some people who believe that being able to play the perfect game of Chess will fundamentally change the world because they will be able to relate the strategy used in Chess to the real world. Unfortunetly this only would work should the rules of the game stay constant, in the real world rules will change and an adapative algorithm will be needed to properly evaluate a given situation.

      Thank you, Captain Obvious. What moron modded this up?

    2. Re:Game Theory by Anonymous Coward · · Score: 0

      It is not modded up (at least at the time you and I wrote about it), you moron.

  15. Shall we play a game? by Diclophis · · Score: 1, Interesting

    Why not put the best 2 chess playing machines against one another... will they both short circuit like the 'WHOPPER' in wargames?

    1. Re:Shall we play a game? by Anonymous Coward · · Score: 0

      It was WOPR

    2. Re:Shall we play a game? by God!+Awful · · Score: 1


      It was WOPR

      That's true, but it was definitely pronounced "Whopper", since it was modelled after a real defense department computer named BURGR.

      -a

    3. Re:Shall we play a game? by Anonymous Coward · · Score: 0

      Umm, why not just play the best program/machine against itself?

      And no, if you play something like REBEL against itself, it will manage to beat itself without any pattern I can discern.

      Anyway, the old (and terrible) joke goes:
      "Two robots are playing chess, clocked at 60 minutes for the game. First one waits 59 minutes and 59 seconds, moves a pawn, and declares that he wins. The other robot thinks for 59 minutes and 59 seconds, turns over its king, and says 'I agree'".

    4. Re:Shall we play a game? by keller · · Score: 1

      In Wargames The computer was playing against itself, and came to the insight that it would never be able to win. Therefore it eventually stopped playing. It didn't shortcirciut or anything.
      But an important point in this was that it was an AI as opposed to a dumb Chess program, which would just be playing the exact same game everytime!

      --

      Enig? Det alt for hot det smor!

    5. Re:Shall we play a game? by ranger8x · · Score: 0

      computers will play a variety of openings from thier opening book. Most opening books are pretty large, and lead to open ended positions. The games would rarely be duplicates.

  16. Actually you are wrong... by Anonymous Coward · · Score: 1, Insightful

    While Deep Blue was programmed to beat Kasparov Fritz and Deep Junior were not programmed specifically for these matches. Minor things like their opening books may be altered, but the programs will be the same ones released to the general public.

  17. I find it interesting... by RALE007 · · Score: 1

    ...that they have a separate blue program for each human player. It is well known that the AI is programmed to beat the specific chess player it is going against. Old news. What will be interesting is if they come up with a chess AI to take on and beat any grandmaster. What if sports were played like this for example? "If I pit team A against team B, I know A will win. If I pit team C against D, I know C will win etc. Thus I win the superbowl/world series/whatever using 10 different teams dependant on the situation." Sounds goofy. What will be interesting is when they have a one size fits all deep program that does more than the current slew of programs that only target individuals.

    --
    Beware blue cats moving at .99c
    1. Re:I find it interesting... by PerryMason · · Score: 2, Insightful

      Not to debunk your entire post but....

      If a human grandmaster is about to play Gary Kasaparov for instance, do you think he's likely to study as much about the way that Kasparov plays? Its just that the in this case the computer is able to forget the rest and _only_ focus on Kasparov's style. In any competition you would be foolish not to gain as much knowledge about your competition.

      As for having multiple teams to win the Superbowl, ever heard of offense and defense and special teams. Its just an example of using the team that is most likely to win the play, or the game or whatever, it just so happens that these teams are all part of a larger team.

      Its called specialisation and its pretty much what enabled us (humankind) to give up nomadic existence and focus on doing wonderful things like making chess playing computers and reading Slashdot instead of working.

      --
      "I'm tired of all this 'Aren't humanity great' bullshit. We're a virus with shoes" - Bill Hicks
    2. Re:I find it interesting... by Anonymous Coward · · Score: 2, Interesting

      Umm, there is a plethora of programs out there which manage to beat all but the "super grand masters". Programs such as Crafty are able to beat practically any human in lightening and blitz games, and hold their own very well in standard games.

      Take for example the reports of "Fischer" on the Internet, beating Nigel Short after giving away what amounts to a 10 move advantage. There is no way a human can give such a highly ranked player such an advantage in a blitz game and win so convincinly, it was obviously a bot running on the Crafty engine (or something similar), beating the crap out of Short.

      So yes, there are general engines out there which are very highly rated and can beat 85% to 90% of grand masters.

  18. Apples and oranges.... by Rooked_One · · Score: 3, Interesting

    Humans and computers don't play chess the same way. The grandmasters can forsee, what is it like 10 of every move into the game, while the computer can see every move forseeable. I've never been a big fan of playing computers in chess, and that goes way back to the old battle chess game.... remember that one, where your characters would duke it out when a player made a capture? Anyways, I was able to beat that one a couple times, but mostly it totally wooped my ass for the simple fact I was 10, didn't have much *game* and lacked the mental capacity to see 100 moves into the game. IMO, the computer should be limited to a set amount of moves and time, and should have to consider which moves it should concentrate on, instead of looking at every single move possible. I'd also like some randomization in the game.

    1. Re:Apples and oranges.... by Anonymous Coward · · Score: 0

      If you want randomization check out Fischer Random. The pieces are set up differently each time. I think you can play it on ICC (chessclub.com) or FICS (freechess.org).

    2. Re:Apples and oranges.... by kspiteri · · Score: 1

      Actually, computers do not use just brute force, they do choose the best set of moves to concentrate about. The difference is that this set is much larger for a computer than for a human. As for random, it is a must. Otherwise all an opponent would need to win would be to remember JUST ONE way the computer was defeated and repeat the moves.

    3. Re:Apples and oranges.... by drix · · Score: 3, Insightful

      That is a popular myth that is usually not true. While I have no doubt that any human on this planet who has attained the level of grandmaster can see 10 moves out, most of them aren't wasting the brainpower to do so. Not until at least well into the midgame when things are opening up and combinations are starting to emerge. By and large, great chess players rely on their superior knowledge of positional play and tactics to win games. This is how great players can often look at a board and instantly tell you who has the upper hand and what the correct move is. If you've ever seen an master play 20 games at once--circling around the room, staring at each board for a few seconds, then moving--it's obvious that he's relying on tactical & positional intuition, not brute-force analysis. As if to drive home this point, American GM Koltanowski famously played 56 games at once while blindfolded in 1960 and still managed to win almost all of them.

      --

      I think there is a world market for maybe five personal web logs.
    4. Re:Apples and oranges.... by Anonymous Coward · · Score: 0

      A computer is not capable of seeing every move, because such a search is intractable. What computers do is search to a depth. The faster the computer, the deeper the depth. If a computer could search through all moves, IBM would not have needed to code info. into deep blue about Kasparov's playing habits.

    5. Re:Apples and oranges.... by klparrot · · Score: 1
      Chess tournaments are generally time-limited, and this does prevent a computer from forseeing all possible sequences of moves.

      At the start of a game, forseeing all possible sequences of moves means forseeing all possible games. There are trillions of possibilities. Computing them would take a while, and tracking them would take an obscene amount of memory.

      What would take even longer is deciding which sequence of moves to make. Going with simple probability doesn't work; a path with "50% win chances" probably really means a loss unless the opponent does something stupid.

      I'm not sure exactly how chess computers calculate their moves, but I do know that there's more to it than simply evaluating all possible sequences of moves. Sorry, I don't think Battle Chess was looking even 100 moves ahead to beat you, that would take far too much processing to be feasible on your old 286 (or whatever you were running it on). Even Deep Blue takes time to make its decisions (although its decisions will be a lot better).

      Chess computers do concentrate on certain moves, and they perform complex processing to determine which of those moves to make. The decisions have to be based on the other player's style (and yes, some randomization) to be effective. Even so, I don't think a win could be guaranteed. Aren't chess games in NP?

    6. Re:Apples and oranges.... by sockmonkeybob · · Score: 1

      There are some great misconceptions here that should be cleared up. Depending on the position on the board, a GM can see X Number of moves ahead. Generally though, this is not the case. Creativity, intuition, past experience, 1,000's of past games all come into play. Generally, a GM will get a general idea of what is going on in the position, figure out where IMBALANCES on the board exist and then calculate a way to take advantage of them, or how to defend against them depending. The computer however, is not creative. It is a brute force machine that looks for tactics and some positional moves. However, it will never be able to be as creative or resourceful as a human player... In this case of the Kramnik match... Kramnik will kill the beast badly. While Kasparov is generally a tactical, aggressive player, Kramnik is more content in positional/creative battles. It will be interesting to see Kramnik confuse the program. Expect Isolated Queen Pawn positions, and the horizion effect of the computer having huge ramifications on the match... --RPR

  19. Someone posts a chess computer story... by Howzer · · Score: 5, Insightful
    ... and you instantly get a bunch of posts about how it's "not that impressive because the computer is trained to beat just that player".

    Well, here's a heads up. That is exactly how human players prepare for matches against each other. They sit down and play through their opponents previous matches, and try to find weaknesses and holes to use against them.

    The point of all this is equally questioned. People seem to think that creating large expert systems is a done deal, and no more research needs to be done into how to construct programs that use a set of variables to give advice, in this case which chess piece to move. Again, here's a clue:

    This kind of stuff is fundamental, basic research. Absolutely vital and incredibly useful as we continue to learn about how to better realise and utilise computer technology.

    Insert old saw about dogs walking here.

  20. A great hollow victory by CresentCityRon · · Score: 2, Interesting

    Who knows who the world champion is in chess? There is all that politcal garbage out there with FIDE and rankings. Bah!

    And as far a computer beating a human? Its just not that interesting a problem anymore. Especially when Ken Thompson (of UNIX fame) showed 20 years ago that brute force searches was the way to create a winning system against a human. Not very sporting. A great book on this was "Chess Skill in Man and Machine" edited by Peter Frey.

    Its fun to watch humans race each other. Its boring to watch a human race a car. I think the same holds with humans, computers and chess competition.

    1. Re:A great hollow victory by shepd · · Score: 1

      >Its boring to watch a human race a car.

      That really depends on where the human is standing at the time. I think with the person in the right position this could be far more interesting than any other competition I've ever seen.

      --
      If you could be told what you can see or read, then it follows that you could be told what to say or think - BoC
    2. Re:A great hollow victory by ranger8x · · Score: 0
      >Its boring to watch a human race a car.

      It's not boring when the human wins once and ties 3 times out of 6 races with a car.

      [Kasparov took game 1 and drew games 3, 4 and 5 during the 1997 rematch with Deep Blue]

  21. Could Deep Junior be easily distributed? by jukal · · Score: 2

    I have not paid any attention to this, but does someone know whether it would be feasible to base a massively distributed chess engine on the Deep Junior basis? When we were thinking about continuation to the RC5-56 chall this was one thing which we considered. Could it be the time now, or is there already a lot of such projects - or maybe there is even already a category for such monsters :)

    1. Re:Could Deep Junior be easily distributed? by Skuto · · Score: 1

      >I have not paid any attention to this, but does
      >someone know whether it would be feasible to base a
      >massively distributed chess engine on the Deep
      >Junior basis

      It's pretty much impossible. Latency is essential for parallel chess algorithms. Even using a cluster is already problematic.

      --
      GCP

    2. Re:Could Deep Junior be easily distributed? by Anonymous Coward · · Score: 0

      You neglect the possiblity of building a rather huge database...one machine could do the simple forking for a two-ply search, and then hand off the work for plies three-and-four to other machines, and infinitum.

      Yes, there would be lag, but hopefully in the log run you'd have the game figured out in advance and could share that knowledge.

      However, the frequent RPC would be much harder and not in tune with what distributed.net does

      perhaps we should just work on solving chess, a la what Chinook is doing for checkers

    3. Re:Could Deep Junior be easily distributed? by Skuto · · Score: 1

      >You neglect the possiblity of building a rather
      >huge database...one machine could do the simple
      >forking for a two-ply search, and then hand off the
      >work for plies three-and-four to other machines,
      >and infinitum.

      This doesn't work due to the nature of the search algorithm used. The question was whether Deep Junior could be easily distributed. The answer is no. That doesn't mean you cannot try to make a distributed solver for chess in another way.

      --
      GCP

  22. Even if Garry Loses by jchawk · · Score: 2

    He is still going to make a ton of money!!!

    Block Quote

    "The six games will be played at the classical time control and the prize fund is that roundest of big round numbers, one million dollars. (Kasparov gets half a million up front and the other half is split 60/40 winner/loser. Ka-ching! Garry is definitely paying for dinner next time.)"

    End Quote.

    So Garry is getting at least 700,000 just for showing up. Man I wish I were that guy.

  23. Go Humans! Whoo-whee! by RumGunner · · Score: 1, Troll

    I have a feeling we'll all be screaming that more and more as things progress.

    .

  24. Could be great IBM PR by Tablizer · · Score: 2

    IBM is gonna look pretty good if both humans cream these beasts due to memories of Beep Blue.

  25. Kasparov's Secret Weapon by guttentag · · Score: 3, Funny
    Rumor has it Kasparov's secret weapon this time around is a bucket of salt water -- with which he will drench both himself and his opponent so no one can accuse him of not playing fairly.

    If that fails, he plans to challenge his opponent to a "Double or Nothing" drinking contest at a local bar.

    1. Re:Kasparov's Secret Weapon by bckspc · · Score: 2
      If that fails, he plans to challenge his opponent to a "Double or Nothing" drinking contest at a local bar.

      Aaaaawww yeah - it's chess Russian style!

    2. Re:Kasparov's Secret Weapon by Anomaly+Coward · · Score: 0

      ... Which very quickly resulted in a draw - Kasparov and the computer both suffering a fatal short-circuit.

  26. Re:Someone posts a chess computer story... by Anonymous Coward · · Score: 0

    "This kind of stuff is fundamental, basic research."

    What a crock. This accomplishment is equivalent to saying the computer can count faster than a human and nothing more.

  27. Obligatory War Games Reference... by taernim · · Score: 1

    <WOPR computerized voice> Greetings, Kasparov.
    Would.. you.. like... to play... a game? </WOPR computerized voice>

    --
    "PC Load Letter? What the $@#% does that mean?!"
  28. Another article on Kasparov vs. Junior by haggar · · Score: 4, Informative

    this was puglished yesterday in haaretzdaily.com. It has some interesting details like, for example, the track record of Junior, to this date, and that the competition will have a peace-builing slant to it, too.

    --
    Sigged!
  29. Good measure of system performance by csnydermvpsoft · · Score: 1

    From an AI standpoint, chess is actually fairly easy - the AI looks ahead as many moves as possible, "thinking" about every single possible move in the time it has. This makes chess playing a very good measure of overall system performance, since the faster the system is, the more moves it can figure in the time it has available. There are some optimisations that can be done to weed out obviously bad moves, but on a whole it's fairly brute-force computing.

  30. Re:Someone posts a chess computer story... by Howzer · · Score: 2
    You said: What a crock. This accomplishment is equivalent to saying the computer can count faster than a human and nothing more.

    Maybe if you were, say, a programmer or a computer professional, or maybe even had read an IT industry magazine at some point you would understand a little about the fundamentals of this discussion.

    This has nothing to do with "computers counting faster" and everything to do with expert systems, that is programming computers to make "clever" decisions based on states. If this was just brute-force then why do you think it costs so much money to put together one of these systems? Because they have teams of programmers and serious hardware. More hardware than is needed for a brute-force approach, actually, so what's all the extra hardware doing? If you think this is all as easy as that one class you took in highschool where you typed:

    10 PRINT "Hello!"
    20 GOTO 10

    and then laughed in that odd, shrieking way you have, then you really should get hit with the clue stick.

  31. NOT impressive by madenosine · · Score: 2, Interesting

    I'm a chess fan, but I dont see any point in the computer vs. human matches. these "AI" chess playing computers simply look at threes and a database of good/common moves. real AI doesnt use trees (too many possibilities)

    IBM even trained deep blue for kasparov, but kasparov never got a chance to play deep blue so could not have any idea of weaknesses in it's game (eg positions not in its database where it would have to waste time looking at the move tree.) which forced him to play very nonstandard games and use styles he is not used to using

    to me, the fact that deep blue took kasparov does not mean anything except that kasparov is a truly amazing player (who else can compete against a super-comptuer programmed by computer scientists at a top corporation created soley to beat them?)

    even more amazing is that kasparov only lost the series on a game where he was completely off

    1. Re:NOT impressive by Skuto · · Score: 2

      >real AI doesnt use trees (too many possibilities)

      Define real AI then.

      A chessplayer also explores a tree of variations in his head.

      The difference is that they have much more selective heuristics (which moves not to look at) and usually a better esimatation of who is better (evaluation).

      This is also exactly the area where computers have been making progress. More selectivity (so they can look deeper and at more crucial variations) and a better assesement of the board position.

      --
      GCP

  32. Eh, kinda... by Jayde+Stargunner · · Score: 5, Funny

    Only if the human really doesn't talk about anything in particular, and expects a meaningful response. ALICE cannot give meaningful responces.

    ALICE would probably make a good CEO, rather than a conversation tool.

    CEOBot: What would you like to know?
    Interviewer: What were your profits this year?
    CEOBot: What would you like to know about our profits this year?
    Interviewer: How much were they?
    CEOBot: How much do you think they were?
    Interviewer: Well, you claimed 22billion.
    CEOBot: I'm afraid I really don't know anything about that. Would you like me to sing you a song?

    -Jayde

    --
    What's a sig?
    1. Re:Eh, kinda... by muzzmac · · Score: 1

      Perhaps the bastard operator from hell could forward his online responses to an ALICE robot. :-)

  33. Chess-playing research seems to be a dead end by Goonie · · Score: 3, Interesting
    In the early days of AI research, it was believed that building chess-playing machines might give an insight into how to construct more general problem-solving tools.

    That hasn't turned out to be the case. The search algorithms that the chess-playing programs use don't appear to be any great use for anything except playing chess (or closely related games like go or checkers).

    Personally, I want to see a computer kick Kasparov's and Kramnik's ass (though I'm unconvinced it's going to happen this time around, it certainly will eventually) so that chess players shut up about defending the honor of humanity or some such rubbish. Knowing a little about how chess-playing programs work, I feel about as threatened by the prospect that the world chess champion can be trounced by a computer than the fact that in one second the PC I'm typing this at can do more arithmetic operations than I'll do in a lifetime.

    --

    Any sufficiently advanced technology is indistinguishable from a rigged demo
    --Andy Finkel (J. Klass?)
    1. Re:Chess-playing research seems to be a dead end by Howzer · · Score: 1
      I would say that that the research is still at the basic stage, because essentially creating these software "super tools" is a hard problem.

      I do see your point, though, and you may well be right. Time will tell.

    2. Re:Chess-playing research seems to be a dead end by Anonymous Coward · · Score: 0
      Games of abstract competition such as chess and Go have captivated the mind for as long as civilization has existed; likewise, game playing is one of the oldest fields of artificial intelligence. Within the field of AI, chess has received the majority of attention and has been the subject of considerable progress in recent times. In May of 1997, IBM's Deep Blue Supercomputer defeated world chess champion Gary Kasparov in a six-game match. The victory proved that computers could compete successfully against humans, but Deep Blue played brilliant moves for unintelligent reasons. Almost all of the computer's power rested in the fact that it could search ahead 200 million moves in less than a second. Every bit of chess knowledge Deep Blue knew had to be spoon-fed to it by chess Grandmasters; the computer was incapable of learning anything on its own. On the other hand, this project examined ways of creating a program which, without being spoon-fed knowledge, could intelligently play two challenging games of strategy and foresight: Mancala and Abalone.

      A traditional AI game had to be developed along with a genetic algorithm to enable the program to learn from its successes and errors. First, a program was developed which could play using predefined strategies. Once a strategy was assigned, the program used a search tree to decide which move to make. This program was successful, provided that the programmer chose the correct strategy. To enable the game to choose its own strategy, a genetic algorithm was added. Using the genetic algorithm, the program could play several games, compare the results, and developed a new strategy using the most desirable results of the previous games. The program could then play against itself starting with random strategies until the best possible strategy developed.

    3. Re:Chess-playing research seems to be a dead end by TGK · · Score: 2

      I think it would be facinating to see/design a program which is designed to play ranked chess champions.

      Give it the name of the player it's about to play. The software connects to a number of databases, finds the matches in some machine readable code (yea... well... we need that part first I guess) and then "studies" them. Use pattern recognition and a neural net to learn how the opponent thinks etc.

      I think that would lend more credibility to the argument of computers as valid players as well. Afterall, that way they'd be doing their own research.

      Of course, that could be the way it is now and I could be completely clueless.

      --
      Killfile(TGK)
      No trees were killed in the creation of this post. However, many electrons were inconvenienced.
    4. Re:Chess-playing research seems to be a dead end by NorthDude · · Score: 1

      Well, I used to play chess a lot when I was still at college.
      I bought ChessMaster 6000 (or 5000?) at this time so I could play over modem with my friends.
      Well the ChessMaster could simulate real top-ranked player.
      It was not exactly the same, but it was immitating their style pretty well (opening, Closure, some attacks...)...

      --


      I'd rather be sailing...
  34. Go by .com+b4+.storm · · Score: 4, Interesting

    Slightly OT, but...

    I'm more interested in seeing someone write a strong Go opponent. It's pretty obvious that chess is rather simple for a powerful computer to brute force, but even the most sophisticated hardware and software can be beaten by an amateur Go player. The strongest Go programs rate at around the 8-kyu level (Go ratings start at 30-kyu for complete beginners, on up to 1-kyu, then from 1-dan to 9-dan for pro players).

    There have been cash awards (on the order of a million dollars in at least one instance) put out on the table for developers who could write a Go program capable of beating a certain level player. So far, nobody's succeeded. MindZine has a nice (albeit a bit dated) article explaining why this is.

    When a computer can play a really strong game of Go, I'll be impressed. :)

    --
    "Wow, you're like some kind of superhero able to ward off happiness and success at every turn."
    -- Ryan Stiles
    1. Re:Go by niklaus · · Score: 2, Informative

      Even more OT, but just a slight correction: In the Go rating system, after 1 kyu there is 1 dan - 7 dan amateur, then there's a gap of about 2 stones (difference in rating equals the number of handicap stones required to make a fair game), then come the pros, who don't use handicap, but 1 rank difference among pros is about 1/4 of a stone. So beating a pro player is even harder than in the rating system you describe.

      Also the level of Go programs is to be taken with a grain of salt, because if you play a lot of games against them, even weaker players will discover the weaknesses of the program and exploit them (often playing unorthodox but still not bad moves does the trick), which always works because the programs don't learn from their mistakes.

      For a program to beat a pro player, faster hardware won't be of any use. What's needed is a major breakthrough in AI software technology, which may not happen anytime soon. Also the advantage of brute force looking ahead isn't that great for computers, since professionals routinely read 100 moves ahead (which makes some pro games very hard to understand for a lowly amateur as myself (~12 kyu)).

    2. Re:Go by Sunnan · · Score: 1

      They've been working on chess computers for like a gazillion years. They've been working on go computers for what... since the eighties?

      Chess computers aren't just "mindless bruteforced automatons", but tuned for the player they're going to meet.

      If they would've put in as much energy making a go computer - if go would have been as popular as chess - they would be, well, maybe not as far as chess programs are today (because there are more possible moves in go and it is very different from chess), but almost.

      Face it, as much as I long for the day when go is more popular than chess - currently chess is "the classic game" in many people's (including geeks) minds.

      I saw go players in the park two days ago! Go is spreading!

    3. Re:Go by Eric+Damron · · Score: 2

      I remember a time when I could beat the strongest computer chess program and it was argued that a computer would never be able to beat a master chess player.

      It now takes a tremendous effort and a good deal of luck for me to beat my computer at chess.

      I think that it is only a matter of time and attention before go programs become very strong. Chess programs have recieved far more programming effort than go programs. Give it time and I believe that you WILL be impressed.

      --
      The race isn't always to the swift... but that's the way to bet!
  35. Hm: Chatbots versus Chess Grandmasters? by finnatic · · Score: 1

    Who would win a Turing Test?

  36. ChessBase link to NY Times article on Go by scubacuda · · Score: 2, Offtopic

    Here is an interesting NY Times article that ChessBase linked to.

    (For those who say "fuck that registration shit")

    ***************

    Early in the film "A Beautiful Mind," the mathematician John Nash is seen sitting in a Princeton courtyard, hunched over a playing board covered with small black and white pieces that look like pebbles. He was playing Go, an ancient Asian game. Frustration at losing that game inspired the real Mr. Nash to pursue the mathematics of game theory, research for which he eventually won a Nobel Prize.

    In recent years, computer experts, particularly those specializing in artificial intelligence, have felt the same fascination -- and frustration.

    Programming other board games has been a relative snap. Even chess has succumbed to the power of the processor. Five years ago, a chess-playing computer called Deep Blue not only beat but thoroughly humbled Garry Kasparov, the world champion at the time. That is because chess, while highly complex, can be reduced to a matter of brute force computation.

    Go is different. Deceptively easy to learn, either for a computer or a human, it is a game of such depth and complexity that it can take years for a person to become a strong player. To date, no computer has been able to achieve a skill level beyond that of the casual player.

    The game is played on a board divided into a grid of 19 horizontal and 19 vertical lines. Black and white pieces called stones are placed one at a time on the grid's intersections. The object is to acquire and defend territory by surrounding it with stones.

    Programmers working on Go see it as more accurate than chess in reflecting the ineffable ways in which the human mind works. The challenge of programming a computer to mimic that process goes to the core of artificial intelligence, which involves the study of learning and decision-making, strategic thinking, knowledge representation, pattern recognition and, perhaps most intriguingly, intuition.

    "A good Go player could make a move and other players say, `Yes, that's a good move,' but they can't explain to you why it's a good move, or how they even know it's a good move," said Dr. John McCarthy, a professor emeritus at Stanford University and a pioneer in artificial intelligence.

    Dr. Danny Hillis, a computer designer and chairman of the technology company Applied Minds, said that the depth of Go made it ripe for the kind of scientific progress that comes from studying one example in great detail. "We want the equivalent of a fruit fly to study," Dr. Hillis said. "Chess was the fruit fly for studying logic. Go may be the fruit fly for studying intuition."

    Along with intuition, pattern recognition is a large part of the game. While computers are good at crunching numbers, people are naturally good at matching patterns. Humans can recognize an acquaintance at a glance, even from the back. "Every Go book is filled with advice on patterns of different kinds," Dr. McCarthy said.

    Dr. Daniel Bump, a mathematics professor at Stanford, works on a program called GNU Go in his spare time. "You can very quickly look at a chess game and see if there's some major issue," he said. But to make a decision in Go, he said, players must learn to combine their pattern-matching abilities with the logic and knowledge they have accrued in years of playing.

    "If you watch really strong players," Dr. Bump said, "some seem to make fairly mundane moves, but at the end of the game they're ahead. Others do spectacular things."

    One measure of the challenge the game poses is the performance of Go computer programs. The last five years have yielded incremental improvements but no breakthroughs, said David Fotland, a programmer and chip designer in San Jose, Calif., who created and sells The Many Faces of Go, one of the few commercial Go programs.

    Mr. Fotland's program was the winner of a tournament last weekend in Edmonton, Alberta, that pitted 14 Go-playing programs -- including several from Japan -- against one another. But even The Many Faces of Go is weak enough that most strong players could beat it handily.

    Part of the challenge has to do with processing speed. The typical chess program can evaluate about 300,000 positions per second, and Deep Blue was able to evaluate some 200 million positions per second. By midgame, most Go programs can evaluate only a couple of dozen positions each second, said Anders Kierulf, who wrote a program called SmartGo.

    In the course of a chess game, a player has an average of 25 to 35 moves available. In Go, on the other hand, a player can choose from an average of 240 moves. A Go-playing computer would take about 30,000 years to look as far ahead as Deep Blue can with chess in three seconds, said Michael Reiss, a computer scientist in London.

    If processing power were all there was to it, the solution would be simply a matter of time, since computers are growing ever faster. But the obstacles go much deeper. Not only do Go programs have trouble evaluating positions quickly, they have trouble evaluating them correctly.

    Nonetheless, the allure of computer Go increases as the difficulties it poses encourage programmers to advance basic work in artificial intelligence. Graduate students produce dissertations on the topic, and a handful of researchers around the world devote much or all of their attention to it.

    The game attracts people from all fields. For example, Chen Zhixing, a retired chemistry professor in Guangzhou, China, wrote a program called Handtalk, which dominated the computer Go field for several years. Dr. Bump, 50, whose field is number theory, has been playing Go for 35 years and taught himself the C programming language four years ago so he could write Go software. Mr. Fotland, 44, the creator of The Many Faces of Go has been working on computer Go for 20 years and is chief technology officer at Ubicom, a small semiconductor company in Silicon Valley.

    All are very strong Go players, and it takes a strong Go player to write even a weak Go program. Mr. Fotland, for instance, said he had written programs for checkers, Othello and chess. The algorithms are all very similar, and it is not difficult to write a reasonably strong program, he said. Each of the games took him a year or two to finish. "But when I started on Go," he said, "there was no end to it."

    Mr. Fotland said that his Go programming was especially weak when he was a beginning player. "A lot of the stuff I wrote was just plain wrong because I didn't understand the game well enough," he said.

    Even when skill develops, however, translating it into a program is not an obvious task. "There's a certain stream of consciousness when you're looking at positions," Dr. Bump said. "You might look at 10 variations, but you don't really know what's going on in the back of your mind. Even a strong player doesn't know how his mind works when he looks at a position."

    "We think we have the basics of what we do as humans down pat," Dr. Bump said. "We get up in the morning and make breakfast, but if you tried to program a computer to do that, you'd quickly find that what's simple to you is incredibly difficult for a computer."

    The same is true for Go. "When you're deciding what variations to consider, your subconscious mind is pruning," he said. "It's hard to say how much is going on in your mind to accomplish this pruning, but in a position on the board where I'd look at 10 variations, the computer has to look at thousands, maybe a million positions to come to the same conclusions, or to wrong conclusions."

    Dr. Reiss, who is the author of Go4++, a previous champion that placed second in last weekend's playoff, agrees with Dr. Bump. Dr. Reiss, who is an expert in neural networks, compares a human being's ability to recognize a strong or weak position in Go with the ability to distinguish between an image of a chair and one of a bicycle. Both tasks, he said, are hugely difficult for a computer.

    For that reason, Mr. Fotland said, "writing a strong Go program will teach us more about making computers think like people than writing a strong chess program."

    Dr. Reiss, who works on Go full time, said he would not think of devoting his time to any other problem. "It's a fundamentally interesting problem, but also it's just the right level of difficulty," he said. "If it was too easy it would have been solved already. If it was fantastically difficult, people might give up in frustration."

    "I think in the long run the only way to write a strong Go program is to have it learn from its own mistakes, which is classic A.I., and no one knows how to do that yet," Mr. Fotland said. A few programs have some learning capabilities built into them.

    Mr. Fotland's program, for instance, refers to a database of games played by strong players in deciding its moves, and Dr. Reiss's program employs a learning scheme for deciding which moves are interesting to look at.

    Dr. Reiss said he had come up with an idea for a new Go program that would learn by analyzing professional games. But to pursue his idea would require too much work, he said, depriving him of time to continue making updates to his current program.

    It seems unlikely that a computer will be programmed to drub a strong human player any time soon, Dr. Reiss said. "But it's possible to make an interesting amount of progress, and the problem stays interesting," he said. "I imagine it will be a juicy problem that people talk about for many decades to come."

  37. You believe that? by Anonymous Coward · · Score: 0

    then its easy to conclude that you aree either American or jewish/israeli.

    Most of the civilized world views Israel as thee biggest terrorist in the middle east. Its only brainwashed americans who continue to support Jewish Bullshit in the mid-east.

    1. Re:You believe that? by Anonymous Coward · · Score: 0

      That's not true. But surely there is a strong anti-jewish sentiment, mostly caused by jealousy. Jews have been segregated, persecuted and in all imaginable ways humiliated for thousands of years, mostly because they have a superior intellligence that intimidated most other cultures. The holocaust during WWII is the clear proof of the attitude of most european nations towards Jews. I am not a Jew, but I am ashamed for being european, for what europe did and in some places, still is doing to Jews.

      The rubbish that most of the European media is spewing is certainly influencing the public opinion further, and the UN has never been a freind of the Jewish people. It's too much to ask yo to try and think with your own head, based on facts you collect yourself from several sources, I guess.

    2. Re:You believe that? by Anonymous Coward · · Score: 0

      the original poster is right, Arafat has been cought financing the Al Aqsa brigades, and it's also true that he praises the "martyrs" when he addresses the palestinians, but never when he talks in english. it's a shame bbc (for example) never translates Arafat's arabic speeches. I smell a rat, in that in such editorial approach.

    3. Re:You believe that? by Anonymous Coward · · Score: 0

      Dumb ass, the europeans where bigger supporters of israel than america was...until israel started commiting human rights abuses and war crimes, that's when they stopped supporting israel

  38. Here's a real "what's the point" question: by foo+fighter · · Score: 3, Insightful

    Or maybe more of a "why would you want to":

    Chessbase has several chess programs for sale on their website. While quite inexpensive (~$45-$80 USD) they are advertised as being damn near impossible to beat. In fact, Chessbase's front page highlights one of the programs for sale kicking the ass of the entire Swiss Chess Team!

    So why would you want to actually buy one of these programs? They aren't teaching programs. They aren't for a friendly game against the computer. They aren't open sourced (that I could see) so you can't study the algorithms. They are meant to destroy every human they come in contact with.

    Does anyone outside of chess grand masters use these things? (How many grand masters are there, anyway?) I'm a very mediocre chess player myself, and if I want my ass handed to me in chess I'll go down to the local high school club and call them all smelly virgins before starting a game. At least I'll have some face-to-face interaction.

    So what's the point?

    --
    obviously no deficiencies vs. no obvious deficiencies
    1. Re:Here's a real "what's the point" question: by Dr.+Sp0ng · · Score: 3, Informative

      So why would you want to actually buy one of these programs? They aren't teaching programs. They aren't for a friendly game against the computer. They aren't open sourced (that I could see) so you can't study the algorithms. They are meant to destroy every human they come in contact with.

      Well, Fritz (and other programs) have "analysis" modes, where you can load up a game you played against another person, and it can analyze the game in depth and point out any mistakes or missed opportunities for you. This feature alone makes it worth the $50 they charge you for it.

      True, very few people can beat Fritz head-to-head, but it is a good way to strengthen yourself tactically - you make even a small tactical error, and Fritz will exploit it.

      Does anyone outside of chess grand masters use these things?

      Yes, I do (and I'm a 1200-level player, only been really playing for a few months now). Almost everybody else at my club who uses any sort of computer program (which is the majority or people there) uses Fritz too.

      (How many grand masters are there, anyway?)

      Several hundred worldwide AFAIK.

      I'm a very mediocre chess player myself, and if I want my ass handed to me in chess I'll go down to the local high school club and call them all smelly virgins before starting a game. At least I'll have some face-to-face interaction.

      Yeah, well. Computer chess is no substitute for the real thing. Of course, lack of smelly virgins (with the possible exception of yourself) is definitely a benefit.

    2. Re:Here's a real "what's the point" question: by StillAnonymous · · Score: 1

      Well, I haven't played them all, but engines like Fritz and Hiarcs have settings where you can tone them down to suit almost any play level. Plus you can choose if they get to use opening books or not, and you can specify which openings they'll use in case you want to practice against a certain type of defense.

      They're pretty good for analyzing your games and telling you where you went wrong. There's also modes where the computer will play a good game, but will make a key error that you should be able to notice and exploit to win the game. It will also try to adjust itself to your level, so if you kick it's ass, it'll get harder next time.

      The Chessbase engines also seem to be a little more realistic than the more commercial engines like ChessMaster 8000. I remember playing CM8000 on the easiest setting (given an approximate FIDE rating of like 23..) and watched in horror as the game systematically set me up to lose a rook AND a knight, then right before going for the throat, what does it do? It hangs it's queen for no apparent reason. Not very realistic play style.

    3. Re:Here's a real "what's the point" question: by perler · · Score: 1
      what about testing fritz before judging? i play against fritz because it's IMHO the most adjustable chess program out there. in "friends" mode it adjusts to your strenght quite well if you play some 10 or 20 rounds.. and if you really played chess a bit more than once a year you came to the point that you wondered how you should have reacted to this or that opening and in this case a program like fritz or chessbase is just helpfull...

      and not to forget that the internet chess servers at fritz have much more sophisticated playes compared to that yahoo crap, not to forget that it is much more pleasing for the eyes and that there are live transmissions of games and that there are weekly teaching sessions with GMs and... to try the latter go here

      PAT

    4. Re:Here's a real "what's the point" question: by FFriedel · · Score: 1

      We devote about 50% of our resources to implement teaching and training features in Fritz -- essentially to make the program weaker, but in a realistic, human fashion. Example: the "Sparring" mode in which the program tries to find moves that allow the opponent to win something with a clever combination (the regular playing mode never allows that). Afterwards it shows you all the places where you missed the tactics it had set up for you and quizzes you on the correct move to play.

      With Fritz7 the main intention is to get people to play people on the Fritz server. So one full half of the program is devoted to logging into the chess club and playing against people all over the world or following broadcasts of important events.

      It is only when you go to the other half and tell the engine to play full strength with no holds barred that you get wopped. Unless your first name is Garry, Vlady or Vishy. Then you just get a very good fight.

  39. Re:The point is envy. by noshellswill · · Score: 1

    You nailed it pad're. It's a grift. Even tho chess IS a game between two human players (only), the chess_like fraud you describe is just pathetic. As experienced chess players (of all strengths) know, the game is geometrically lawful rather than rule based and a naked computer will ALWAYS lose to a reasonably strong, creative human player. AI_Lusrs foam-at-the-mouth admitting this by queering the machine with a dozen GM strength experts on a particular opponents style.

  40. 1) e4 - forced loss? by Anonymous Coward · · Score: 0

    I'm just waiting for the day when chess has been solved, and it's proven that black always draws, except for 1) e4 ... being a forced loss for white.

    Check out suicide chess (fics rules) for a handful of forced losses for white at move 1. :)

    1. Re:1) e4 - forced loss? by DrD8m · · Score: 1

      keep on waiting...

  41. Re:Someone posts a chess computer story... by yatest5 · · Score: 1

    Well, here's a heads up. That is exactly how human players prepare for matches against each other. They sit down and play through their opponents previous matches, and try to find weaknesses and holes to use against them.


    Yeah - they ahve a big catalogue of games to go through when playing human opponents. But they don't have this when playing the computers, so they are at a distinct disadvantage.

    Does anyone know if the computers have a 'style', i.e. that a grandmaster might be able to predict what they would do accurately in any given situation?

    --
    • Mod parent up! [a] by Anonymous Coward (Score:5) Thurs, June 31, @13:37
  42. Re:They need to learn from Data by Anonymous Coward · · Score: 0

    Star Trek != AI. All chess programs do for the most part is a min-max search to try and place themselves in the most likely position to win. Playing not to win, but to tie, would then mean that the search would not pick the best move which would thus mean that the probability of it losing becomes much higher.

  43. This is an announcement by Anonymous Coward · · Score: 0

    Chess is gay, linux sucks, IBM makes inferorir hardware, slashdot is going down, trolls rule, moderators get fucked up the ass every time they moderate posts to -1

  44. Where's Bobby? by mcknation · · Score: 1



    I bet Deep Blue couldn't take him!

    McK

    1. Re:Where's Bobby? by The+Rogue86 · · Score: 1

      alas just cause fisher is famous doesnt make him the best....::insert crying here cause bobby's the man:: perhaps he is the best perhaps not but without any real current data i am afraid your claims are unfounded.

      --
      This is how you know you're a geek the power goes out and you are unemployed and unemployable. Yes I know I can't spell
  45. Re:Someone posts a chess computer story... by Anonymous Coward · · Score: 0

    Computers definately have a 'style'. Most expert players can tell the difference between playing a human and a computer. It's an ancient method to win against a computer by setting up easy sacrifices. A weaker program will accept every pawn you give it, while your positions gets stronger with fewer pieces. Stronger programs tend to be more difficult to beat this way, but you can still do it when you have get to 'know' the program.

    And that's what made the difference in Kasparov vs. Deep Blue. Deep Blue was specifically programmed to beat Kasparov, while Kasparov had nothing to base HIS calculations on before the games. So he was at an disadvantage. There were other disadvantages for him at that game too, IIRC it had something to do with time limits and how Deep Blue made its moves. My guess is that he accepted these because of arrogance. He didn't anticipate how well the computer would play against him.

    Anyways, computers are very near to becoming world champions in longer games. They already are by a great margin in shorter ones.

    One game is just not enough to declare a new champion. If Kasparov had the chance to play the program before the game, he definately would have won. Alas, then I think the computer could be said to be at a disadvantage. Especially if he was allowed to review the code beforehand. Then the game really becomes a hunt for bugs and weaknesses in the sourcecode, rather than actual play.

    So the game between humans and computers will never be even. The only interesting thing about the whole thing is that a computer actually beat the world champion. However, what does that mean? Already, computers excel in calculating rather than humans, and the mastery of computers in chess has really nothing to do with intelligence, as most people thought it would 30-40 years ago.

    In other words: The whole interest about chessmachines beating humans has become irrelevant and inevitable. The almost-brute force algorithms works and the machines becomes faster and faster. While the original idea behind the interest belongs to the past.

  46. Rest easy, humanity. by screwballicus · · Score: 2

    This threat to the supremacy of mankind will soon be quelled when we uncover the talented chess-playing midget secretly hidden inside Deep Fritz's supposed workings.

  47. ai != chess champion by bomb_number_20 · · Score: 2, Insightful
    i'd like to preface this entire comment by saying that i've been drinking. a lot.


    in any event- im reminded of the checkers champion computer players... they always win. the real question is- how do they win? the answer is: by storing a set number of move in lookup tables. in other words- once a game gets to a certain point, the computer opponent looks up, in a database, a winning set of moves from the given point in the game. how is this ai? how is this 'machine bettering man' on a level playing field? the answer is that it isn't.


    programming a computer to play until it reaches a point where the number of moves left in the game are finite, and the computer has a database of moves that guarantee wins from this position is not artificial intelligence- it's loading the deck.


    if you really want to impress people, build a machine that has no idea what the rules are, but rather is taught the rules as it plays the game. if that machine can beat the best players in the world, then we have an argument for a machine intelligence that is both strategic and insightful.


    until that point, we have nothing but technical deception; technical deception in the same sense that Eliza was programmed as an 'ai'. what it appears to be on the surface is not, in fact, what it actually is.

    --
    That's ok, Jesus likes me anyway.
    1. Re:ai != chess champion by Goldmember · · Score: 1

      "i'd like to preface this entire comment by saying that i've been drinking. a lot."

      To begin with, I've been working. The whole day. :)

      "if you really want to impress people, build a machine that has no idea what the rules are, but rather is taught the rules as it plays the game. if that machine can beat the best players in the world, then we have an argument for a machine intelligence that is both strategic and insightful."

      What a brilliant idea! What would be a better proof of AI than a computer that first learns the rules of the game, perhaps by looking at other people playing, and then figures out how to become a champion... now THAT would be real AI. No pre-programmed algorithms or anything. I bet it's gonna take a while before we see something like that...

      Does anyone know if this even possible, or has it already been done? I mean of course in more general terms, and with simpler games etc.

    2. Re:ai != chess champion by The+Rogue86 · · Score: 1

      i suggest resurching emergent code. it is still in its infantcy but shows real promise for learning how to learn.

      --
      This is how you know you're a geek the power goes out and you are unemployed and unemployable. Yes I know I can't spell
    3. Re:ai != chess champion by sapped · · Score: 1

      As I replied to the parent post;
      Recently, I programmed a tic-tac-toe game (noughts and crosses for the other people) and did not teach it any rules. All it knew was a history of games already played. The gist of it was as follows. It looked at a previous game and if the moves matched what was on the board already, then it tried to play the same way that the winner of that game played.

      I thrashed it for about 50 games and then it steadily started pushing me to a draw in almost every game. Around 120 games it started beating me on the odd occasion. If you are a Delphi programmer, I will send you the source code if you are interested.

    4. Re:ai != chess champion by dvdeug · · Score: 2

      programming a computer to play until it reaches a point where the number of moves left in the game are finite, and the computer has a database of moves that guarantee wins from this position is not artificial intelligence- it's loading the deck.

      Have you ever looked at chess books? Many of them have a little section where if you have two knights and a king, and he has one knight and a king, then here's how to win the game. That's the same thing.

    5. Re:ai != chess champion by damiam · · Score: 1

      IIRC, it's impossible to win without a rook, queen, or pawn left.

      --
      It's hard to be religious when certain people are never incinerated by bolts of lightning.
  48. Chess champs by Augur · · Score: 1
    FYI, there is a spin-off from Kasparovchess project (RU) (has a english-mirror @ Kasparovchess COM; don't understood yet who is a mirror of whom). Now, Kasparovchess.ru moved toward more open chess than politics. www.WorldChessRating.ru is opened for betatesting (cyrillic stuff there). There are plans to open english-version of this site.

    It's possible to say that Kasparov have a strong computational resources at his home so he have not only prepared well against the hardware competitors (does he had such an oppurtunity with DeepBlue?) but the devolopers have close ties with Kasparov by ownself.

    (Don't think that DF/DJ have a 'kasparov backdoor' :)

  49. RASTERMAN replies! by Anonymous Coward · · Score: 0


    July 23, 2002

    I just love all the people of this world who have opinions on things but never actually are willing to stick anything behind them.

    Let me clarify some of the following: Interview and the wonders of Slashdot and the ability to look beyond the tips of their noses when reading anything on slashdot - most of the comments there are made before anyone has actually READ anything.

    Anyway - for the few level headed enough to 1. actually have contributed ever to linux or any part of it and not just spouted out words but not had the guts to back them with code and effort, or 2. actually see more than their little world and are willing to actually understand "the enemy" so to speak, they might actually see where I'm coming from.

    The desktop market share windows has isn't going away. It's entrenched. Everyone I speak to who devout isn't a linux head says "yeah - heard of linux - I know it's meant to be stable, but I can't use my apps on it". It's not a matter of if they will be happy with openoffice, or be happy with whatever equivalent there is - they want THAT PARTICULAR APP.

    Also not to mention the ease of use windows has. You plug in a new usb device, or a new card or anything. It detects it - find the driver or asks you for the disk you got in the box, and bingo. On linux? HA! Good luck. Half the time I need to do endless reserach first to see if its supported - and even if it is, half the time I have to do some obscure hunting for code I need to compile and specially configure that more often than not only paertially supports it - and even then with moe bugs than you can poke a stick at. The average person doesn't want to do this - and rightly, shouldn't. I won't stop using linux. I still use it as my desktop. I know many others do. But linux isn't goin to beat microsoft. It isnt' going to take the majority share of the desktop markent. I never said it was dead. I said Linux has lost. It's not going to win. Just because you lose does not mean you re dead, but don't expect the masses of cheering fans. It's going to remain the minority holder on the desktop. In that respect I see it as a loss.

    Also I haven't stopped working on stuff. I haven't stopped on E. I'm not bitter or have sour grapes. Just because someone asks me for facts and i give them without flowery words or soothing tones does not mean I'm bitter and am trying to extract my pound of flesh. I never really dodge the trusth or facts, and if people don't seem to be able to read something at face value - well that's their problem. Did I not say KDE and GNOME were doing a good job? Did I ever start Enlightenment with the aim to become an easy to use desktop for the masses? I never did. I never claimed such. Anyone who says so is putting words in my mouth. E was always a toy project. It is my toy. I get to push boundaires and explore ideas using it. It only ever made it open source for anyone elses desktop other than mine because people pestered me after seeing screenshots.

    Also people just didn't get my point. I'm saying the future Isn't a desktop at all - the encumbent (windows) on the desktop will stay, but the future isn't a desktop computer at all - it isn't a nasty mess of a desktop with taskbar and a screen and a mouse and keyboard. I'm not the first to say this by any means - and I won't be the last. Devices (such as pda's and the likes) now have the grunt that desktops had years ago. They are what I see as the future. Devices you use for a limited set of things that fit in your pocket, have no wires and always work. Have a look at the i-mode and ketai phenomenon in Japan. Most people just want to do things - they don't care how - be it via windows or linux. Whichever way works. The techies like us care how - but what I'm saying is we are the minority. The mass market where linux can be on everyone's desk is not via the PC desktop - you want linux everywhere? Put it on their phones, in their cars, on their trains, on their watches. That's how you will get that.

    I will continue to use Linux on my desktops because I like it. I will continue to develop for X because I like it. I will continue to use Linux on my laptop because I like it. I will do it because "I can" and because "I want to". But I will not go thinking that linux will take over the worlds desktop computers. There was a day years ago it might have had a fighting chance - if applications had started to be developed that people wanted, but that time has passed and all the apps are for the reigning OS and will stay that way mostly. The desktop isn't going to be a big thing for linux, but it has a fair go in other arenas.

    So those of you who thought I'd given up - no way. I've just switched game plan. I never was a Linux visionary - never wanted to be, never asked to be - people just seem to have said I am. I am going to leave being a visionary and political activist to others. I say things how I see them. Take everything I say with a grain of salt - invariably it's me trying to make a point. I'm a realist and I'm into the practical of things. If I'm going to fight I want to make sure I have a damn good chance at winning.

  50. Kasparov is brave. by deltaone29 · · Score: 0

    Logically thinking this match has no purpose. If Kasparov wins, well - we can always say that chess computer is just a bunch of chips still far away from AI. Otherwise, If a computer will prevail - hmm .. Again we can always say that brute power of move iteration and a huge library of stored matches made the trick, and of course - that computer is no way smarter than a human. Kasparov is a brave guy trying to prove meaningless things but on the other hand - moving technology forward

  51. Can there ever be a fair match? by dmorin · · Score: 2
    When Kasparov asked for records of Deep Blue's games to study, he was told no -- something that would not have happened if he was playing another person. So, yes, he was playing a machine trained to beat just him, but he wasn't even allowed to study its strategy to have a fair fight.

    When Kramnik offered to play Fritz, he said "Fine, give me a copy of the program and let me play with it before hand." The creators of Fritz freaked out and everybody said "But then you'll be able to find the weaknesses and just exploit those!" Well, that's not Kramnik's fault -- if he found a human player that always made the same mistake, he'd certainly take advantage of it every time, right?

    The list of fairness questions goes on and on...since a computer can memorize openings, can't a human player be allowed to have his books with him? Since a computer doesn't need rest breaks, can't they be as short as possible? Are the programmers allowed to tweak the computer between every match, every move? Why?

    So what I'm wondering is, what has to happen in these matches in order for both sides to consider them fair fights?

    1. Re:Can there ever be a fair match? by Goldmember · · Score: 1

      I agree that in serious chess one should always be able to know his adversary beforehand. The problem is, however, that where to draw the line when it comes to computers? I'd say studying the games it has played is ok, but playing against it is not. I mean, Kasparov doesn't practise with Kramnik when preparing to play with him, but only studies the games he's played recently.

      Another thing, having a large memory is part of computers' nature, and I think it is just humans' disadvantage if we don't remember every single opening line perfectly. It just proves that the machine is better at something, doesn't it? Ok, someone has "given" the openings to the machine, whereas we humans have to "learn" them, it makes a difference, of course.

      Finally, I'd say that a fair game includes that the machine is on it's own after the kick off. It should remain unconnected to anything outside the playing room, receive only opponent's move as input, and play the game according to whatever it has and knows. All human intervention should be forbidden during the game.

    2. Re:Can there ever be a fair match? by ctid · · Score: 2
      When Kramnik offered to play Fritz, he said "Fine, give me a copy of the program and let me play with it before hand." The creators of Fritz freaked out and everybody said "But then you'll be able to find the weaknesses and just exploit those!" Well, that's not Kramnik's fault -- if he found a human player that always made the same mistake, he'd certainly take advantage of it every time, right?


      I spoke to the author of Fritz at the recent World Computer Chess Championships. I'm pretty certain he did not freak out; anyone who has any experience at all of computer chess knew that any strong player would ask for this in the wake of the Deep Blue II match against Kasparov. He was absolutely delighted to have the opportunity to play.
      So what I'm wondering is, what has to happen in these matches in order for both sides to consider them fair fights?

      I think that all that needs to happen is that both sides agree with the conditions. I don't think it's meaningful to try to make the conditions for both sides identical in this sense. When people ask "are chess programs as strong as the strongest grandmasters?", they mean chess programs as they are normally run, not some subset based on how humans play chess.

      --
      Reality is defined by the maddest person in the room
    3. Re:Can there ever be a fair match? by dmorin · · Score: 2
      I'm pretty certain he did not freak out;

      Fair enough, my word choice was poor. I just remembered there being some sort of controversy and a bunch of people saying that getting a copy of the program was a horrible thing to ask for, because weaknesses could be discovered and exploited.

      He was absolutely delighted to have the opportunity to play.

      Was he ever given a copy to play with? How was the question resolved?

    4. Re:Can there ever be a fair match? by jpmorgan · · Score: 2

      When Kasparov asked for records of Deep Blue's games to study, he was told no

      Not exactly true. The agreement between Kasparov and IBM was that IBM would have the records of all the public games Kasparov had played (which he provided), and Kasparove would have the records of all the public games Deep Blue had played. Unfortunately, Kasparov forgot the fact that Deep Blue hadn't played any public games, so there were no records! He wasn't turned down, he just wasn't thinking when he agreed to the terms of the game.

      When Kramnik offered to play Fritz, he said "Fine, give me a copy of the program and let me play with it before hand." The creators of Fritz freaked out and everybody said "But then you'll be able to find the weaknesses and just exploit those!"

      I highly doubt this. Not the least since Fritz is a retail product which you can buy. Want a copy? You can buy it here. And a steal at only $47.50.

    5. Re:Can there ever be a fair match? by ctid · · Score: 2
      I just remembered there being some sort of controversy

      Yeah, there was some debate about this on the various computer chess discussion boards. The programming team will be able to change the opening book during the match. I'm not sure about changing parameters to alter its style of play, but I assume that is allowed too.
      Was he ever given a copy to play with? How was the question resolved?

      I think the agreement was that it had to be made available one month (or maybe two/three months I can't remember) before the match. So it hadn't yet been shipped, but that was going to happen. I was a bit surprised to hear that Kramnik will be able to play with it on some sort of 8-processor box (similar to the one Fritz will use) before the match.

      --
      Reality is defined by the maddest person in the room
    6. Re:Can there ever be a fair match? by Kope · · Score: 2

      Actually, Kramnik is playing a copy of "Deep Fritz" which was only recently made publically available. The program is also going to include a customized opening book, and a huge set of tablebases for endgame play.

      Moreover, he didn't want just a copy of the program, he also wanted a copy of the HARDWARE it was going to be running on.

      There's a hell of a difference between Fritz on a 1ghz pc and Deep Fritz on an 8-way xeon box with 4 gigs of ram and the complete tablebases for all endgames with 5 or fewer pieces on the board.

    7. Re:Can there ever be a fair match? by Squidgee · · Score: 0

      Actually, he was given a copy of all of its public games...and we'll all be able to watch its thinking realtime from a website, I believe, while the match is going on.

  52. How hard is turing test by StrawberryFrog · · Score: 2
    You get this bot talking to someone over ICQ for a little bit and they will not know the difference.

    In the modern version of the turing test, ie IRCbots, most people are very easy to fool when they are not expecting it. However, fooling a discering judge who is trying to tell human thought from canned waffle is still impossibly hard, in the 'We still have very little idea of how to do it' category.

    --

    My Karma: ran over your Dogma
    StrawberryFrog

  53. Re:Sore loser. by Anonymous Coward · · Score: 0

    This is completely on topic!

    It's troll!

    Doesn't ANYBODY fucking know how to moderate around here?

  54. What next? by Bazzargh · · Score: 1

    The Rock vs GRACE?

  55. Deep Blue and Deeper Blue by JFMulder · · Score: 2

    Didn't Kasparov beat Deep Blue but got beaten by DeepER Blue?

    1. Re:Deep Blue and Deeper Blue by VikingBerserker · · Score: 1

      You're probably thinking of Deep Purple. He said something about not liking their music, and he hit the floor pretty quickly. That's hardly surprising, though, since five-on-one isn't exactly fair.

    2. Re:Deep Blue and Deeper Blue by Copid · · Score: 1

      The overall match, yes. However, Kasparov was able to beat the second Deep Blue in one of the games and draw 3(?) others. That indicates to me that at his best, Kasparov is better than DB. In a nutshell, until we have a decisive victory (computer can consistently beat our best representative) the question is still very much open (and very interesting, IMO).

      --
      An interesting anagram of "BANACH TARSKI" is "BANACH TARSKI BANACH TARSKI"
  56. old Carnie trick to make Gary play Vladimir again by Anonymous Coward · · Score: 0

    I once read in a book by Harry Anderson that there was a trick you can to challenge all the members of a chess club at once. It works easy for an even number of games, and there is a trick for an odd number.

    1st have the players ranked by ability and start with the strongest players. let them open. halfway through you open using the moves from the first half of number of games. then use the moves from the second half to play the first half. if you bet you can win half of the games, you'll win.

    if you connect the two computers so that secretly gary is actually playing vladimir, it would be interesting. though not very nice and certinaly not verry honorable if you didn't tell them

  57. Machine vs Machine by Anonymous Coward · · Score: 0

    How about Deep Fritz vs Deep Junior?

    1. Re:Machine vs Machine by Skuto · · Score: 2

      This was played in the qualifying event for the Kramnik match. It's now more than a year ago I believe and Fritz won by half a point in a 24 game match or so.

      In the latest World Computer Chess Championship (July 2002) Junior won in a tiebreak over Shredder.

      Fritz did not even make the top 3. (They participated with the name Quest to limit their damages)

      --
      GCP

  58. Re:Someone posts a chess computer story... by Salamander · · Score: 4, Insightful
    Because they have teams of programmers and serious hardware.

    Deep(er) Blue used some special-purpose hardware, but Deep Fritz and Deep Junior don't. Multiprocessors are a commodity nowadays.

    More hardware than is needed for a brute-force approach, actually, so what's all the extra hardware doing?

    Deep(er) Blue's custom ASICs were basically there to make the brute-force approach go faster. They didn't implement some sort of expert system or neural net, they had little to do with sophisticated position evaluation, they were mostly just there to speed up the nuts-and-bolts operations of walking extremely large decision trees.

    The scorn you heap upon this post's grandparent seems just a trifle misplaced, since you yourself seem to know little about the programs being discussed. They're a combination of chess-specific knowledge and fast implementations of fairly ancient algorithms, so they're pretty formidable opponents, but in terms of AI research they've progressed little beyond an early-to-mid-80s level. Nobody that I know who actually works in AI would say any different, either.

    --
    Slashdot - News for Herds. Stuff that Splatters.
  59. Archon is what you are talking about ... by pgrote · · Score: 2

    Archon was released by Electronic Arts and I loved playing it on the Commodore 64.

    Here's a site with a review and screen shots.

    1. Re:Archon is what you are talking about ... by RexRuther · · Score: 1

      I loved that game also. I had the Atari 800 though.
      First real "battle chess" like game I remember. It was amazing what those programmers did with such meek hardware.

      --
      -"The early bird catches the worm, but the late bird sleeps the most"
  60. Games and AI by billtom · · Score: 1


    Can't we just abandon the whole notion that getting computers to play any single game has anything to do with understanding intelligence. It's all just a parlour trick. Fun to watch, and interesting hobby, but it doesn't really provide any real insights into intelligence.

    Now, maybe if you could create a program that could learn any game you put in front of it and get better at those games on it's own, you might have something.

  61. Re:Someone posts a chess computer story... by Salamander · · Score: 5, Insightful
    you instantly get a bunch of posts about how it's "not that impressive because the computer is trained to beat just that player". Well, here's a heads up. That is exactly how human players prepare for matches against each other. They sit down and play through their opponents previous matches

    ...and that is precisely the opportunity that was denied Kasparov. Deeper Blue and its handlers -especially Joel Benjamin - had years to dissect Kasparov's games, but Kasparov had no access to DB's oeuvre. That's not a level playing field.

    Another aspect you've overlooked is that human preparation to play a particular opponent is usually on the order of weeks or months, and does not significantly sacrifice the preparer's ability to play other opponents. Even in the middle of preparing to play Kramnik or Anand, Kasparov could go to a tournament and beat just about anyone else. By contrast, DB was in preparation for years and the result was so finely tuned toward playing Kasparov that DB would have fared very poorly in any top-level tournament involving anyone other than Kasparov. That kind of inflexibility is not a hallmark of a intelligence, artificial of otherwise. What it indicates is that the basic methods were so old and so well understood that people have been able to spend years just tuning the implementation.

    Making a computer beat the world champion is a respectable feat. However, it's not even the highest goal in computer chess. Making a computer that could beat a series of opponents, without fundamental changes equivalent to a brain transplant between matches, would be more impressive. Making a computer that could win a 16-player round robin tournament against a whole field of top grandmasters - something Kasparov still does regularly, to this day - would be more impressive still. Making a computer that could play speed chess better than Anand or Hawkeye would be another worthwhile challenge in a different direction. Then there's Go, and then a bunch of other challenges, and then there's the real world. Spending years to create a program that can beat one player in one chess match under less-than-fair conditions is really a pretty low goal.

    --
    Slashdot - News for Herds. Stuff that Splatters.
  62. Re:Someone posts a chess computer story... by Jerdie · · Score: 1

    I think they should have these computers actually enter competitions, and play like anyone else has to in order to go for the title. Then if the computer wins, it has truely one.

    --
    Programming is simply the application of logic to creativity
  63. Re:Someone posts a chess computer story... by callott · · Score: 1

    I agree with most of your post, but I also think you overstate the case if you say that human players prepare to play versus a particular opponent in exactly the same manner that a computer program does. There are some similarities at a superficial level, but profound differences in how information is processed and in how changes are made to that information processing. (Human beings do not train to play a specific opponent by reprogramming their brains via neurosurgery.)

    This concept is trivially obvious to most of the slashdot crowd, but many less computer-savvy people do not fundamentally understand how a computer program "plays" chess. It is easy for those people to read a statement such as "That is exactly how human players prepare for matches against each other," and mistakenly think that computing systems like Deep Blue process information in much the same way that humans do.

  64. Kasparov + database-laptop == Advanced Chess by Anonymous Coward · · Score: 0

    Before the match, the system is Kasparov + database-laptop + additional grandmasters + computers. But during the match it's just Kasparov with no auxiliary support.

    Kasparov himself has developed a new format for chess playing, Advanced Chess. In Advanced Chess, each human player can bring a computer right into the tournament with them.

  65. Supercomputers for the masses! by Anonymous Coward · · Score: 0

    How about creating a GUI at distributed.net, such that anyone, anywhere, anytime, can play chess against a virtual supercomputer.

    I know I'd run it on my share of boxes!

  66. already been done by Anonymous Coward · · Score: 0

    all checkers games have been played and Samuals found that the first player to move always loses.

    chess may take a decade or more to get to that point.

  67. Deep by sharkey · · Score: 2

    Deep Blue, Deep Fritz, Deep Junior, Deep Thought. When are we going to get Deep Frink, so I can find out who's going to win the Superbowl?

    --

    --
    "Outlook not so good." That magic 8-ball knows everything! I'll ask about Exchange Server next.
  68. Re:Someone posts a chess computer story... by skyhawker · · Score: 1

    You are correct when you observe that Kasparov was denied the opportunity to prepare for Deep Blue, and therefore that Deep Blue's win is somewhat diminished.

    However, I think it's fair for Deep Blue's handlers to tune Deep Blue for Kasparov or any other opponent. If Deep Blue were to play in a tournament, it would make sense for the handlers to prepare it for each opponent, and then to set up its style of play for any particular game based on the opponent in that game. Human grandmasters do as much. They take their opponent into consideration, including recently played games, when they decide how to play a specific game in a tournament.

    I agree completely with your observation that creating a computer program that could win a prestigious international round robin tournament would be a much more impressive achievenment. However, adjusting the style of play for each opponent would be fair game.

    --

    The best diplomat I know is a fully activated phaser bank.
    -- Scotty.
  69. Re:Someone posts a chess computer story... by Salamander · · Score: 2

    If the computer's preparation were comparable in duration and resources to the human's preparation, that would be fine. My point, though, is that in the particular case of Deeper Blue vs. Kasparov that was not the case. The computer had much more time to prepare for Kasparov than vice versa (he was kinda busy winning tournaments and such). Similarly, DB had many more of Kasparov's games to study than vice versa. It's not a problem that DB was allowed to prepare; it's a problem that Kasparov effectively was not.

    --
    Slashdot - News for Herds. Stuff that Splatters.
  70. Fat discussion on Go a while ago by sapped · · Score: 1

    We had quite a lively discussion about go on slashdot a while ago.

  71. Man vs Machine? by Anonymous Coward · · Score: 0

    Pfft... ever been to fuckingmachines.com?
    We never stood a chance!

  72. I did that with tic-tac-toe by sapped · · Score: 1

    Recently, I programmed a tic-tac-toe game (noughts and crosses for the other people) and did not teach it any rules. All it knew was a history of games already played. The gist of it was as follows. It looked at a previous game and if the moves matched what was on the board already, then it tried to play the same way that the winner of that game played.

    I thrashed it for about 50 games and then it steadily started pushing me to a draw in almost every game. Around 120 games it started beating me on the odd occasion. If you are a Delphi programmer, I will send you the source code if you are interested.

  73. evaluation function in Deep Blue hardware by hayne · · Score: 1
    Deep(er) Blue's custom ASICs were basically there to make the brute-force approach go faster. They [...] had little to do with sophisticated position evaluation
    Not true. Here's part of the abstract of Feng-hsiungHsu's article in the March/April 1999 issue of IEEE Micro:
    The IBM Deep Blue supercomputer that defeated World Chess Champion Garry Kasparov in the 1997 historic match had 480 custom chess chips in the system. Each of these chess chips contains one of the most sophisticated chess evaluation functions ever designed, whether in hardware or in software.
    1. Re:evaluation function in Deep Blue hardware by Salamander · · Score: 2

      Then I stand corrected. Nonetheless, I think even that still falls into the category of "making the brute-force approach go faster". The type of evaluation function involved, no matter how "sophisticated" it is in a certain context, is not truly sophisticated in the same manner as something that actually performs planning or learning functions. It's basically a calculator for a complex mathematical function, and is still driven more by the intelligence of the person who assigned weights to all of the positional factors than by any actual sophistication as an AI researcher would use the term.

      --
      Slashdot - News for Herds. Stuff that Splatters.
  74. Re:Someone posts a chess computer story... by skyhawker · · Score: 1

    Well, I already agreed that Kasparov was put a significant disadvantage. In fact, I'm pretty sure that he had NO opportunity to study the computer's past games, because it had been significantly revised and the IBM team deliberately refused to give him any sample games. All in all, I'd like to see a computer participate in a strong round robin tournament as you suggested. I also think that it's only a matter of time, because the advances in speed and such will just overwhelm us poor humans. Of course, all that it really demonstrates is that machines can crunch through enormous numbers of possibilities and handle certain computations better than humans can. For example, if a strong machine makes it to a five piece or less endgame, it will play the remainder of the game flawlessly, and it does so with no real intelligence.

    For what it's worth, mathematicians have had to put up with the "tyranny of the machine" with the acceptance of a computerized exhaustive search that confirms the proof of the (formerly) famous "four color theorem." But what can you do?

    --

    The best diplomat I know is a fully activated phaser bank.
    -- Scotty.
  75. Mod Parent Up by Anonymous Coward · · Score: 0

    Very interesting

  76. That says a lot about his memory power. by bigsexyjoe · · Score: 1

    That says a lot about his memory power. I think grand masters do have a lot more brute calculating power than normal people, not to say that they don't use knowledge and creativity. However a guy that can remeber 56 boards can clearly see further ahead than most people.

  77. Computer go has also been extensively researched by Analogue+Kid · · Score: 1

    Actually, go is a very popular game world wide, arguably more popular than chess. It's true that the areas in which go is popular aren't the most affluent in the world, but there are a great deal of programmers working on go. A very wealthy Tawainese man, the late Mr. Ing set up a foundation to award $40 million (TWD) to the first go program to beat a 1-dan player. He also set up incremental prizes for each kyu level a computer could advance to. Literally thousands of programs have competed, and none can win against a one dan amateur, even with a 9 stone handicap.

    Go is very unlike chess. Chess computers improve greatly with improvements in hardware. In fact, very straight forward chess programs with simple evaluation algorithms and minimal pruning can defeat master level chess players when run on modern PCs. One example is the ever popular TSCP . Go programs on the other hand do not improve notably simply by using a brute force approach. Handtalk, the former computer go champion plays less than one kyu better on an Athlon2000 than it does on a 386. For more info, check the links on Mick's Computer Go Page

    --
    I'm a gnu world man.
  78. Deep Blue didn't beat Gary Kasparov in 1997 by Anonymous Coward · · Score: 0

    IBM cheated. They were changing the program in between games to "adapt" to Kasparov. It's about as blatant as telling it what moves to make. And he caught them at it. At one point Kasparov was confused by an unexpected move the computer made and accused them of just what happened. IBM denied it at first but later admitted having "adusted" the program the night before. This was specifically in violation of the rules agreed upon for that tournament.

    1. Re:Deep Blue didn't beat Gary Kasparov in 1997 by belg4mit · · Score: 1

      It may have been against the agreed upon
      rules, but it's not unreasonable. Would
      Kasparaov or anybody else be sequestered
      durting a match and prevented from speaking
      with anybody, or possibly a consulting a book,
      during the off hours? No. Of course it does
      mean the machine is not nearly as impressive.

      --
      Were that I say, pancakes?
  79. Re:Someone posts a chess computer story... by fferreres · · Score: 2

    That is exactly how human players prepare for matches against each other.

    False, players also need to talk, walk, remember other things, and a bunch of other non-specialized activities. They need to be humans. On the other hand, a computer is "anything, but not a human". Why? Because there is NO limit to how much memory they can use, how much processing power they might use. Perfect memory, perfect calculus.

    So if you could build a infinite memory/ infinit processing power computer, you could just precalculate all the possible outcomes of matches. Say a ply of 60 or more.

    That computer is smart?

    Vision 1: To call a computer chess program "inteligent" you need to draw a line and state: "this memory and this CPU should give you enough resources to beat any human". Anything else is just plain unfair and it's no longer inteligent.

    Vision 2: A chess program should be an entityand not a bunch tuned of knowledge / rules / algoritms. It should be able to learn from experience without human intervention (ie: no specialized learning program, this one should be tuned by the computer itself), it should be able to plan it's own strategy, and autotrain itself. Ie: you teach them the chess rules, let it comunicate (gather more data, a database if requested, etc) and then the computer must do everything without interference.

    Level 1 is acceptable, but we'd like to see a computer beat a human under the much more fair Vision 2.

    --
    unfinished: (adj.)
  80. Re:Someone posts a chess computer story... by Howzer · · Score: 1
    Yes I agree my language could have been more careful. It's been in interesting to watch the debate unfold. I've followed it carefully and clicked a lot of links and learned plenty - but I think my fundamental position, which is:

    1. "Brute-force" as a discription of what "they" have achieved with Deep Blue, etc, is a very poor characterisation, usually used by critics of the effort. Expert system (even expert position analyses hardware for Deep Blue) is a much better name.

    2. We are still at the beginning stages of understanding how to do this (witness the junior state of "Go" programs) and my point about fundamental research seems to hold up well.

  81. Re:Computer go has also been extensively researche by Sunnan · · Score: 1

    Wouldn't faster computers only mean faster "thinking", not better? I guess that's why they have clocks at tournaments.

    To be honest I still lose against GNU chess if it plays with the opening book. But it opened my eyes to use my knights better.

  82. men vs machine / 3 matchs for october 2002 by Anonymous Coward · · Score: 0

    see this web page : AMATEUR vs WORLD CHESS CHAMPION COMPUTER JUNIOR 7/ ADVANCED CHESS Spectacular challenge in october 2002, a chess amateur play a world chess champion computer in advanced chess. For more information, please see official webpage (english and french) : http://www.chesslines.com/indexmatchen.html Greetings Stephan Glickmann Press contact

  83. listen to the man by Anonymous Coward · · Score: 0
    This gets posted at least 10 times a story like this hits /., and everybody keeps moaning it, but it's just patently false.

    ... because it sure seems like he should know what he's talking about. Thanks for patrolling the chess discussions, Gian-Carlo; you are now my friend.]