Slashdot Mirror


Kasparov OpEd On His Latest Match

molrak writes "Garry Kasparov has written his thoughts and observations on the difference between his recent battle with Deep Junior as opposed to his battle against Deep Blue, including some of the fundamental differences between the two programs. If you missed out on the event, you can catch up with it at the site of the event's sponsor, including both 2d and 3d viewing options. (Note, viewing options require both site registration with x3dworld and proprietary Microsoft software.)"

335 comments

  1. Big fricken deal by HMC+CS+Major · · Score: 0, Flamebait

    Why the warning about "proprietary microsoft software" ... it's pretty much common sense that if you're going to be viewing 3D simulations, it's probably only going to be created for a single OS, and that OS is going to be the most popular OS on the internet.

    Creating 3d models isn't difficult. Creating a series of 3d models isn't difficult either, but its more time consuming. Creating a series of cross-platform 3d models is likely too much to ask for a FREE site.

    1. Re:Big fricken deal by outsider007 · · Score: 2, Insightful

      I guess you never heard of flash.

      --
      If you mod me down the terrorists will have won
    2. Re:Big fricken deal by Anonymous Coward · · Score: 0

      Or VRML.

    3. Re:Big fricken deal by kwerle · · Score: 1

      I guess you've never heard of VRML

    4. Re:Big fricken deal by Exitthree · · Score: 2, Insightful

      Perhaps a better reason is so that once you've given away all your personal information just to register to the site you don't get surprised by the fact that it won't work on your Mac or Linux box. And seriously, Flash has been able to do 3D representations with 3rd party rendering software a long time.

    5. Re:Big fricken deal by Anonymous Coward · · Score: 0

      I guess you've never heard of QuickTime VR.

    6. Re:Big fricken deal by Anonymous Coward · · Score: 1, Funny

      I guess you've never heard of ModWobbler3000.

    7. Re:Big fricken deal by Anonymous Coward · · Score: 0

      LMAO

    8. Re:Big fricken deal by vangrubt · · Score: 2, Insightful

      Which single OS are you talking about? According to InternetWeek.com Windows XP is on little over 20% of all computers with an internet connection. Windows 98 is around 35%. Or could you be talking about Cisco's Catalyst OS, because man there's a heck of a lot of Cisco switches out there that are "on the internet".

    9. Re:Big fricken deal by PurpleBob · · Score: 1

      I suppose you've never heard people laugh at the useless joke that VRML was.

      --
      Win dain a lotica, en vai tu ri silota
    10. Re:Big fricken deal by enjo13 · · Score: 1

      I guess you've never heard of Java...

      Also, get your terminology straight. You generally create a single model and use some kind of animation system to actually animate the model. So to achieve animation it is not a series of models, but a manipulation of 1 model.

      The process of creating cross-platform models is absolutely trivial. After all a model is a model , no matter which platform it runs on. What you MEANT to say was creating a 3d presentation (be it a game or otherwise) to run on multiple platforms is likely to much to ask for a FREE site. That's only partially true (as posters here have all but made perfectly clear). There is nothing trivial about working in 3d, but cross platform 3d really IS by and large a solved problem.

      --
      Turn s60 photos into awesome videos with mScrapbook for all S60 3rd edition phones!
    11. Re:Big fricken deal by jericho4.0 · · Score: 1
      Flash!? For 3D? What are you talking about? Flash started out dong 2D vector stuff. They've just recently started to get serious as an enviroment with flash 6, in which Actionscript actually becomes usefull as a language. But flash still has no understanding of 3D.

      You can fake it sometimes though. My web page has an atempt at such. (link above(shameless plug))

      --
      "A language that doesn't affect the way you think about programming, is not worth knowing" - Alan Perlis
    12. Re:Big fricken deal by outsider007 · · Score: 1

      3d onjects can be modeled and animated in 3d studio max, maya, lightwave and exported to flash with plugins. if you haven't seen any good 3d in flash you haven't been looking very hard.

      --
      If you mod me down the terrorists will have won
    13. Re:Big fricken deal by jericho4.0 · · Score: 1

      But that's not 3d, that's a pre-redendered 3d model rendered as vector animation. I'm not saying you can't pull of some great effects, but it's not 3D in the sense OpenGL is.

      --
      "A language that doesn't affect the way you think about programming, is not worth knowing" - Alan Perlis
    14. Re:Big fricken deal by outsider007 · · Score: 1

      well it can be either vector or raster but it doesn't really matter. If your definition of 3d is not pre-rendered then movie special effects aren't 3d either but for the purpose of the story it doesn't matter. we're just talking about getting a realistic perspective angle of a chess board. openGL is not required.

      --
      If you mod me down the terrorists will have won
  2. Kasparov Biography by syr · · Score: 4, Informative
    Here is a biography of everyone's favorite chess savior protecting humanity against the robotic horde. Included is a list of matches and results throughout the years.

    GameTab - Game Reviews Database

    1. Re:Kasparov Biography by AssFace · · Score: 1, Funny

      thank god for Old Glory Insurace - they insure us against the robots. no longer do we have to live in fear of them attacking the elderly in search of their medicine.
      granted, robot attacks are the leading cause of death in america, but with old glory insurance on our side, we can feel safe and sleep better at night.

      --

      There are some odd things afoot now, in the Villa Straylight.
    2. Re:Kasparov Biography by phantumstranger · · Score: 2, Interesting
      Chess savior?! The man that almost destroyed the Grand MAster's Association after resigning to compete in tournaments he had previously denied to people? Kasparov is the most arrogant chess player since Fischer but not nearly as talented.

      Quick little tid-bit not in the savior's bio: In the late nineties there was a tournament held in Cuba to honor Capablanca. Everyone who was anyone (at the time) was there to pay their respects to one of the greatest players ever, Kasparov included. This was the last known public siting of Fischer among and by chess players. Kasparov saw him enter the room in his (Fischer's) cotton shorts and shirt and wide brimmed straw hat and decided to offer a game and his hand for a shake. Fischer just looked at him, looked at his hand and walked on by to take in a game with his old buddy Spassky

      All I'm saying is while he may seem like a hero to people of the world for having the "guts" to take on the machines people in the know realize it's his ego. If he was really the mane that could pull Chess out of the swell it's in (yes, that's including throughout Europe contrary to popular belief) he would play more instead of holding out for money and endorsements and play who's ready to play not who he thinks will bring in the bucks when he does.

      --
      "From of old, there are not lacking things that have attained Oneness." - Lao Tzu
    3. Re:Kasparov Biography by uncoveror · · Score: 0

      Interesting stuff. Kasparov still think he is playing against computers. He doesn't know that he's been had.

      --
      The Uncoveror: It's the real news.
    4. Re:Kasparov Biography by Anonymous Coward · · Score: 0

      Karma Whore.

    5. Re:Kasparov Biography by ignatzMouse · · Score: 1
      > most arrogant chess player since Fischer but
      > not nearly as talented...

      What are you smoking?!

      It's a shame Bobby can't take any time out from his busy schedule reading Mein Kampf or accepting blood money from genocidal arms merchants to let the world see any one of the top 10 players of today mop the floor with his tired psycho ass. Fischer would be lucky to earn himself a draw.

      --
      No artist tolerates reality. -- Nietzsche
    6. Re:Kasparov Biography by damiam · · Score: 5, Insightful
      Kasparov saw him enter the room in his (Fischer's) cotton shorts and shirt and wide brimmed straw hat and decided to offer a game and his hand for a shake. Fischer just looked at him, looked at his hand and walked on by to take in a game with his old buddy Spassky

      Maybe I'm misreading what you said, but that sounds like Fischer was the arrogant one, and Kasparov was just being polite.

      --
      It's hard to be religious when certain people are never incinerated by bolts of lightning.
    7. Re:Kasparov Biography by papasui · · Score: 2, Flamebait

      Bobby Fischer praised the 9/11 attacks over the radio. He can go to hell and burn for all I care.

    8. Re:Kasparov Biography by cymen · · Score: 1

      So Fischer walks in wearing his own clothes? Why exactly does this need to be pointed out? I suspect I'm missing something...

    9. Re:Kasparov Biography by EverDense · · Score: 1

      I think it was some kind of off-topic cotton-fetish post.

      --
      http://jesus.everdense.com/
    10. Re:Kasparov Biography by dze · · Score: 1

      The man that almost destroyed the Grand MAster's Association after resigning to compete in tournaments he had previously denied to people?

      True, it's hard to defend Kasparov on this account. Then again, he looks pretty good compared to Fischer who, let's see, won the World Championship in 1972 and then basically never played another tournament game (minus the unofficial Spassky games).

      Kasparov is the most arrogant chess player since Fischer but not nearly as talented.

      I think Fischer's probably the greatest chess player ever, but to say Kasparov is not nearly as talented is kind of ridiculous. Kasparov has had the highest ELO rating ever and has had a pretty remarkable tournament record (so did Fischer, of course). In any case, the chess world is definitely poorer for not having seen a Kasparov-Fischer match, circa, say, 1985.

      --

      "Luck is the residue of design" -- Branch Rickey
    11. Re:Kasparov Biography by Anonymous Coward · · Score: 1, Interesting
    12. Re:Kasparov Biography by timeOday · · Score: 3, Insightful
      Bobby Fischer praised the 9/11 attacks over the radio. He can go to hell and burn for all I care.
      You mindless retard [ishipress.com]

      "Bobby expresses extreme views, such as when he says that white Americans should go back to Europe and Black Americans should go back to Africa and give America back to the Indians. While this is a silly idea, once again there are many who agree with it.... Also, the attack on the Pentagon, which Bobby did know about, was not by definition a terrorist act. Under any reasonable definition of "terrorism", the Pentagon is a legitimate military target.

      Nice reference, I had no idea Fisher was such a blithering idiot. Apparently he feels the terrorists were perfectly within their rights to drive an airliner full of innocent civilians into the Pentagon. I think I liked him better as an long-forgotten recluse.
    13. Re:Kasparov Biography by stephanruby · · Score: 1
      Apparently he feels the terrorists were perfectly within their rights to drive an airliner full of innocent civilians into the Pentagon.

      Again, he might not have known about that part. Initially, most of us didn't know the Pentagon was attacked by an airliner.

    14. Re:Kasparov Biography by Scudsucker · · Score: 1

      an airliner full of innocent civilians

      Be that as it may, it still doesn't change the fact that the Pentagon is a military target, as opposed to say, a skyscraper full of civilians.

    15. Re:Kasparov Biography by DunbarTheInept · · Score: 3, Insightful

      Terrorism is attacking civilian targets for the fear factor. The Pentagon is the fucking head of the military - hardly a civlian target by any stretch of the imagination. Does pointing this out mean I agree with the 9/11 attackers? Of course not. TO assume so one would have to be, what were the words you used - oh yes, "a blithering idiot".

      This is just like the flak Bill Maher got over pointing out that "cowardly" is the wrong word to use to describe a group that willingly died to carry out an attack of some sort - EVEN IF that attack is a terrorist one. The hijackers were guilty of a great many evils, but cowardice wasn't one of them. Just the opposite, actually.

      People think that any sort of criticism of the press coverage of an event equates to support of the perpetrators of that teven, because people are idiots.

      --

      Don't label something "offtopic" unless you know the topic well enough to tell what's on topic.

    16. Re:Kasparov Biography by nehril · · Score: 1

      Terrorism is attacking civilian targets for the fear factor. The Pentagon is the fucking head of the military

      uh, not sure what rock you've been under, but they flew a plane FILLED WITH CIVILIANS into the Pentagon. Both the plane and the buildings were targets. So what was your point about military targets again?

      "cowardly" is the wrong word to use to describe a group that willingly died

      *unarmed civilians* on those planes. think it through next time.

    17. Re:Kasparov Biography by spakka · · Score: 1

      Bobby Fischer praised the 9/11 attacks over the radio. He can go to hell and burn for all I care.

      Plane takes tower, check.

    18. Re:Kasparov Biography by obsidian+head · · Score: 1
      *unarmed civilians* on those planes. think it through next time.
      Indeed. Launching missiles is much braver.
    19. Re:Kasparov Biography by radish · · Score: 1

      Would you die for your beliefs? I'm not sure I would - I'm not brave enough.

      --

      ---- Den ene knappen er powerknapp, den andre er Bender voice knapp "Bite My Shiny Metal Ass"

    20. Re:Kasparov Biography by Hrothgar+The+Great · · Score: 1

      But they crashed into it with a PLANE full of civilians - so really, it's the same god damn thing after all, isn't it?

    21. Re:Kasparov Biography by Anonymous Coward · · Score: 0

      Personally, I laughed out loud when I heard about the attacks on 9/11.

      I also laughed when I heard about the Columbia shuttle explosion.

      And Kurt Cobain killing himself.

      www.churchofeuthanasia.com has a great video of the 9/11 attacks: "I like to watch". A dude masturbating while watching the twin towers get hit, interspersed with facial cum shots and touchdown scenes...

    22. Re:Kasparov Biography by Anonymous Coward · · Score: 0

      That's okay, I laughed when I skull-fucked your grandmother.

    23. Re:Kasparov Biography by Anonymous Coward · · Score: 0

      Fischer is an untreated schizophrenic who doesn't even know what the hell he's saying half the time. Do you think anyone respects you an iota more for your righteous stance? Do you make the world a better place for it?

      You're pathetic. I'd tell you to go to hell, but it sounds like you're already there. I just wish you'd stop bringing it to the rest of us.

    24. Re:Kasparov Biography by HiThere · · Score: 1

      Fischer is extremely quirky. He appears to me just this side of clinically insane. (I have no competence in that area, however.)

      He was also quite talented at chess.

      I don't find that admiring his chess games requires admiring his politics or philosophy. I also don't find that despising his politics and philosophies (in so far as I know them) required despising his chess skills.

      I certainly wouldn't call him any kind of a hero, but then I feel the very concept is based on an irrational conception of people as unitary in nature. People aren't all good or all bad. Things are a lot more complicated than that. And idolizing someone is a sure route to discovering clay feet.

      --

      I think we've pushed this "anyone can grow up to be president" thing too far.
    25. Re:Kasparov Biography by Anonymous Coward · · Score: 0

      Apparently he feels the terrorists were perfectly within their rights to drive an airliner full of innocent civilians into the Pentagon.

      It's not a case of 'well within their rights'. The US has blustered and interfered worldwide, supposedly in attempts to make the world a better place, but for some reason none of that better place stuff to applies to the countries being 'helped'. Terrorists attacked one building, told you they would attack another, but did the US stop interfering and mind their own business? Did they stop trying to force every country to follow their ideals (at the same time making said countries more poor, and the US more rich)? No, it was business as usual.

      I don't applaud the loss of civilian life, and I don't applaud the methods, but I applaud the sentiment and the willingness to strike out in ANY way against such oppressors. I suspect Bobby Fischer feels similarly.

    26. Re:Kasparov Biography by DunbarTheInept · · Score: 1

      The civilians on the plane were not the target. They were, how do we call it, oh, yes, "collateral damage" that occured while attacking the military target - the pentagon. The fact that the hijackers had a backward sense of morals that made them think of the passengers on the plane as rather inconsequential makes them bad, yes, but that doesn't make them terrorists unless the death of the civilians on the plane itself was their end goal. It was not. Killing them in the process was just the simplest way of hitting their target, and they didn't care.

      The World Trade Center was different, because there BOTH the weapon being used (the planes) and the target were civilian.

      --

      Don't label something "offtopic" unless you know the topic well enough to tell what's on topic.

    27. Re:Kasparov Biography by DunbarTheInept · · Score: 1

      Dying for your beliefs just for the sake of doing it is kind of dumb. You have to be in a situation where furthering your life is less effective to your cause than dying is, and that doesn't happen much in a modern country - so we don't have much exposure to that kind of situation.

      --

      Don't label something "offtopic" unless you know the topic well enough to tell what's on topic.

    28. Re:Kasparov Biography by Scudsucker · · Score: 1

      No, because we're talking about what kind of *TARGET* is was. The Pentagon was a military TARGET, because its the headquarters of the military. Its still terorrism because they used a planeload of civilians as the weapon. But that still doesn't change the fact that it was a military *target*.

    29. Re:Kasparov Biography by DaBooch · · Score: 1

      Perhaps, just perhaps, the civilians on the plane involved would consider it terrorism, no matter what the target.

      --
      ---- Some people have a way with words, and other people ... not have way. Steve Martin
    30. Re:Kasparov Biography by spress · · Score: 0

      Interesting story, but it seems to have been missed by all major chess magzines and chess journalists. I see there are links to biographies of various players, but none to a source of the anecdote itself. Could this be provided?

      --
      Subverting the meta-moderating system since 2003
  3. They forgot.... by Lord_Slepnir · · Score: 1, Funny
    Note, viewing options require both site registration with x3dworld and proprietary Microsoft software.

    And one soul addressed to 666 Luicifer Street, Seattle, WA.

    1. Re:They forgot.... by Anonymous Coward · · Score: 0

      I thought that Microsoft's address was 1 Microsoft Way, Lord Jackass.

    2. Re:They forgot.... by Pavan_Gupta · · Score: 1

      Nah, you said that wrong!

      It's ...

      Only 1 Microsoft Way: We Reign Supreme.

      They don't have any contact info. You just send money to the dumpster.

    3. Re:They forgot.... by Anonymous Coward · · Score: 0

      Oh boy, an anti-Microsoft joke on /., and it isn't even a very creative one.

      *yawn*

  4. The main difference... by Bowie+J.+Poag · · Score: 5, Funny



    Coming up with a chess program to beat Kasparov mercilessly just isn't fun anymore. I say we put more research into writing a chess program that will make him cry while beating him mercilessly

    --
    Bowie J. Poag

    1. Re:The main difference... by warpath · · Score: 2, Insightful

      Not that your comment wasn't funny... but I don't think he's been beaten mercilessly yet.

      As I understand it, Deep Blue was a narrow victory and Deep Junior was a tie. Or did I miss something? I think the machines are gonna have to be winning 6-0 rather than tieing 3-3 before we'll see a tear from Mr. Kasparov. heh.

    2. Re:The main difference... by legerde · · Score: 1

      Bowie J. Poag is my hero! Thanks for everything you have done!

    3. Re:The main difference... by mmol_6453 · · Score: 1

      That's something to look forward to:

      The Bastard Programmer From Hell.

      Wait...the entrance to the Hell plane is in Microsoft HQ, isn't it. Figures.

      --
      What's this Submit thingy do?
    4. Re:The main difference... by Tumbleweed · · Score: 4, Insightful

      Not only was the lastest match a tie, Kasparov actually made a stupid (for him) mistake in one of the earlier games which he might've won. The human element, it'll getcha every time. If Kasparov could always play at his best like Deep Junior can, then he could quite likely have beaten it this time around, too. Still, Deep Junior was an impressive, sexy bitch, as Kasparov says in this article. If _Kasparov_ is impressed, you should be, too!

    5. Re:The main difference... by bryanthompson · · Score: 2, Funny

      no kiddin. wouldn't that be hilarious if the computer tricked him into aligning all his pieces to say 'ass' or something crazy like that? or maybe sending his king on a death lap around the board only to be cornered by pawns... that'd be the ultimate humiliation... muahahaha

    6. Re:The main difference... by Jon+Abbott · · Score: 1
      Coming up with a chess program to beat Kasparov mercilessly just isn't fun anymore. I say we put more research into writing a chess program that will make him cry while beating him mercilessly
      Yes! Then maybe we can make Kasparov's head explode!
    7. Re:The main difference... by Anonymous Coward · · Score: 0

      like a rock. like dirt. you are so dumb and un-funny that it boggles the mind why i'm even responding or paying any attention to you.

      guess i should be doing something better with my time.

    8. Re:The main difference... by urbazewski · · Score: 1
      a chess program that will make him cry while beating him mercilessly

      Simple. Make the computer wear a dress so Kasparov thinks he's been beaten by a woman. His opinions regarding women are so appalling that I always root for the machine.

      Well, I'd root for the machine anyway.

      --
      foldplay your photos won't know what hit them.
    9. Re:The main difference... by arcadum · · Score: 0

      I have never laughed so hard as when I invisioned your prophacy.

    10. Re:The main difference... by Bowie+J.+Poag · · Score: 1


      Kasparov had his ass handed to him a few years ago. He literally had a goddamn tantrum when it happened, and stormed off the stage in a hissy-fit.

      The meat engine will always lose.

      --
      Bowie J. Poag

    11. Re:The main difference... by Anonymous Coward · · Score: 0

      he threw a tantrum ? when he didn't get his way ?

      you mean like you do, Bowie, when someone (god forbid) flames you back, and you post the phone number of some schmuck you have a beef with, thinking it's him who flamed you ?

      i'd say a hissy fit was the first time i dealt you the same shit you hand out, and you posted that kid's phone number. priceless!

      watch...i'm willing to bet you'll do it again!
      because you're like a little puppy, and the feed-bell has rung! go post mcdaniel's info! go! come on....you can do it....wittle little puppy dog baby.

      p.s. get a fuckin job already. and stop being a jackass.

    12. Re:The main difference... by Anonymous Coward · · Score: 0

      On yourself, you know others.

    13. Re:The main difference... by kmellis · · Score: 1
      "...could always play at his best like Deep Junior can..."
      I'm curious why you assume that Deep Junior always plays "at its best". True, Deep Junior has infinitely fewer ways to be potentially distracted than Kasparov does, since Deep Junior can't be distracted. :) But one can also play poorly because one has missed noticing an important opportunity simply because one didn't notice it--not because one was distracted and would have otherwise noticed it. Just...didn't think of it. Deep Junior can do that, too.
    14. Re:The main difference... by Sheridan · · Score: 2, Insightful
      I'm curious why you assume that Deep Junior always plays "at its best". [...] But one can also play poorly because one has missed noticing an important opportunity simply because one didn't notice it--not because one was distracted and would have otherwise noticed it. Just...didn't think of it. Deep Junior can do that, too.

      Yes, but if DJ did do this, then in the same position, with the same time constraints etc. DJ will miss the move every time you repeat it; i.e. there is no way that DJ will play any better in the same position so, by definition, it always plays at its best.

    15. Re:The main difference... by kmellis · · Score: 2, Insightful
      I don't know about DJ, but I think that some chess algorithms search the problem space in a random fashion. Maybe I'm wrong about that, but I have a strong impression that I read somewhere of an algorithm that culls search trees (and perhaps how deeply it searches the trees) using some random factor as a variable.

      I would think that adding some randomness to the algorithm would have two benefits. The first is my intuitive sense that a degree of randomness is more efficient. (Is a random walk more efficient than a deterministic walk in the general case? I apologize for my ignorance of a fundamental question of which I should be well familiar.)

      The second is in the context of the game being a contest. Will a human opponent play the same game every time? I suspect not. Not merely because their own decisions are apparently non-deterministic, but because they may intentionally chose to play a game differently to avoid the competitive disadvantage of being totally predictable. It would be in the interests of a chess algorithm to do the same thing.

    16. Re:The main difference... by GreyPoopon · · Score: 2, Informative
      Kasparov had his ass handed to him a few years ago. He literally had a goddamn tantrum when it happened, and stormed off the stage in a hissy-fit.

      If you're referring to being beaten by a human opponent, feel free to skip everything else below, as it doesn't apply. However, if you are referring to his match with Deep Blue, his animosity may be justified. For starters, the whole thing was so mysterious from the beginning. But most importantly, Kasparov believed (and still does today) that some human intervention took place during the match.

      Remember that chess is a battle simulation game. Just like a real battle, part of the game is studying your opponent and his previous "battles" for weaknesses that you can exploit. To really put a chess computer to the ultimate test, its human opponent must have the opportunity to study how it has performed in the past. I would suspect that the builder's of Deep Blue used studies of Kasparov to refine their machine prior to the competition, whereas Kasparov was not given the same courtesy.

      --

      GreyPoopon
      --
      Why is it I can write insightful comments but can't come up with a clever signature?

    17. Re:The main difference... by Bowie+J.+Poag · · Score: 1

      That last troll was posted by:


      McDaniel, Scott mcdev@mcdev.com, pipebomb@pipebomb.net

      McDaniel Development
      2139 Old Highway 5 South, and..
      637 Riverside Dr.
      Ellijay, Georgia 30540, United States
      Tel: (706) 698-5112


      Feel free to call this troll. He's lives with his mom, and that's her voice in the answering machine message. Every time Mr. McDaniel decides to troll, another copy of his personal info will be posted immediately afterward.

      --
      Bowie J. Poag

    18. Re:The main difference... by Bowie+J.+Poag · · Score: 1

      Nothing stops Kasparov from picking up a few books on game theory and AI, tho.. I mean, the guy's hissy-fit is understandable at least. If someone came along and told you, "Hey, you know that thing in life you covet the most, and that thing you think you're best in the world at? Well, youre not." I'd be pretty pissy too. :)

      --
      Bowie J. Poag

    19. Re:The main difference... by Anonymous Coward · · Score: 0

      i highly doubt that "picking up a few books" on AI and game theory will give Kasparaov the magic "keys" to beat a computer.

    20. Re:The main difference... by EEgopher · · Score: 1

      My college textbook for Intro Digital Design had the moves of game 6 (vs. Deep Blue) illustrated on every chapter heading.
      In game 6, Kasparov lost his QUEEN after only a few turns, and immediately forfeitted. That would certainly make me cry. Granted, it was sneaky of Deep Blue, but I, a novice, maintain that I would never have let it happen ;)

      --
      hi, I like pancakes -.-- -.-- --..
    21. Re:The main difference... by Anonymous Coward · · Score: 0

      yeah...that's it...there you go.

      you're a bigger dolt that i think i ever realized.

    22. Re:The main difference... by GreyPoopon · · Score: 1
      Nothing stops Kasparov from picking up a few books on game theory and AI

      Agreed, although in this case, I think Kasparov was suspicious that the coding went something like:

      if {player == C_PL_KASPARAV && last_move == C_MV_BOOKX) {
      executeMove(C_MV_RESPY)
      }

      Meaning that it didn't rely completely on AI. However, the world will probably never know.

      I'd be pretty pissy too.

      Yeah, me too. :-)

      --

      GreyPoopon
      --
      Why is it I can write insightful comments but can't come up with a clever signature?

    23. Re:The main difference... by Kintanon · · Score: 1

      I looked at that game a few times to see WTF Kasparov was thinking, to me it looked like Bobbie Fischer playing while Drunk and Stoned... Some kind of weird failed Queen's Gambit or something.
      I still haven't figured out what Kasparov was trying to accomplish in that game.

      Kintanon

      --
      Check out JoshJitsu.info for Brazilian Ji
    24. Re:The main difference... by stanmann · · Score: 1

      You realize, that a master or g-master will tip as soon as he recognizes a "death lap"... which will be fairly quick.

      --
      Food not Bombs is a nice platitude but it breaks down when you notice that the Bombees are usually well fed
    25. Re:The main difference... by ccp · · Score: 1

      Maybe DJ won't play any better, but the fact you seem to miss is that it can't play WORSE.
      If Kasparov is run over by a bus, we have to use the second best human. DJ is the FLOOR now, and it will be better every year.

      Cheers,

  5. What kind of crappy sport ... by ddillon · · Score: 1

    has its championship end in a tie? Pretty outrageous. And no rematch announced!

    1. Re:What kind of crappy sport ... by Anonymous Coward · · Score: 0

      They are thinking of changing the tie rule. Each player will strip naked and throw darts at each other. First one to pass out, loses.

      Ahhhh, some can't let go of their senior prom...

      The tie actually as to do with the player that moves first (white) has an advantage. Having an odd number of games would give one player an extra start. The dart proposal above is bullcrap... everyone knows these brains can't lift a dart much less hurl it across the room at an opponent.

    2. Re:What kind of crappy sport ... by kspiteri · · Score: 1

      In chess championships a tie means the champion retains his title. In this case, it simply remains a tie.

      IIRC there was discussion about a man champion vs computer champion match every year.

    3. Re:What kind of crappy sport ... by Anonymous+Hack · · Score: 1

      Cricket.

      --
      I got a sig so you would remember me.
    4. Re:What kind of crappy sport ... by bfree · · Score: 1

      Sorry, but no cricket championship (well none I've ever heard of and I play) ends in a tie! Any cricket match can end in a tie. Test matches (which are played over 5 days) drawn if neither side has defeated the other before the end of the last day. A one day cricket match (as played in the World Cup, the only real cricket championship which is on as we speak in South Africa) is tied if both teams end up scoring the same number of runs AND losing the same number of wickets (this could apply to a test match to, but I suspect that less than 0.01% of test matches are tied), this probably happens around 0.5% of the time. The only other thing that could really be regarded as a "championship" in cricket is the "league" table of test playing nations, which is based upon the results of test matches for the last few years, and awards each team a rating based on their results against each other (like a chess rating), this could be tied, but it would not be likely to remain so for long, and it isn't a championship really as there is no timescale to provide winners.

      Seeing as though this is /. and I love to point out the UScentric attitudes on here, I must mention the fact that American Football matches can be tied more easily than a cricket match (getting through an overtime or two without scoring is more likely than the net result of two cricket innings both ending up with the same number of runs scored and the same number of players out). If you want an example of a championship with a distinctive tie possibility, look no further than any race based championship where close competitors would be expected to finish within insignificant amounts of each other. Athletics (one photo with inseperable athletes) or Formula 1 (two drivers with the same number of points and wins at the end of the season).

      --

      Never underestimate the dark side of the Source

    5. Re:What kind of crappy sport ... by Anonymous+Hack · · Score: 1

      Dude it was a joke :) I live in Australia :)

      --
      I got a sig so you would remember me.
    6. Re:What kind of crappy sport ... by JustLikeToSay · · Score: 1

      Championship? What championship? Kasparov is a good player, but he's not the World Champion. Curiously enough The Lad Himself, Kramnik, has also been testing his wits against a chess program. Odd of Kasparov not to have mentioned how the World Champion got on.

      --
      I know the truth and I know what you're thinking
    7. Re:What kind of crappy sport ... by bfree · · Score: 1

      Sorry if I bugged you with my reply but how many /.ers would have known it was a joke? How many could even tell you anything about cricket (except it's relevance to Hitchhikers)?

      --

      Never underestimate the dark side of the Source

    8. Re:What kind of crappy sport ... by stanmann · · Score: 1

      actually, There are at least 3 world champions at the momment. Kramnik, Kasparov, and Ponomariov.

      --
      Food not Bombs is a nice platitude but it breaks down when you notice that the Bombees are usually well fed
  6. Re:3D Chess??? by KeatonMill · · Score: 1
    For some players, such as myself, having the pieces actually out on the board in 3D space is much more satisfying than flat pictures in books. Also, I find it easier to spot combinations and certain lines of play when I have a sense of "sides" that I can't always get in a book.

    Don't get me wrong, I'd be a worthless player without the books, I'm just saying I prefer a "real" (by which I mean 3D) game to a 2D overhead view shown on a computer screen.

  7. What? by Anonymous Coward · · Score: 2, Funny

    "Note, viewing options require both site registration with x3dworld and proprietary Microsoft software."

    Even if I already have my own 3d specs?

  8. Rupert Murdoch Is My Cousin by Acidic_Diarrhea · · Score: 1
    Well, I'd say that you're not entirely correct with your statement that the application will only do what a human programs it to do. I mean, obviously if you take this statement literally this is true. An application is only going to run the code that was written to build it. But I believe what you mean is that a program isn't going to do anything beyond what the programmer can think of it doing. I don't think this is a true statement.

    For instance, in chess, there are a finite number of moves. Now, let's oversimplify the issue so I can make a point. With these finite number of moves, the computer can run simulations and try every single one of them. A human might consider a very small subset in any given situation whereas a program can keep a database of moves and results, which will lead to an understanding of what move is the 'best', as defined by the probability that it will lead to a winning situation. Thus, with a simple table lookup - not really artificial intelligence - an application can consider moves that the original programmer would never consider. It's a very simple type of learning but I think it shows my point.

    --
    I hate liberals. If you are a liberal, do not reply.
  9. Aritificial Intelligence by Pavan_Gupta · · Score: 4, Insightful

    Kasparov seems to think that making a powerful chess machine would constitute creating a machine with the power to "think." I hardly believe that to be correct, and moreover .. with enough proccessing power, a computer could map out chess moves far further into the future than kasparov could ever hope to.

    I guess the real question has more to do with .. where does one go after they realise that chess is only a little game?

    1. Re:Aritificial Intelligence by Anonymous Coward · · Score: 0

      where does one go

      You just answered your own question.

    2. Re:Aritificial Intelligence by tarquin_fim_bim · · Score: 0

      "where does one go after they realise that chess is only a little game"

      To crush the Babylonian hordes with pong where else?

    3. Re:Aritificial Intelligence by Anonymous Coward · · Score: 0

      It's more like Kasparov is telling us what the AI people always seems to think... that a chessplaying machine is a great milestone for AI.

    4. Re:Aritificial Intelligence by kfg · · Score: 3, Insightful

      The point being that chess is a, theoretically, *solvable* game. The precise solution isn't known, although we have a good deal of empirical data regarding possible solutions. (Although white to win has been proven)

      The chess computers rely on this empirical data, not on thinking. They *compute.* Big deal.

      To really demonstrate a machine that has something of the sort that could be truely called AI it will have to compete with a human player on at least a near even level at a complex and *unsolvable* game.

      Chess is the beginners level of game playing computers, and they're just about "getting there." Go is the Holy Grail, and they ain't even close. To date no one has made a Go playing program that can reasonably hold it's own against even a relative novice.

      KFG

    5. Re:Aritificial Intelligence by Pavan_Gupta · · Score: 1

      Kasparov was saying that having a chessplaying machine is a milestone for AI development. I don't really think it is .. the computer is still following a predefined set of rules.


      When the computer picks the board up, and throws it .. I'll admit defeat. (But when the Computer beats the @#%# out of Kasparov, I'll laugh till I die.)

    6. Re:Aritificial Intelligence by sheddd · · Score: 1

      "(Although white to win has been proven)" White to win proven? How can you prove white wins without going thru every possible game?

    7. Re:Aritificial Intelligence by MrWa · · Score: 1
      Go is the Holy Grail, and they ain't even close. To date no one has made a Go playing program that can reasonably hold it's own against even a relative novice.

      It is the "Holy Grail" only if the program created is able to beat a pro (even a high level amatuer) through thinking. If the Go program can beat Cho Chikun or Lee Changho only because of raw processing power (i.e. pattern recognition, reading moves into the future) then all we have done is create a faster, more powerful computer.

      I don't know if one can say Go is "unsolvable". It is highly unlikely to happen, but there is a finite number of positions possible. So, theoretically, it could be solved...

    8. Re:Aritificial Intelligence by sheddd · · Score: 1
      Let's assume we have two computers with a perfect knowledge of all possible games; I assume:

      1) Either side could force a draw with certainty

      2) Neither side could force a win with certainty

      What you think? We may know the awnser during our lifetimes. Shall we play a game?

    9. Re:Aritificial Intelligence by kfg · · Score: 1

      By using the mathmatical ( which includes the logical) algebra.

      Some games are reducable to such analysis. Chess is one of those games. While certain theorems regarding chess are as yet unsolved ( like what the perfect sequence of moves is) some of them are.

      Among the theorems that have been proven are that there is at least one perfect stratagy and that if white plays it, white will always win.

      This is one of the reasons a perfect chess playing computer is being sought. It is *known* that it is possible.

      The search continues for that stratagy, either by empirical example or mathmatical analysis.

      KFG

    10. Re:Aritificial Intelligence by azmaveth · · Score: 1

      I'd have to argue that tic-tac-toe is actually the beginners level, as it is quite easy to write an unbeatable game.

      I do agree that Go is possibly the most complex of traditional games that have been computerized, but I wouldn't exactly call it _the_ Holy Grail. Correct me if I'm wrong, but my understanding is that any game with a limited amount of moves is theoretically solvable, and Go has a limited amount of moves (although many more than chess).

      -azmaveth

    11. Re:Aritificial Intelligence by stevey · · Score: 1
      To date no one has made a Go playing program that can reasonably hold it's own against even a relative novice

      And this is a good thing!

      I like playing strategy/board games upon my computer, but there's not much pleasure to be had playing a computer at chess anymore - I always lose.

      The day I lose every game of go too is the day I switch to another game, one which I have a 50/50 chance of winning at :)

    12. Re:Aritificial Intelligence by tpengster · · Score: 5, Insightful

      The point being that chess is a, theoretically, *solvable* game.

      Actually, that is beside the point. The state space of chess has some 10^120 states, larger than the number of particles in the universe. For practical purposes chess is unsolvable.

      The precise solution isn't known, although we have a good deal of empirical data regarding possible solutions. (Although white to win has been proven)

      Um.. no, white has not been proven to win. If I'm wrong, Why don't you show us the solution?

      The chess computers rely on this empirical data, not on thinking. They *compute.* Big deal.

      OK, those are two different things. If they relied on empirical data, that means that they would simply be looking up moves in a table. They're not (until the very endgame). They're looking ahead and then measuring positional and material differences. Quite a difference. And for that matter, the human brain, by the strong AI theory, is just a computer. So Kasparov is "just" computing when he plays a move. He just happens to have a massively parallel computer with billions and billions of neurons making computations simultaneously. "Big deal" indeed

      Go is the Holy Grail, and they ain't even close. To date no one has made a Go playing program that can reasonably hold it's own against even a relative novice.

      Once computers win Go, people will complain that they are "just" doing pattern matching, and so forth. The truth is that critics like you will never be satisfied with the state of AI because once a problem is solved, it will also be demystified. The fact that programs would approach a problem differently from humans is to be expected. These are chess programs. Not brain emulators.
    13. Re:Aritificial Intelligence by bmckeever · · Score: 1
      Finite and perfect information implies solvable. I've never played Go, but isn't it also finite and perfect information? In this sense, Go is not fundamentally different from chess. Not in the way Contract Bridge or Monopoly are.

      --
      Your favorite .sig sucks
    14. Re:Aritificial Intelligence by Feztaa · · Score: 1

      To really demonstrate a machine that has something of the sort that could be truely called AI it will have to compete with a human player on at least a near even level at a complex and *unsolvable* game.

      Yeah, forget Chess. We should get some computer to play Kasparov at Tetris! It is, after all, NP-hard. ;)

    15. Re:Aritificial Intelligence by Forgotten · · Score: 1

      There is a finite number of positions, but the number is too large for the game to be brute-forced (or even come usefully close). Go-solving belongs to that class of problems that may be algorithmically solvable, but where even if you created a hypothetical universal computer (make every proton in the universe a processor with an extremely small but finite switching rate and run the computer for the projected lifetime of the universe), you still don't have enough processing power (this continues to be true even if you can make larger dark matter or dark energy computers - the answer is just way too many orders of magnitude away).

      A computer can never "think" as a human does because if it did, it would simply be a human and not a computer. When we speak of holy grails, they're relative. Go is just the hardest (for a computer) game anyone's yet tried to solve with a computer. And if you've ever played it - even as a complete novice with a half-decent opponent - it's easy to see why. It runs so deep it's a little scary (but beautiful). I actually think a complete understanding of Go is impossible, and this is what keeps people playing it.

    16. Re:Aritificial Intelligence by sheddd · · Score: 1
      By using the mathmatical ( which includes the logical) algebra.

      Uugh. Proofs. Is it a widely accepted proof? Linkage?

    17. Re:Aritificial Intelligence by maddogdelta · · Score: 1
      I always found it interesting that if we don't know how to program the computer to do it, then it is AI. As soon as we learn how to make it happen, it is straight computation.

      Things in my lifetime that were once classified as AI : Chess; Character, Language, Speech, and Facial Recognition. The first is now 'just computation' the rest are just 'pattern recognition' and database queries.

      --
      -- There are 10 kinds of people in the world, those who understand binary and those who don't.
    18. Re:Aritificial Intelligence by kfg · · Score: 1

      The number of possible *discrete* states is completely irrelevant.

      Most of them make no sense. To an intelligent being.

      The question isn't how many states, the question is the complexity of the mathmatical algorithm required to solve it.

      It would be perfectly possible to create a game ( a rather pointless one) with 10 times the number of possible states of chess but solvable quite easily by any freshman in mathematics. Or a child.

      For instance, take a "chess" board a godzillion+1 x godzillion in size. Each player gets one token. The players place their tokens on diagonal opposites. Each player can move their token one space in any direction. First player to reach the other side wins.

      The winning strategy is both simple and obvious, and first player to move wins every game. Despite the large number of possible states.

      You are confusing big and impressive numbers with complexity.

      KFG

    19. Re:Aritificial Intelligence by gwernol · · Score: 1

      The point being that chess is a, theoretically, *solvable* game.

      Interesting. Is there a formal proof of this somewhere? I don't recall having seen one.

      The chess computers rely on this empirical data, not on thinking. They *compute.* Big deal.

      I agree that chess computers are computing from empirical data. The really interesting question is whether this is all that humans do. You distinguish "computing" from "thinking", but that involves a large and contentious assumption that these are different things. It is quite possible that "computing" is "all" the human mind is doing.

      A (simplification of this) behavioralist view of AI is:

      1) Computers only compute
      2) If computers can do things that humans can (e.g. play chess), then:
      3) All humans are doing is compute

      In other words, if it walks like a duck and quacks like a duck...

      --
      Sailing over the event horizon
    20. Re:Aritificial Intelligence by kfg · · Score: 1

      The number of "moves" possible in Go is so large that it hasn't even been determined how many there just might be.

      You're falling into the same trap as the "chess guy." Mathmatically the number of possible moves does not necessarily have anything to do with the complexity of the game as most of the moves may well be trivial moves a human player would never make.

      The *rules* are critical to the complexity though.

      To the extent that a game follows mathmatical law Godel's Theorem applies and one could construct a game with true, but unprovable, theorms of solution.

      Even one with a fairly limited number of moves.

      KFG

    21. Re:Aritificial Intelligence by Fulcrum+of+Evil · · Score: 1

      A computer can never "think" as a human does because if it did, it would simply be a human and not a computer.

      So, by definition (your), computers can't think. Big deal - we build a thinking machine and let the philosophers argue over what to call it. I figure that Frank Herbert pretty much nailed what would happen if that came to pass.

      The cool part is that I'll probably live to see it happen.

      --
      "We returned the General to El Salvador, or maybe Guatemala, it's difficult to tell from 10,000 feet"
    22. Re:Aritificial Intelligence by kfg · · Score: 1

      Yes, there is, but I haven't been able to find it on the web ( which it predates).

      It either hasn't been posted or I havn't "solved" my search parameters.

      Here's a simple logical proof that a "perfect" chess playing computer can't be made though ( perfect being defined as it wins every game whether it plays black or white).

      If it played itself, one of it could only draw at best, since, by the rules, there cannot be two winners.

      KFG

    23. Re:Aritificial Intelligence by slamb · · Score: 1
      > > The point being that chess is a, theoretically, *solvable* game.

      > Interesting. Is there a formal proof of this somewhere? I don't recall having seen one.

      The algorithm to do it is completely trivial, actually. You just construct a tree with every possible move branching out until completion. (Actually, I think it's a DAG, but that's not really the point.) With the complete game tree, you can basically do anything you want.

      Essentially this algorithm has been used to solve simpler games: tic-tac-toe (you should try it; it's not that hard to do, actually), Connect-Four, etc.

      However, in our universe it is infeasible to solve chess this way. The algorithm is theoretically perfect, but chess has 10^123 states and our Universe contains only 10^81 atoms. I suppose you could store more than one bit per atom (the number of quarks is greater, and I guess you could manipulate their spins or something) but I think you need to store more than one bit of information per state also...in any case, devoting a significant portion of the Universe to this problem is not feasible. In fact, there might be a formal proof somewhere that this is impossible, based on thermodynamics/entropy calculations.

      So if chess is solved, it will be through a different way.

    24. Re:Aritificial Intelligence by Anonymous Coward · · Score: 0

      Getting ready to WorShip, are we?

    25. Re:Aritificial Intelligence by Anonymous Coward · · Score: 0

      And then you'll go up against a guy named "Guildenstern" and that'll be no fun either.

    26. Re:Aritificial Intelligence by tunah · · Score: 2, Insightful
      (Although white to win has been proven)

      Did I miss something, or is this entirely false? Just because moving first *seems* to give an advantage, does not mean that white must win. There is much scope for draws in chess, often when one player seems to have an advantage. I don't know if this problem has been seriously attacked, finding the solution by solving chess is certainly far from computationally feasible.

      What may be a more realistic and quite interesting problem is proving that white can at least draw (ie black can't force a win). A black win is considered highly unlikely and may be vulnerable to some sort of (complicated) strategy-stealing proof.

      --
      Free Java games for your phone: Tontie, Sokoban
    27. Re:Aritificial Intelligence by Anonymous Coward · · Score: 0
      Although white to win has been proven

      Yeah OK. References, please? And not any that still have shit clinging to them from when you pulled them out of your ass.

    28. Re:Aritificial Intelligence by kfg · · Score: 1

      No, you misunderstand. See the guy above who posted about the halting problem.

      Certain problems can be demonstrated to be solvable, but not reducable to a mathmatical solution.

      Chess, for instance, has been shown to be so reducable, even though we don't know what that solution *is.*

      No one who knows what they're talking about has *ever* claimed that a computer being able to solve an algorithm is a sign of intelligence.

      What you find interesting is simply how many things that aren't obviously mathmatically predictable that turn out to be so.

      KFG

    29. Re:Aritificial Intelligence by Erik+Hollensbe · · Score: 1

      I am not going to refute your point, but the process of evaluation of it reveals one giant error:

      Deep Junior makes no attempt to account for the psychiatric or sociological effect of the game.

      One of my peers is a chess enthusiast, so we've been talking about this a lot at work, and most often, the fact that kasparov is playing against a mindless machine has been the subject.

      I play many games, and playing with the mind is definately a part of my strategy in many games. Gloating, vocally criticizing other players moves, and all sorts of other tactics work great at diminishing the player's self-confidence in the game.

      The methods may be differring in chess, but the end result is still the same, and it's something that's in more serious games as well - hell, anyone who's ever played the game 'diplomacy' knows what I'm talking about (and can obviously see what I'm getting at).

      Granted I don't play 'to win' as much as I used to, so I don't do that as much with the games I play anymore.

      These are all great techniques, and I'm sure none of them worked on deep junior.

    30. Re:Aritificial Intelligence by Erik+Hollensbe · · Score: 1

      none of these are infallible, though (except for character recognition).

      true AI is one that can recognize any of this as well as a human with appropriate knowledge can.

      many argue if it even exists just for this reason.

      All of the things you described, in their current form, are just pattern recognition. Even chess. :)

    31. Re:Aritificial Intelligence by Anonymous Coward · · Score: 0

      Hmmm...I think white having a forced win would be pretty big news. A reference would be nice.

      P.S. I don't think it's been proven. Some people
      suggest that in a "perfect knowledge" game like
      chess, the 2nd player (black) has an advantage
      because he has more information. I think with best play it's a draw. I can't prove it though.

    32. Re:Aritificial Intelligence by tpengster · · Score: 1

      The question isn't how many states, the question is the complexity of the mathmatical algorithm required to solve it.

      Alright. Lets see your mathematical algorithm for solving chess. What's that? It doesn't exist?
      (Still waiting on that solution for white to win, also)
    33. Re:Aritificial Intelligence by Anonymous Coward · · Score: 0

      No, I think Douglas Adams nailed it.

      The machine would run for billions of years, then finally provide an answer we couldn't understand.

      The perfect game of Go can be summarized as follows:

      42.

    34. Re:Aritificial Intelligence by PurpleBob · · Score: 1

      I rather doubt that white to win (or even white to force a draw) has been proven for chess. But it is possible to come up with such a proof without going through every possible game.

      Consider "double chess", where every player gets to make two moves per turn. You can prove that white can force a draw in this game with the following proof:

      If White cannot force a draw, that means there is a strategy by which Black can win. In that case, as his first move, White should move a knight out and then back. The board is in the same position, but now it's Black's turn, so White can now use the same strategy Black was going to use to win.

      Since it is impossible for both players to have a winning strategy, both players have to keep making these no-op moves, and after the third one the game is a draw. Which White forced.

      Maybe the poster claiming white to win has been proven heard this proof, and thought it was about ordinary chess.

      --
      Win dain a lotica, en vai tu ri silota
    35. Re:Aritificial Intelligence by Army+Eye · · Score: 1

      That's right, Tunah. Saying white has been proven to win in chess is an absolute falsehood. I think a lot of high-level players would speculate that it's more likely that the final outcome is a draw, but regardless, the important point is that nobody knows.

    36. Re:Aritificial Intelligence by kfg · · Score: 1

      You have missed the point entirely that I have just demonstrated a game that can be played on a 3x4 board (since godzillion was left undefined) which has an infinite number of possible moves ( a number much, MUCH larger than the number of atoms in the universe, in fact, infinately larger) and thus can't be solved by a computer at all by your reasoning.

      Yet a five year old can solve it in a matter of a few seconds.

      Yes, this directly relates to the problem of AI in playing chess. If you have enough RI to see it.

      KFG

    37. Re:Aritificial Intelligence by tpengster · · Score: 1

      You have missed the point entirely that I have just demonstrated a game that can be played on a 3x4 board

      We're not talking about your silly examples. We're talking about Chess.

      Chess, like many problems we use AI to solve, is TOO COMPLEX to be reduced to a mathematical formula. That is the whole point of doing search, of heuristics, etc. If a solution algorithm exists, we use the algorithm, not search. In chess we must search.

      Some problems, despite enormous complexity, CAN be solved because the problem space is small enough that we can dedicate a few computers to searching out the entire problem space. Chess is not one of those problems, because the problem space is too large. As long as your magical algorithm doesn't exist, Chess will continue to be a valuable problem area where we can test our AI techniques.

      (Still waiting for your solution for white to win)

    38. Re:Aritificial Intelligence by kfg · · Score: 1

      Well there ya go. I *wasn't* talking about chess. I was talking about AI.

      As for the white to win I've already posted a stipulation to an AC that I just pulled it out of my ass. It makes no difference to any AI argument I've made. So what the hell.

      KFG

    39. Re:Aritificial Intelligence by Anonymous Coward · · Score: 0

      I guess that you do not follow a predefined set of rules.

      Seriously though, the key would be for the computer to write it's own rules--to self modify in an evolving manner.

    40. Re:Aritificial Intelligence by David+Price · · Score: 1

      That's not quite accurate. Here's a parallel statement:

      "Here's a simple logical proof that a perfect tic-tac-toe playing computer can't be made: If such a thing existed, and it played itself, one side could only draw at best, because there cannot be two winners."

      Tic-tac-toe *is* a solved game; its value is 0. Perfect play by both sides always results in a draw. A perfect program, then is not one that always wins; it's one that always attains the maximum value allowed by the opponent's moves.

    41. Re:Aritificial Intelligence by peter · · Score: 1

      Have you guys forgotten what you were arguing about? You're just attacking the fine details of each other's last post.

      However, I won't let that stop me from doing the same. A 3x4 board with only one type of token can only have a finite number of states, and your rules didn't mention anything about move history. Thus, there is a finite number of possible moves, since repeated positions don't count as new moves.

      As for white wins in chess, if it was known how to force a win for white, nobody would play against computers. You'd just give the computer the algorithm for responding to any defence played by black, and it would always win. (You can't limit black's choices to a single move right from the start, so there would not be a single sequence of moves you could memorize. The so-called fool's mate and scholar's mate sequences require worst play by the opponent, not best play!) I suppose it's possible that the existence of such an algorithm could be proven without actually discovering such an algorithm. AFAIK, this has not been done.

      Most chess players prefer white, and presumably grand masters win more often when playing white than black. There does seem to be some advantage to moving first, at least with currently known strategy and tactics. Part of this is that most players have favourite opennings and defences, and are better at some than others.

      --
      #define X(x,y) x##y
      Peter Cordes ; e-mail: X(peter@cordes , .ca)
    42. Re:Aritificial Intelligence by God!+Awful+2 · · Score: 1


      The chess computers rely on this empirical data, not on thinking. They *compute.* Big deal.

      The real breakthrough in pop-AI will not be when we magically create a machine that achieves 'sentience'. Rather, the creation of a human-like machine will finally force us to acknowledge that what we like to call 'sentience' and 'free will' are merely highly evolved algorithms.

      *ALL* intelligence is in some sense artificial (some more than the rest).

      -a

    43. Re:Aritificial Intelligence by beowulfcluster · · Score: 1

      In other words, to beat Deep Junior you really have to rely on your chess _skills_ instead of using unsportsmanlike* "techniques" like gloating and trash talking. *Just the humble opinion of the author of this post, of course.

    44. Re:Aritificial Intelligence by dkf · · Score: 1
      Go is the Holy Grail, and they ain't even close. To date no one has made a Go playing program that can reasonably hold it's own against even a relative novice.

      Hmm. I always get pasted by Go-playing programs. Guess this means I fail the Turing test...

      --
      "Little does he know, but there is no 'I' in 'Idiot'!"
    45. Re:Aritificial Intelligence by kmellis · · Score: 1
      " To the extent that a game follows mathmatical law Godel's Theorem applies and one could construct a game with true, but unprovable, theorms of solution."
      No. This is a wildly speculative application of Godel Incompleteness.

      Firstly, all Godel Incompleteness asserts is that there is exactly one "true" but unprovable statement--the Godel statement--for any given formal system. That is arguably an extremely limited and relatively trivial case. It asserts something astonishingly mathematically counter-intuitive as does, for example, Cantor's Diagonal Method. What is significant is how it shows our intuitive understanding was incorrect: we thought that for a given formal system, all true statements were deducible--but Godel showed that one is not. One. It's tempting to want to use GI as part of an argument for the general limitations of deductive mathematics, but that's a misuse.

      Secondly, for GI to apply to a game, the game has to have sufficient expressive power to construct an equivalent to the Godel Statement--a significant requirement.

      As is the case with your post that mentions chaos theory, you're misapplying popular but poorly understood ideas to support your arguments.

    46. Re:Aritificial Intelligence by Isofarro · · Score: 1
      Here's a simple logical proof that a "perfect" chess playing computer can't be made though ( perfect being defined as it wins every game whether it plays black or white). If it played itself, one of it could only draw at best, since, by the rules, there cannot be two winners.


      There's a flaw here.

      A perfect chess playing computer would play the best move at evey node within a game. Pitting a perfect computer against a perfect computer, if its draw, then chess games should always draw. If one side wins, then chess is a winnable game for one side.

      Perfect computers can only play the best move within the rules of the game. This does not mean a perfect computer can win an unwinnable game, only put up the best possible defence it can under the rules. The perfect computer is constrained by the rules when calculating its move.
    47. Re:Aritificial Intelligence by kmellis · · Score: 1
      " As for white wins in chess, if it was known how to force a win for white, nobody would play against computers."
      Yes, but there is a qualitative distinction between knowing how to win, and knowing that such a strategy exists. All he ever said was that white to win was proven, not described. I don't understand why people are not grasping the distinction.

      At any rate, after a web and USENET search, I'm skeptical that such a thing has actually been rigorously proven. (Again, though, not that I have any problem with the possibility that it could be proven. Seems to me to be possible, even likely.) One interesting discussion about this (and related matters) is found here in rec.games.chess.

    48. Re:Aritificial Intelligence by obsidian+head · · Score: 1
      Most of them make no sense. To an intelligent being.
      That's the point. GM Dvorak studies "irrational" positions and moves, which are incredibly subtle and questionable, but turn out to be strong (even if they're not understood).

      The "Remis-Tod," the draw-death, seems to be more likely.

    49. Re:Aritificial Intelligence by kmellis · · Score: 1
      " No one who knows what they're talking about has *ever* claimed that a computer being able to solve an algorithm is a sign of intelligence."
      "Knows what they're talking about" in your biased opinion, maybe. I think the point that others are trying to make is that your definition of "intelligence" seems to be "sufficiently impressive and mysterious", a definition that many others share and have shared, and a definition that has suspiciously changed over time.

      As a practical matter, I'm inclined to agree with you about the current state of AI, computation vis a vis human intelligence. Nothing we've accomplished in AI seems to me to be "sufficiently impressive" to warrant being called "intelligence". Nevertheless, I'm perfectly aware that my (and other people's) intutive sense of what "intelligence" is is incredibly unrigorous and subjective and that, putting all irrational and chauvinistic sentimental essentialist preconceptions aside, qualitatively "intelligence" probably has little or no meaning. In some sense, maybe all computations are "intelligent" and what computers can already do is at least minimally intelligent.

      Personally, I think that intelligence is apparently intentional behavior that defies as a practical matter a fully reductionist description (it's an emergent property of a complex system). But "apparently intentional" and "defies as a practical matter" are variables that are currently very anthropocentric. While it is true that I think that practically nothing in the universe is perfectly reductively describable and that human behavior, compared to most physical phenomena is quite complex--I also think that a sufficiently greater alien intelligence would see human behavior as being quite a bit more reductive and deterministic (and simple and explicable) than we ourselves do.

    50. Re:Aritificial Intelligence by JustLikeToSay · · Score: 1

      (Although white to win has been proven) - I missed that, can you give a reference? I would have thought zugzwang wuld be hard to get around.

      --
      I know the truth and I know what you're thinking
    51. Re:Aritificial Intelligence by JustLikeToSay · · Score: 1

      As I have pointed out elsewhere here, have you / the proof taken account of zugzwang (the fact that you have to move even though you don't want to because any move you play worsens your position). Therefore the advantage of 'the move' which could lead one to think white must win could prove to be a disadvantage at a key point in 'the perfect game'.

      --
      I know the truth and I know what you're thinking
    52. Re:Aritificial Intelligence by LordKronos · · Score: 1

      The state space of chess has some 10^120 states, larger than the number of particles in the universe.

      Large? Yes, but not that large. Being overly simplistic, each peice can be in one of 65 states (64 different squares, or not on the board) and you have 32 pieces. Thus your state space is at most 65^32 which is about 10^58. However, this is a major overestimation, since you can't have 2 pieces in the same space, bishops can only occupy exactly half the spaces, pawns are roughly 1/2 also, and a few other limitations. In all, I think the number of legal states is roughly 10^40 (give or take a few zeros).

      Still, that's probably more than the total amount of storage space ever produced. So your point is still valid, just not your numbers.

    53. Re:Aritificial Intelligence by hoggy · · Score: 1

      Large? Yes, but not that large. Being overly simplistic, each peice can be in one of 65 states (64 different squares, or not on the board) and you have 32 pieces. Thus your state space is at most 65^32 which is about 10^58. However, this is a major overestimation, since you can't have 2 pieces in the same space, bishops can only occupy exactly half the spaces, pawns are roughly 1/2 also, and a few other limitations. In all, I think the number of legal states is roughly 10^40 (give or take a few zeros).

      You're not taking into account time. Starting from the beginning of a match, there are x possible moves that can be made. For each of those there are y_(1..x) possible replies. For each of those replies there are then a further set of possible second moves by white, etc...

      The state space of chess is not all possible boards, but all possible games.

    54. Re:Aritificial Intelligence by blue+trane · · Score: 1

      What about the multiverse theory?

    55. Re:Aritificial Intelligence by etcshadow · · Score: 1

      Well, it's not like there is necessarily *one* and only one such statement. It's just that the method of the proof (which, to get it straight, simply says that the set of all statements about integers is not possibly both complete and consistent) *demonstrates* the existance of one such statement (it does not limit it to only that statement... in fact, it would be trivial to show that there are an infinite number of such statements, just tack on something trivial).

      Also, it is not a "'true' but unprovable statement", per se. It is exactly what the theorem states, not both consistent and complete. More directly: you cannot have any sort of codex of all the statements about integers, and a little flag next to each one saying whether it is a true statement or a false statement. It cannot be both _complete_ (that is, every statement contained), and consistent (that is, that the trueness/falseness flag is correct on every single one). And that is essentially because one of those many statements is (grossly paraphrased):

      This statement is false.

      Anyway... You're totally right about the parent post, though. WTF?

      --
      :Wq
      Not an editor command: Wq
    56. Re:Aritificial Intelligence by stanmann · · Score: 1

      No, the metagame of chess ie playing your opponent is just as important as the root game. However, in human vs computer, the metagame must be played based on knowledge vs observable behaviour. Which is why computer poker isn't a popular game, because poker is the metagame. It isn't about gloating or trash-talking it is about watching how your opponent reacts to certain lines of play, and how he reacts to your diverting him from "prefered" lines of play.

      --
      Food not Bombs is a nice platitude but it breaks down when you notice that the Bombees are usually well fed
    57. Re:Aritificial Intelligence by peter · · Score: 1
      > I don't understand why people are not grasping the distinction.

      I guess you missed the last sentence of the paragraph of mine that you quoted from:

      I suppose it's possible that the existence of such an algorithm could be proven without actually discovering such an algorithm. AFAIK, this has not been done.


      Anyway, thanks for the rec.games.chess link.
      --
      #define X(x,y) x##y
      Peter Cordes ; e-mail: X(peter@cordes , .ca)
    58. Re:Aritificial Intelligence by LordKronos · · Score: 1

      Your terminology is wrong. State space refers to the number of possible states a game can be in. If you play the entire game moving your knight back and forth between 2 spaces, you can make an infinite number of moves, but that is still only 2 states. To "solve" the game of chess, all you need to know are all the different states and which states transition to which (this is implied by the rules set). You can then process it in whatever fashion necessary(minimax).

      Of course, this is all easier said then done. Not only do you have the huge storage requirements for the set of states, but the minimax tree is much much bigger than even that (but it is not infinite). And the time to process that tree would be huge. I'm not holding my breath for it, but it is at least theoretically possible.

    59. Re:Aritificial Intelligence by tpengster · · Score: 1

      You are correct. There are 2^120 states. Thank you.

  10. Re:so ... by 1984 · · Score: 3, Insightful

    If it were as simple as "the computer is no better at chess than those who programmed it" well then those folk be better than Kasparov. I'm guessing even that whole Deep Jr. team might not be so convincing playing (collectively) as humans against Kasparov.

    What do you think of as a practical application, by the way? (Serious question)

  11. Re:3D Chess??? by jdogg1988 · · Score: 0

    How the hell does chess in 3d do anything?

    I think it has something to do with making chess more interesting than it actually is. I really don't think chess was ever really meant to be a spectator (sport ?).

    --
    You get super powers just by rubing that stuff in? You'd a thought you would have to freebase it
  12. Re:so ... by Prune · · Score: 1

    >>the computer is only capable of doing what a human programs it to

    With that logic:
    --the human is only capable of doing what nature programs it to

    Your argument is nonsensical and shows a lack of knowledge about AI. If you study computer science and cognitive psychology you will see that humans and AI programs use some very similar algorithms in many regards, including game playing, object recognition, and planning. Both humans and computers use search as the main algorithm in chess playing, though the nature of the heuristics and search tree pruning is different. Human brains and computers are both computational devices and have the same theoretical limitations on information processing.

    --
    "Politicians and diapers must be changed often, and for the same reason."
  13. Re:so ... by Anonymous Coward · · Score: 0

    i thought unreal tournament did that already with bots.

  14. A lesson in PR by digiZen · · Score: 1, Interesting

    An interesting lesson in PR: How a massive company can excel in technology, make a best-of-breed machine, and still fall flat on its face because of corporate secrecy and mismanagement of information.

    Yup, I think IBM bungled that one up pretty good. They win against Kasparov with an incredibly powerful machine, and then take their machine apart. Refused to divulge further information. Refused to play a rematch. I wonder who at IBM thought that corporate secrecy and indifference was going to win them good will of the community? Or maybe they had something to hide?

    So, does secrecy make for good PR? Did this give a black eye to IBM?

    1. Re:A lesson in PR by Best_Username_Ever · · Score: 1

      Did this give a black eye to IBM?

      I don't think IBM care, they are simply paying for the exposure. Regardless of what happens, IBM gets a headline for developing something that is perceived to be leading edge technology. Even if Kasparov wins, IBM doesn't lose.

  15. There are 3 stages of a chess game... by $$$$$exyGal · · Score: 1, Insightful

    The three stages of a chess game are "opening", "middle game", and "end game". In summary, computers will always be far superior in the opening and end-game, because they can play those parts of the game perfectly. The middle game is where humans will always have the advantage.

    --sex

    --
    Very popular slashdot journal for adul
    1. Re:There are 3 stages of a chess game... by RyLaN · · Score: 1

      there was, (or still is, i dont remember) a distributed computing project to map out all possible end games, and put them on a local internet server. the point being, that anyone with a large amount of disk space could access the perfect moves for end game. when i last heard, they were up to 7 pieces on the board, and each combo fit compressed onto a dvd.

      --
      At least the war on the environment is going well
    2. Re:There are 3 stages of a chess game... by phantumstranger · · Score: 4, Insightful
      That is unless the true line goes so deep into the middle that it really creates no middle at all.

      For instance, there are more lines for 1. e4 than any other and some of those lines, if played right, can go 40 moves and more. At that point the opening overlaps the middle and the only way to be win by suprise (read creativity) is to find a new line. But in creating the new line - which can amount to one different move throughout the sequence that creates new possibilities, or lines - you are, as a byproduct, creating a new opening.

      So I want to offer this - The game of Chess is where humans will always have the advantage. But machines can help us by figuring out which lines are well thought out and which ones have flaws. The counter to that is that we are the only ones that can think out the lines in the first place!

      --
      "From of old, there are not lacking things that have attained Oneness." - Lao Tzu
    3. Re:There are 3 stages of a chess game... by Anonymous Coward · · Score: 0
    4. Re:There are 3 stages of a chess game... by Anonymous Coward · · Score: 0

      Who the fuck is this dumb bitch? Is she CmdrTaco's wife or something? She gets modded up for whatever stupid-ass, obvious comments she makes. I can understand trying to flatter some dumb broad, but this kind of blatant moderator catering is outright idiocy.

      I hate you, I hate you, I hate you. Bitch.

    5. Re:There are 3 stages of a chess game... by Anonymous Coward · · Score: 0

      It's some guy karma whoring.

      HotTeenSlut

    6. Re:There are 3 stages of a chess game... by jomagam · · Score: 1

      Yes and no. The computer is good in the openings only because of 100+ years of experience and reseasrch are programmed into its opening database.
      There was an experiment done to slightly change the opening position by swapping the knights and bishops and even the best computres looked terrible and lost very quickly to 2400+ level players.

    7. Re:There are 3 stages of a chess game... by Anonymous Coward · · Score: 0
      "So I want to offer this - The game of Chess is where humans will always have the advantage."

      Why are you offering that? Computer hardware is advancing at a tremendous rate. Computer science is likewise young and advancing. Computer chess will advance to the point that no human will be able to win. There is no evidence to the contrary.

      I guess what I'm getting at is... what human need pushes you to assert "... humans will always have the advantage."? In the back of your mind are you making the case that we will not be overwhelmed by computers in an epic battle for our humanity? Nonsense.

      Cars can drive hundreds of miles per hour, yet we still have short and long foot races between humans. Humans will still play chess among themselves even when the only challenge for a computer is another computer.

    8. Re:There are 3 stages of a chess game... by Anonymous Coward · · Score: 0

      That's pretty interesting. I wonder if a sufficiently powerful computer could ever take chess apart in much the same way a game of tic-tac-toe could be analyzed. That is, at what point can the computer determine if it can absolutely force mate or determine that the game's a draw?

      So human plays e4. Computer says, "Mate in 40. Surrender?"

    9. Re:There are 3 stages of a chess game... by use_compress · · Score: 1
      summary, computers will always be far superior in the opening and end-game, because they can play those parts of the game perfectly.
      While computers memorize hundreds of openings, they are not programmed to improvise upon opening moves. There are simply too many permutations of possible moves for a computer to improvise effectively. Humans, however, can intuitively modify classical openings, giving them an advantage over computers. On the other hand, only a savant could memorize as many openings as a computer. Therefore, computers cannot play the opening game "perfectly."
    10. Re:There are 3 stages of a chess game... by greppling · · Score: 1
      Frankly, I think your comment is quite some way off.

      About "endgame", computers are only superior once they reach their pre-computed database, i.e. endings with 6 pieces or less. Otherwise, endgame is definitely the weakest part of their game.

      Generally speaking, the strength depends rather on whether the position is highly tactical, with many variations to read out (Computers win, of course!), or whether it involves more strategic planning (where humans are still superior -- but computers are catching up!).

      Most middle games are pretty tactical, and therefore your claim about weakness in the middle game isn't very true, either.

    11. Re:There are 3 stages of a chess game... by Anonymous Coward · · Score: 0

      nobody has done seven man egtb's. all five man egtb's take around 5-7 gigabytes of diskspace and six man tables take around 1 terabyte. now if i only could get my hands on some 32 man tablebases... i could beat kasparov...

    12. Re:There are 3 stages of a chess game... by God!+Awful+2 · · Score: 1


      The three stages of a chess game are "opening", "middle game", and "end game". In summary, computers will always be far superior in the opening and end-game, because they can play those parts of the game perfectly. The middle game is where humans will always have the advantage.

      Funny... a friend and I were just talking about this. "Always" is a popular word in some /. readers' vocabulary, and usually the hallmark of a dumb post.

      In fact, very few humans are able to match the current crop chess machines in the middle game. In 5 years, I would be very surprised if Kasparov was able to win even a single game off the next generation Deep Junior.

      -a

  16. an assumption by Trepidity · · Score: 1

    You assume that there is such a thing as an "unsolvable" game. This is not, as far as I know, established. There are certainly things with a near-infinite number of potential solutions, but this is not the same as being unsolvable. Even subjective things (such as producing pleasing music) could theoretically be solvable given enough neurological data (i.e. a computer could use the data on how the human brain interprets music to compose music it knows to be pleasing to at least a certain segment of the population).

    1. Re:an assumption by Pavan_Gupta · · Score: 1

      Nonetheless, he (the guy who trepidity just replied to) makes a good point ... nothing, in the near future at least, will likely solve something to infinity. It's especially not feasible in a timed chess game.

      Still, chess cannot be the defining milestone for Artificial Intelligence... the computer is not deviating from it's predefined set of rules.

      It's not thinking.

    2. Re:an assumption by Anonymous Coward · · Score: 0

      "the computer is not deviating from it's predefined set of rules"
      Surely alowing it to deviate would have to be predefined, would it not.

    3. Re:an assumption by Jester99 · · Score: 3, Informative

      You assume that there is such a thing as an "unsolvable" game. This is not, as far as I know, established. This is not, as far as I know, established.

      Sure it has. I'll give you an unsolvable game right now.

      The source code to an entire program is written out by a game master. Two copies of the source are printed out. Two players are then each given an identical copy of the source, and a set of arguments that would be passed to the source were it compiled & executed. The goal is to determine if the program will exit correctly, or if it will halt in the middle. The first player to show either a) where it will halt or b) that it won't halt, wins.

      This is a game version of the halting problem. It's been mathematically proven intractable; that is, there's no deterministic (e.g., algorithmic or procedural) method of doing this. You cannot write a computer program that will execute a set series of steps every time and determine what's the case here.

      Is this game fun? Probably not. :) But that doesn't take away from the fact that an intelligent human could look at a source printout and figure out if it halted or not, but no general algorithm can be deduced that would do so. Thus, for a computer to win at this game, it would actually have to show intelligence, and not raw computational skill.

    4. Re:an assumption by Anonymous Coward · · Score: 1, Insightful

      You are assuming that an intelligent human is capable of determining whether a given program will halt on a given input. Even assuming a human who lived for ever and never got bored, it's still far from given that human intelligence is sufficiently more powerful than a turing machine to solve the halting problem in general.

      The halting problem doesn't mean that no algorithm can give correct halting answers for certain inputs.

      (Assuming such a game existed, how would you judge the results?)

    5. Re:an assumption by Anonymous Coward · · Score: 0

      > You assume that there is such a thing as an "unsolvable" game. This is not, as far as I know, established.

      Cricket

    6. Re:an assumption by JohnFluxx · · Score: 1

      If a human was more powerful than a turing machine, and hence could solve the halting problem, then surely this would mean we could never understand our own brain? (because as soon as we could, then the halting problem kicks back in)

    7. Re:an assumption by gwernol · · Score: 4, Insightful

      Is this game fun? Probably not. :) But that doesn't take away from the fact that an intelligent human could look at a source printout and figure out if it halted or not, but no general algorithm can be deduced that would do so. Thus, for a computer to win at this game, it would actually have to show intelligence, and not raw computational skill.

      I was with you right up to the end. However it is most certainly not shown that a human can solve the halting problem. It is proven that (in the general case) no algorithm can say whether a program halts. The only way a human can prove whether an algorithm halts is by using mathematical formalisms that are also limited.

      What people can often do is make an "intelligent" guess about whether a program halts. In fact computers can do this too: you can provide a machine with a set of heuristics (rules of thumb) that it can use to estimate the likelihood that a program will halt. That program could do better than random, just as a human could. But that is not the same as proving the program does or does not halt.

      I have never seen any evidence to suggest that humans can solve the halting problem for the class of unsolvable programs.

      Nevertheless you are right that there are unsolvable games. In fact there are an infinite number of them.

      --
      Sailing over the event horizon
    8. Re:an assumption by Tiro · · Score: 1

      Couldn't you write a program to play this game in perl?

    9. Re:an assumption by ey6es · · Score: 1

      But that doesn't take away from the fact that an intelligent human could look at a source printout and figure out if it halted or not, but no general algorithm can be deduced that would do so.

      Consider the case in which the source code distributed represents a complete simulation of one of the players. That is, it contains his genetic profile, encoded representations of all of his experiences, and any other input data that may have shaped his existence up to exact point at which he makes the game's crucial decision.

      Now, modify that source code so that if the simulated player chooses "doesn't halt," the program enters an infinite loop (just as one would do to demonstrate the limitations of algorithms). If "he" doesn't halt, he loses. If "he" halts, he also loses.

      Obviously, this depends on the ability to algorithmically simulate human consciousness, and there are some who say that this is not possible. However, my point is that people are often too quick to turn to the halting problem as proof that human intelligence is somehow fundamentally superior to algorithmic intelligence, when in fact we don't know for certain that they're not equivalent.

    10. Re:an assumption by Anonymous Coward · · Score: 0

      I'm confused. This source code is a computer program. If you write an interperter/virtual machine, you can run the code on the VM. Thus, a set of algorithms, the VM, can predict the outcome of inputs, by actually running through the program.

    11. Re:an assumption by tmortn · · Score: 1

      ummmmm GIGO, the compiler knows where it halts or if it exits after all without it, it won't run anyway. No matter how you abstract the halting problem you still ahve to establish a syntax with set rules and syntax is what a computer follows better than a human.. in fact in this case the syntax and resultant compiler defines in and of itself where it halts or exits thus the compiler solves the halting problem in a manner of speaking which is why most people these days debug code by running it and letting the chine show them where it hangs then they waste their brain cells on figuring out why it hangs when they KNOW it shouldn't.

      --
      I don't ask you to be me. I only ask you not expect me to be you.
    12. Re:an assumption by frankthechicken · · Score: 1

      Ahh, I take it your English, as far as I know, Australians appear to have solved this particular game.

    13. Re:an assumption by egomaniac · · Score: 4, Insightful

      But that doesn't take away from the fact that an intelligent human could look at a source printout and figure out if it halted or not, but no general algorithm can be deduced that would do so.

      Complete, utter, and unmitigated bullshit.

      If it can't be solved algorithmically, humans can't solve it either. Even if a human came up with the right solution, in the general case, you would never be able to prove it!

      Simple example: I write a program which "solves" chess. In other words, it loops through every possible game configuration and determines whether, say, white can always force a win. If so, it halts. Otherwise, it just drops into an infinite loop. Now, naturally, this game would take longer than the universe's lifespan to run, but that's not the point. The point is that determining whether or not this program halts is equivalent to solving the problem in the first place! To know whether or not it halts, you have to know whether or not white can always force a win. The halting problem is equally unsolvable for both man and machine. We both use algorithms, even if we don't understand our own algorithms. The fact that we do use algorithms means that we're just as subject to the rules of what is and is not computable.

      Put in other terms, a computer simulating a human brain would be able to solve the exact same problems as a human, and in the same ways. If a human can solve a problem (and prove it, not just make an intelligent guess), then it's by definition computable. The only counter to that is to assume that it is impossible to build a computer that simulates a human brain, but you're on shaky ground making such a claim.

      --
      ZFS: because love is never having to say fsck
    14. Re:an assumption by Anonymous Coward · · Score: 0

      How about some random rule generation from a natural random source.

    15. Re:an assumption by David+Price · · Score: 2, Interesting

      Here's an interesting exercise that one of my professors pointed out:

      int n = 4;
      while (n is the sum of two primes) n = n + 2;

      The question "is n the sum of some two primes?" is of course always computable in finite time; just try all the prime numbers less than n/2 until you find one that is different from n by another prime number.

      If you can show whether this program halts or not, then congratulations, you've solved the Goldbach conjecture, one of the most famous open problems in mathematics.

    16. Re:an assumption by FrangoAssado · · Score: 1
      But that doesn't take away from the fact that an intelligent human could look at a source printout and figure out if it halted or not, but no general algorithm can be deduced that would do so.

      Well, that's what you're saying...

      If you remember ol' Turing's proof, it goes like this:

      Say we have a function H that gets the source of any program as argument and returns TRUE if the program halts, or FALSE if not. Now, it's easy to construct a program P that feeds its own source to H and halts if H returns FALSE, or goes into an infinite loop if H returns TRUE.

      This clearly is a paradox: P halts iff it doesn't halt; so it's not possible that H exists.

      Now, there's something some people don't realise: for this to work, it's necessary that H is included in P (hence H is smaller than P). It's still possible (I don't think it has been proved) that each program P has an associated function HP that decides if P halts or not (it may be the case that HP is bigger than P, hence Turing's proof don't apply).

      Your argument only works if you think the human brain does some "magic" and avoid computing at all.

      I think the human brain has limited power, so it can only generate H to a given size (well, if you have pen and infinite paper AND you know some algorithm to generate HP given P (again, no one proved THIS is impossible) you could generate an H of any size -- the same way a computer with infinite memory AND the said algorithm could.

    17. Re:an assumption by Anonymous Coward · · Score: 1, Informative

      > The halting problem is equally unsolvable for both man and machine. We both use algorithms, even if we don't understand our own algorithms.

      This has not been proven. Roger Penrose wrote a couple of interesting books about the subject. You are right though that it is also not proven that humans can solve the halting problem in the general case. But your assumption that all mathematical proofs are merely algorithmic (= expressible through formal systems) is certainly debatable, at least.

      >Complete, utter, and unmitigated bullshit.

      Don't be such an egomaniac.

    18. Re:an assumption by Anonymous Coward · · Score: 0

      The real point is, it isn't much of a game, since there is no good way to keep score. There is no way to tell if the human or computer has the correct answer (the halting problem again). Unless of course you judged them on penmanship.

    19. Re:an assumption by jareds · · Score: 1

      It's still possible (I don't think it has been proved) that each program P has an associated function HP that decides if P halts or not (it may be the case that HP is bigger than P, hence Turing's proof don't apply).

      It is not possible. Consider the program A that takes as input the description of a program B and input W to the program B, and simulates B on input W, thus halting iff B halts on input W. Then, the associated program HA is exactly the program H which does not exist. (I assume what you mean is that the program HP takes a given input and returns TRUE or FALSE depending on whether P halts on that input. If we're talking about programs that don't take input, then of course HP exists because either the program that always returns TRUE or the program that always returns FALSE is HP for given P.)

      (well, if you have pen and infinite paper AND you know some algorithm to genereate HP given P (again, no one proved THIS is impossible) you could generate an H of any size

      This is more obviously impossible. If you have an algorithm C that generates HP given P, then I can exhibit an H: on input P, run C on P to get HP, and then execute HP. However, H does not exist, so C does not exist.

    20. Re:an assumption by zurab · · Score: 1

      Sure it has. I'll give you an unsolvable game right now.
      [snip]
      Thus, for a computer to win at this game, it would actually have to show intelligence, and not raw computational skill.


      As has been pointed out already you are right about unsolvable games. Not so about how machines can interact. As with chess, a solvable game in itself, computer is given a set of prior "knowledge" about the game, the allowed moves, conditions, rules, winning conditions, etc. Based on this knowledge sets of computations can be performed that will allow the machine to derive the next best move and/or arrive at the best possible scenario.

      Thus, what you refer to "intelligence" in this case is entirely dependent on (1) quality and quantity of initial knowledge and (2) computational power and logic. In fact, the chess programs today are not written to play it as a solvable game.

      What I and many others would refer to intelligence has to involve interactive learning ultimately resulting in the ability to modify, add to, or correct both (1) and (2) above. In a lot of cases where AI or intelligence is mentioned does not really refer to this, but rather either none or at best partial learning abilities.

      It seems to me that in most unsolvable game scenarios sufficient (1) and (2) can be applied to arrive at a calculated best guess. Intelligence would actually involve, among other things, the ability to modify (1) and (2) through interaction.

      But what do I know, these are only my thoughts.

    21. Re:an assumption by egomaniac · · Score: 1

      This has not been proven. Roger Penrose wrote a couple of interesting books about the subject.

      I believe that Penrose is wildly off-base, personally. His application of Godel's incompleteness theorem is faulty, and that destroys the central tenet of many of his arguments.

      I must stress that when I say "computer" I do not mean "Turing machine". I consider the brain a computer, although a fantastically complicated and delicate one which cannot be expressed as a Turing machine. To suggest that we cannot build a computer capable of thinking like a human is to suggest that we cannot possibly create an artificial duplicate of the human brain, which is patently absurd in my opinion. We make new brains all the time, just by having sex with one another. What physical law would permit us to create brains by having sex, but prevent us from manufacturing them artificially?

      But your assumption that all mathematical proofs are merely algorithmic (= expressible through formal systems) is certainly debatable, at least.

      My statement was that humans cannot (in general) solve problems that computers cannot solve, since we are computers. Again, "computer" does not necessarily mean "Turing machine", and most computability proofs apply specifically to Turing machines and are therefore not relevant.

      --
      ZFS: because love is never having to say fsck
    22. Re:an assumption by kmellis · · Score: 1
      " However, my point is that people are often too quick to turn to the halting problem as proof that human intelligence is somehow fundamentally superior to algorithmic intelligence, when in fact we don't know for certain that they're not equivalent."
      Right. In this example and in the other anti-AI example of Godel Incompleteness, it is simply assumed that a human can do what a computer cannot, and then that assumption is used to demonstrate that a human can do what a computer cannot. Hmm.

      People don't think that they're being tautological, which is ironic because (if they are being tautological) their mistake is in misunderstanding what it means to "think" something. A human might do a pretty good job at "solving" as a practical matter specific examples of the halting problem, and clearly we seem to recognize the "truth" of the Godel statement. But in both cases it's important to ask: are we truly doing what it is that we assume we're doing? This is the question that the anti-AI advocates never really ask, they just assume that we are doing what it "feels like" we're doing...an assumption that is quite convenient for their argument.

      Searle's Chinese room argument, for example, assumes without explanation that a person who knows Chinese "knows" in some "deep" sense while the Chinese room construction does not. But while his thought experiment seems to be rigorously contructed, it inexplicably is very non-rigorous when it fails to carefully try to pin down what it means to "know Chinese". Instead, he appeals to the reader's intuitive assumptions of what "know" means, and then uses that to prove that a computer can't "know" something in a similar fashion. But the real AI argument is that perhaps we don't "know" things in this almost-mystical (or truly mystical!) sense that Searle (and others) assume. Their arguments all really boil down to variations of "Yes, we do". That's not an argument. It's an appeal to sentiment.

    23. Re:an assumption by God!+Awful+2 · · Score: 1

      Roger Penrose is a widely respected mathematician whose inane babblings on AI threaten to forever taint his good name.

      -a

    24. Re:an assumption by dkf · · Score: 1
      But that doesn't take away from the fact that an intelligent human could look at a source printout and figure out if it halted or not, but no general algorithm can be deduced that would do so.

      Presuming you claim to be intelligent, are you saying that you could look at any program (in a language you know) and determine whether it halts? Because that'd be impressive if verifiable. I suspect that Kurt Gödel and Alan Turing would probably beg to differ, but they're only dead mathematicians, so what do they know!

      --
      "Little does he know, but there is no 'I' in 'Idiot'!"
    25. Re:an assumption by Anonymous Coward · · Score: 0

      The only counter to that is to assume that it is impossible to build a computer that simulates a human brain, but you're on shaky ground making such a claim.

      We've got our hands full simulating a single protien for the moment thank-you-very-much.

    26. Re:an assumption by jejones · · Score: 1

      OK, but--if the program doesn't halt, when will you get that answer from the VM? You could say "if it hasn't halted in a year, it probably won't," but you'd be wrong, because there are mind-numbingly slow algorithms that are in fact algorithms (e.g. sort an array by iterating through all possible permutations and checking for sortedness after each permutation, or any algorithm to solve an NP-complete problem).

    27. Re:an assumption by Jester99 · · Score: 1

      What's this? A troll! Eh, I'll bite.

      Nope. But then again, I never claimed that I could win any chess match versus any grandmaster, either. :)

    28. Re:an assumption by Anonymous Coward · · Score: 0

      The point is that determining whether or not this program halts is equivalent to solving the problem in the first place! To know whether or not it halts, you have to know whether or not white can always force a win.

      That is not the point either. Whether or not white has a winning strategy is something a computer (with sufficient storage space and computation time) could tell you. The only reason a human could not figure it out is because of life span (and/or boredom). It has nothing to do with the comprehensive capability of the human mind.

    29. Re:an assumption by FrangoAssado · · Score: 1
      It is not possible. Consider the program A that takes as input the description of a program B and input W to the program B, and simulates B on input W, thus halting iff B halts on input W. Then, the associated program HA is exactly the program H which does not exist.

      Ok, but I didn't say there's such a program A that works for ANY program B, that's exactly my point -- maybe for each program B, there exists a (unique) corresponding program A that does what you describe.

      This is more obviously impossible. If you have an algorithm C that generates HP given P, then I can exhibit an H: on input P, run C on P to get HP, and then execute HP. However, H does not exist, so C does not exist.

      Bad wording on my part. When I said "no one proved THIS is impossible" I meant you can generate HP given P, not that *there is* such generic algorithm: this would clearly be impossible.

      Still, it might be possible that exists an algorithm that generates HP given any P up to some defined size.

    30. Re:an assumption by jareds · · Score: 1

      Ok, but I didn't say there's such a program A that works for ANY program B, that's exactly my point -- maybe for each program B, there exists a (unique) corresponding program A that does what you describe.

      Program A in my argument is a trivial simulator, a.k.a. a Universal Turing Machine. It is well known that it exists. I understood your claim perfectly: for every program M there exists some program N that decides whether M halts on given input. Such a program N cannot exist for the the program A that I described, which takes programs as input and runs them, because then that particular program N would solve the halting problem. I clearly never said that any program would be required to algorithmically find such programs N, but merely that the existence of such a program N for every program N implies that the halting problem is decidable.

      Bad wording on my part. When I said "no one proved THIS is impossible" I meant you can generate HP given P, not that *there is* such generic algorithm: this would clearly be impossible.

      Before you said "algorithmically generate", which is clearly impossible as you admit. Now you say "you can generate HP given P". Are you trying to say that humans can do things that cannot be done algorithmically? In any case, it is still false. As I proved earlier, HP does not even exist for every P, so it is not possible to generate HP given P in general. This is true for any entity whatsoever, regardless of its intelligence, computational resources, creativity, omnipotence, etc.

      Still, it might be possible that exists an algorithm that generates HP given any P up to some defined size.

      Sure, as long as the size is small enough that HP actually exists for every P in question. Then, since you'll be dealing with a finite problem, you can just do a table lookup.

  17. Re:so ... by azmaveth · · Score: 1

    Chess, like many sports, isn't enjoyable to watch if you don't know what's going on. Sure, you might have a basic understanding of the rules of the game, but if you don't know about strategy, tactics, etc, you won't see the genius behind the moves made. Sometimes you won't "get it" until a few moves later, since most of us can't see as far ahead as Kasparov or Deep Junior.

    Don't be so quick to judge something as "trite and dull" unless you're talking about yourself.

    -azmaveth

  18. I remain unimpressed by isoteareth · · Score: 3, Insightful

    I don't "get" the fascination people have with computers playing chess. Searching a game tree is not something I find overly impressive. The root problem (the tree searching algorithms and such) is somewhat interesting, but the computer isn't playing chess in the same way as a person. I don't really care how far down into a tree a modern processor has time to search. It doesn't indicate any sort of "intelligence" in the holy grail sense of AI. Chess is a very limited, structured problem.

    My calculator can find nth roots faster and with greater precision than I can...should I be fascinated by that as well?

    1. Re:I remain unimpressed by harks · · Score: 1

      No. But, I would be impressed if you could find nth roots as fast or faster than your calculator. I am amazed that humans can still beat machines (sometimes) at a game such as chess.

    2. Re:I remain unimpressed by ishmaelflood · · Score: 1

      I sort of agree, but you are assuming that your way of playing chess is better than the computer's way. The Turing test implies that it isn't the means but the result that is important.

      After all, a Ferrari is a much better way of getting down the road than walking is, and a Ferrrari doesn't have shoes.

    3. Re:I remain unimpressed by isoteareth · · Score: 1

      I make no such assumption. One is no better than the other, but they are different. Further, the fact that the computer can play chess well doesn't mean that the computer plays chess in such a way that it reliably creates the illusion of human play.

      In any case, MY way of playing chess is very different from a grand master, or even your run of the mill chess club member. I hate the game. When "forced" into it I play to lose.

    4. Re:I remain unimpressed by tpengster · · Score: 1

      I don't really care how far down into a tree a modern processor has time to search. It doesn't indicate any sort of "intelligence" in the holy grail sense of AI. Chess is a very limited, structured problem.

      There's no reason it must be that way. Nothing is stopping you from writing a logic engine to play chess moves. John McCarthy suggested that this would be extremely useful for reviving AI (I personally think logic is not a good foundation). Similarly nothing is preventing you from designing a neural network to output chess moves, or using any other system not heavily based on this structure of search.

      Whatever system you do come up with WILL require lots of computation. The human brain does a lot of computation, in a massively parallel fashion.

      I don't know what this holy-grail-type intelligence is that you speak of, but this is a common problem in AI: once something is solved, it's no longer considered AI! But just because some solution isn't "magic" doesn't mean its useless

      It's also important to note that search is neither solved nor unimportant. Every field of AI employs search at some level, in one form or another. (Searching the web, planning etc..) Chess was integral in pushing along some of those fields and may produce some useful results yet.

    5. Re:I remain unimpressed by Nidoizo · · Score: 5, Interesting

      I don't "get" the fascination people have with computers playing chess. Searching a game tree is not something I find overly impressive. The root problem (the tree searching algorithms and such) is somewhat interesting, but the computer isn't playing chess in the same way as a person. I don't really care how far down into a tree a modern processor has time to search. It doesn't indicate any sort of "intelligence" in the holy grail sense of AI. Chess is a very limited, structured problem.

      My calculator can find nth roots faster and with greater precision than I can...should I be fascinated by that as well?


      Don't take it personal, but your comment shows a lot of ignorance about chess AI. There's too much possible moves per turn in chess and I don't know of a chess program that calculates them all. Usually a program will calculate, let's say, around 10 moves. The job is there: evaluate the 10 best moves. Remember than even doing that, you still won't calculate very further. Suppose 10 moves per turn, one for black, one for white, it makes 100 moves per turn for both players. For only 7 complete turns you have to calculate 100,000,000,000,000 moves. It means your algorithm to evaluate positions needs to be very good, since, for example for a sacrifice, you only see calculable benefits after many more turns, sometime only in final.

      Like Kasparov, I very impressed to see a machine making an intelligent sacrifice; this is usually how you trap a computer. There's no doubt to me that Kasparov is still superior to any machine, but when machines begin to show some interesting moves, they begin to teach something. I'm a chess player and I understand chess enough to consider it an art. I can see emotions or genius in a game the same way some see it in painting. A big part of music is mathematical and if we're wise enough to build programs that create innovative chess games, maybe we can build some that create good melodies, who knows. I understand it may sound wierd for non-chess players to compare chess with an art, but creating a melody is also "a very limited, structured problem" and no one doubt it's an art. The main difference is that chess has a clear and easy to measure result. I don't think is "the holy grail sense of AI", but it is an important milestone in AI, no doubt for me.

      Regards,

      Nicolas Fleury
    6. Re:I remain unimpressed by isoteareth · · Score: 1

      Yeah, uhm, see, one prunes trees and doesn't search all the nodes. Yes, I'm aware that it isn't an exhaustive tree search. Yes, I'm aware that the game isn't "solved." No, you don't come off as clever in your post.

      Game tree algorithms have become very advanced. That still doesn't make me see a computer playing chess as something all that astounding. It's playing a game with simple rules and many presolved strategies. The tree is just so deep that one needs fast hardware and a decent algorithm to explore quickly and appropriately. Once you have actually have studied AI a bit, come back.

      "There's no doubt to me that Kasparov is still superior to any machine"

      That depends on the definition of superior. He doesn't appear to be superior at producing wins in the game of chess. He is superior in that he has many, many other skills beyond chess and far more flexibility than any machine.

    7. Re:I remain unimpressed by isoteareth · · Score: 1

      Interesting point.

    8. Re:I remain unimpressed by mikeg22 · · Score: 1

      It all comes down to move ordering. This is how a human plays, if I'm not mistaken. The reason a human can "sense" a good line and follow it so deeply as opposed to examining every possible line is because of a certain "intuition" the human has which affects how he/she orders his searches in his/her head. There is also the issue of strategy over tactics, but I believe this is just heuristics.

    9. Re:I remain unimpressed by Duds · · Score: 1

      My calculator can find nth roots faster and with greater precision than I can...should I be fascinated by that as well?


      Probably. I certainly am. It's a bit of sand doing maths ferchrissake.

      Maybe it's the geek in me but I'm fascinating when computers do pretty much everything.

      Especially if they're running ME.

    10. Re:I remain unimpressed by etcpasswd · · Score: 1
      maybe we can build some that create good melodies, who knows.

      I think this is a much harder problem than playing chess. Not only the combinatorial space is much larger, but there is no hard and fast rule for evaluating the quality of the combinations. Infact, any prior knowledge automatically implies lack of originality.

    11. Re:I remain unimpressed by daffmeister · · Score: 1

      It's not the searching, it's the evaluation of the position at the end of the search, usually only a handful of moves (relatively speaking) down the track.

      Both humans and computers do this the same way, evaluate a number of lines to a certain depth then evaluate the position. Computers, with their speed, can evaluate many more lines but not to any greater depth really. It's the evaluation of the position at the end (which traditionally favours the human) that is impressive.

    12. Re:I remain unimpressed by alienmole · · Score: 1
      I don't know what this holy-grail-type intelligence is that you speak of

      Not really talking about the current discussion re chess, but the ability to learn would be a good start in demonstrating "holy grail" style intelligence. In fact, that would make a good enhancement to Turing's test. Computers are already at the point where they can fool some humans into thinking that there's a human on the other end of the wire. That's because it's not a good enough test. A better test would be one in which you try to teach the entity on the other end something new, in English - for example, the rules of an invented game. If the entity is capable of learning those rules, and thus playing the game, it's intelligent. Otherwise, it's a mere executor of programs designed by someone else.

      While chess and Go make for interesting problems, assembling a bunch of intelligent-seeming preprogrammed behaviors doesn't really get us any closer to intelligent machines, in the sense in which we consider other humans intelligent.

    13. Re:I remain unimpressed by ebbomega · · Score: 1

      I wouldn't chalk that so much to Intelligence, though, as I would to skill....

      --
      Karma: Non-Heinous
  19. The New Challenge by pjdoland · · Score: 5, Funny

    I'll be truly impressed when a computer can show the creativity necessary to beat Bobby Fischer at developing crackpot political theories.

    --
    -- "The reward of suffering is experience." - Aeschylus
    1. Re:The New Challenge by kavau · · Score: 1

      Why? Don't you know that Deep Blue only faked his dismantlement, and is now secretly running both IBM and the CIA?

  20. If you can't beat them by Gothmolly · · Score: 1

    Call their methods, arguments and practices shoddy, shady, and sketchy.

    This sounds like a whine to me. He's pissed that he didn't win, but it's OK, since its "for science".

    -1, Crap

    --
    I want to delete my account but Slashdot doesn't allow it.
  21. Re:so ... by ATAMAH · · Score: 1

    > chess. how bout it. woo. how trite and dull. it's > one thing to play a game, quite another to watch a > couple guys (or one and a computer) fight the same > scenario over and over The above is true if chess is not YOUR game. Those who are trully interested (i.e. at least: members of a club, chess book readers etc.) find it to be quite interesting to follow.

  22. Re:so ... by TopShelf · · Score: 1

    The point is that the computer doesn't actually apply any more skill than its human creators - its advantage lies in the ability to process gazillions of iterations within the timeframe of the match. The creators could do the same thing, they'd just die of old age before making a handful of moves.

    --
    Stop by my site where I write about ERP systems & more
  23. Deep Blue's moment of brilliancy? by 00klaDM0k · · Score: 1

    Any chessheads know what Gazza is talking about here? Which game was it that he suspected intervention from Blue's handlers?

    1. Re:Deep Blue's moment of brilliancy? by Anonymous Coward · · Score: 0

      If I recall correctly it was a well-known knight sacrifice in the Caro-Kann (?) during the last game of the match. I think Kasparov assumed that the computer would be "unaware" of this move. It wasn't and he resigned quickly.

  24. View the games with Javascript by product+byproduct · · Score: 4, Informative

    The submitter didn't scour the web properly. You can view the games with professional commentaries with nothing more than a Javascript enabled browser at these links:

    Amir Ban annotation
    Karsten Müller et al

    1. Re:View the games with Javascript by Anonymous Coward · · Score: 0

      thanks! who needs 3D rendering of a chess match when all you need is javascript!

    2. Re:View the games with Javascript by Anonymous Coward · · Score: 0

      actually, so much for avoiding the proprietary Microsoft verion. The javascript games don't work in Mozilla-- they only work in IE!!

    3. Re:View the games with Javascript by Anonymous Coward · · Score: 0

      Works fine here. Check your Preferences -> Advanced -> Scripts & Plugins, and make sure you haven't crippled the JavaScript features it needs before you make a fool of yourself publically.

  25. Take that IBM by njord · · Score: 5, Interesting

    Kasparov really socks it to IBM in that article. I'm surprised at this reaction, considering that they probably paid him a LOT of money to go toe-to-toe with Deep Blue.

    On the other hand, it was pretty shallow of IBM to barely beat Kasparov, brag about it, and then DISMANTLE the historic machine! Considering the would-be artifact status of Deep Blue, I would have expected more from these people.

    At any rate, I'm just glad to see that the brute force approach is being abandoned for better heuristics. Anyone can write minimax for chess, the only special that IBM did was dump a couple million into hardware.

    njord

    1. Re:Take that IBM by Apotsy · · Score: 2, Insightful

      IBM deserves no end of crap about their behavior. "I'm only going to play one match, and if I win, I will retire undefeated!Ha ha!!"

    2. Re:Take that IBM by Thorgal · · Score: 1

      Your are obviosly wrong if you think that MiniMax alone, even coupled with processing power of DeepBlue could achieve anything. Read here about other factors involved.

      --
      "Man in the Moon and other weird things" - wfmh.org.pl/thorgal/Moon/
  26. eek ... by styxlord · · Score: 1

    Well, I was interested in watching the matches but not really interested in installing a proprietry viewer or installing media player 9.
    Where's the ChessGML version so I can view it using SVG?

  27. Shay Bushinsky by jbs666 · · Score: 5, Informative

    Chessbase has an interesting interview with Shay Bushinsky, one of the programmers of Junior.

    --
    I'm not a nerd, nerds are smart!
    1. Re:Shay Bushinsky by Dr.+Spork · · Score: 1

      This was a really interesting interview. Thanks for linking it!

    2. Re:Shay Bushinsky by BACbKA · · Score: 1

      Thanks for the link! Actually, I found it even more interesting than the article itself :-)

      --

      VKh

  28. Re:The main difference...MODS FUBAR by Anonymous Coward · · Score: 0

    why the hell is this funny?

  29. Re:so ... by James+Lewis · · Score: 1

    "the computer is only capable of doing what a human programs it to." I'm a Computer Science major currently taking an Artificial Intelligence course at Ga Tech. I am by no means an expert, but from what I have learned so far the ultimate goal of AI is to program programs that can deal with situations that they are not specifically programmed to deal with. AI isn't as simple as having one huge if/else if statement block. Or I should say, GOOD AI isn't about that. In my class we are currently learning "old" stuff, and all of that simply uses the computer's speed to make up for their lack of ability to produce algorithms anywhere near as good as whatever is going on inside a human's head, or even in some cases a fruit fly's head. Even a game as apparently simple as Chess (when compared to real life situations) has an enormous amount of possibilities, and while lots of computing power can search through those well enough to produce results like Deep Blue produced, that approach quickly becomes impractical with more complicated situations. The reason that Deep Junior is such a big deal is that it is using a lot less computing power than Deep Blue, which means it is a step in the direction of lessening AI's dependence on raw computing speed. "So what, it's chess" you say. Well, going to the moon in and of itself was rather pointless too, but all kinds of spin offs were produced which made the project worthwhile. That is the point that Kasparov is trying to make. It isn't beating Kasparov in chess that is so important, it is what we learn in getting there. The hope is that what we learn will be applicable to more meaningful situations.

  30. I'm not an AI guy, by bryanthompson · · Score: 1

    but I'm hearing a lot of 'the computer can only do what you tell it to' type posts... but I don't think it's that simple.
    The computer can look many many moves ahead from just about every possible angle and see where it could go. from there, it figures out what move will give it the best chance to win, at least mathematically.
    That doesn't exactly show a computer learning, but it does show some level of intelligence.
    I remember hearing before that the computer can look at all the past moves also. By doing this, the computer 'learns' the guy's style and can come up with a strategy for beating it... doesn't that show a lot more intelligence?
    Maybe I'm wrong and the computer is just looking at all the possible moves, but if the computer is learning his strategy, then I beleive that's really close to intelligence.
    anyway, I dont' think a lot of people will be sold on the idea until the computer gets up and kicks the guy in the head or scratches an itch.

    1. Re:I'm not an AI guy, by cookiepus · · Score: 1

      The computer has been taught, very explicitly, how to study possible future moves as well as to interpret past moves. That's the difference between intelligence and... well.. computer inteligence.

      I forgot who said this... (I am paraphrasing)

      Computers will be inteligent when, as the chessmaster sits down to play a game, the machine responds "I'd rather not."

    2. Re:I'm not an AI guy, by bryanthompson · · Score: 2, Insightful
      The computer has been taught, very explicitly, how to study possible future moves as well as to interpret past moves. That's the difference between intelligence and... well.. computer inteligence.
      Isn't that like saying that because you taught a guy how to fish, he's not intelligent just becuase he was taught? Just as the guy senses bites on the line, the computer sees offensive moves and counters.

      If a computer could be taught to fish, there'd be people saying that because the computer couldn't catcha fish 100% of the time, or because he was programmed to do it that way it's not intelligent. But... if we could find the perfect chess algorithm and the perfect 'catch a fish' algorithm and put them in a computer... could we say it had some real intelligence?
      Computers will be inteligent when, as the chessmaster sits down to play a game, the machine responds "I'd rather not."
      heh, nice :)
    3. Re:I'm not an AI guy, by Anonymous Coward · · Score: 0

      the computer wasn't taught. It was programed. (I think anyway) Teaching someone to fish is fundamentally different from teaching a computer to play chess. In the one instance, you are communicating at a higher level. The human equivilant of teaching a computer to place chess would be to open up his brain-pan and rewire the neurons.(to an extent anyway) The human mind is not a compiler, and the human senses are keyboards and mice. They may be abstracted as such sometimes, but they really aren't.

    4. Re:I'm not an AI guy, by cookiepus · · Score: 2, Insightful

      Isn't that like saying that because you taught a guy how to fish, he's not intelligent just becuase he was taught? Just as the guy senses bites on the line, the computer sees offensive moves and counters.

      If all the guy could do was fish just like you taught him then yes he's not all that inteligent. The key difference is that from you teaching him how to fish, the guy might extrapolate a totally different way of fishing. A computer won't ever do that unless you explicitly program that extrapolation algorithm.

      I guess the point I am trying to make is that the computer won't make any discoveries unles you taught it HOW to make this discovery. Once you figured out a process, you can take advantage of the computer's computational abilities to calculate a result (chess moves, etc) better than a human can. How about the computer inventing something totally new, unprompted?

      THAT is inteligence, and that is (bad or good, your call) impossible given current tech.

  31. Re:so ... by joggle · · Score: 1
    There's more to it than that (as Kasparov says in his little article). He claims (as well as others) that the Deep Junior program was far superior to the program Deep Blue was using by virtue of its more intricate chess logic. It's really a blend between chess logic and brute strength that gives it the edge to compete with guys like Kasparov. As he said, there are nearly limitless possibilities in chess so you (or the computer) can really only imagine a relatively few number of moves in advance, so the program really does need a robust chess algorithm.

    Of course, in games with even more exponential growth in possibilities (such as the Japanese game go), it will probably be a number of years before AI programming can catch up with the masters.

  32. Re:so ... by Anonymous Coward · · Score: 0

    What do you think of as a practical application, by the way? (Serious question)

    3D real-time virtual midget porn. With force feedback.

    When this becomes a reality, my life will be complete.

    How does some silly board game bring me closer to that elusive goal?

  33. I am guessing.... by whazzy · · Score: 1

    ...that,the tournament fizzled out(kind of got under the radar screen of the Newsance(nuisance)generating US Media),because it resulted in a tie. NewsWeek,on that occasion,touted Kasparov to be the Human Brain's Last Stand This time,there was no such thing.Juss a cursory column in WSJ(oh,check the referring site,will ya!). It sort of puzzles me that he still grouses his loss against a measly machine,after all! oh well..whaddever!

  34. Big deal, I've played against Deep Blue as well by sailesh · · Score: 4, Interesting

    Heh .. seriously. Back in November 1996 the IBM Research guys exhibited DeepBlue at the IBM CasCon conference in Toronto. They had the program play a "top Canadian GM" and it dutifully defeated him. It was an exhibit in the demo section and anybody could play against it. While it was the very same software it was on a much slower RS/6000 hardware. I played against it, and of course got defeated very soon. I think around 17 moves but I don't recall correctly. This was after the Philadelphia match that Kasparov won 4-2 but before the rematch that was marred by controversy. The IBM guys said that on game 1 they had somehow or the other omitted to bring the "opening book" and had to ftp it over a slow connection. They only got it in time for game 2. Still believe Deep Blue won game 1 ! Apparently Kasparov was shaken and then walked the streets of Philadelphia all night long and promptly won the next game. http://www.research.ibm.com/deepblue/watch/html/c. 10.html As an IBMer (although I joined IBM about 1.5 years since) and a chess fan I am disappointed that the team refused to open up the project to more scrutiny. I still hope and believe that there was nothing inappropriate.

    1. Re:Big deal, I've played against Deep Blue as well by Decimal · · Score: 4, Funny

      I still hope and believe that there was nothing inappropriate.

      Indeed there was. Why do you think IBM was in such a big hurry to dismantle Deep Blue? There's still a coverup to this day -- turns out that huge "Deep Blue" box was hollow -- Kramnik was hiding inside of it the whole time.

      --

      Remember "Bring 'em on"? *sigh
    2. Re:Big deal, I've played against Deep Blue as well by sailesh · · Score: 1

      Call it an irrational belief if you will. Or perhaps because I met and talked with the researchers. Of course, I have no illusions on the honesty and integrity of big corporations. However, I do have faith in the integrity of individual researchers.

  35. The next level in AI will be... by Anonymous Coward · · Score: 0

    Achived when the computer gloats loudly at you during and arfter the game :P

    imagine how shot your nerves would be when the computer booms
    "I Have calulated your game 10000 moves in advance make your move puny human!"

  36. Re:The main difference...MODS FUBAR by WhiteBandit · · Score: 2, Insightful

    Because we have a sense of humor?

    Thanks.

  37. Re:so ... by sheddd · · Score: 1
    I'm guessing even that whole Deep Jr. team might not be so convincing playing collectively) as humans against Kasparov.

    I'd bet 100:1 (for Kasparov) on a match where he has to play each of them and loses if he loses a game to any of them.

    It's trivial to write a brute force chess program and with infinitely fast computers it would beat (or tie) anyone or anything that played against it.

    It does seem the Juniour developers have sone some interesting things to make their chess engine much more efficient than a brute force chess engine; I'd love to hear what they've done other than 'it make non-computer-like moves'. They may have a good chess strategist/programmer; perhaps a brilliant one but they don't tell us how their engine works so... yo Stallman, kick his ass!

    Practical application? Just doing things because they can be done.

  38. Re:3D Chess??? by Captain+Pedantic · · Score: 1

    So? Follow the match on own chess board - a far more satisfying experience.

    Using computer generated 3d to visualise a board layout is no more useful than having colour in newspaper's chess column.

    --

    None are more hopelessly enslaved than those who falsely believe they are free. Johann Wolfgang von Goethe.
  39. Re:3D Chess??? by Anonymous Coward · · Score: 0

    D'oh. Follow it on your own chess board.

  40. Someone is bitter by L7_ · · Score: 1

    It seems that Kasparov is bitter about losing in 1997 and is trying to get IBM to release the source for Deep Blue to check to see if the moves it made in thier match are actual coded instructions.


    He blatantly states that he thinks Deep Blue was fiddled with. He just wants some proof.
    1. Re:Someone is bitter by pribut · · Score: 1

      Kasparov did not request the sourcecode. What Kasparov was interested in was the ratings of moves to see if the moves considered by the computer were consistent and consistently rated by the computer.

      The computer will over time continue to evaluate a sequence of moves and will raise certain sequences to higher values then others.

      Evaluating the sequence of considerations and ratings for Kasparov meant that he might have been able to see if human intervention had occurred wherein a highly rated move by the computer was replaced "out of the blue" by one of the human grandmasters observing (Joel Benjamin among others, I think) and monitoring the operations (and passing on the moves) of Deep Blue.

      Many do think, however, that Gary:
      1) Did not play his best against Deep Blue in several games (the last was a complete disaster and others he missed excellent opportunities) .
      2) That Gary did appear a bit out of sorts, petulent, and angry at losing (to put it as politely as possible).
      3) But, there are valid reasons to request the computer evaluations of the moves (not the Source Code!)

  41. Sounds like the Turk to me by OzRoy · · Score: 2, Informative

    The Turk was a machine from the 18th century.

    A magician had apparently created a machine that could beat anyone at a game of chess. Before the match he would open up the machine and show everyone an array of complicated gears and machinery.

    The machine would then beat the person at chess.

    People believe that it was actually a very talented midget who would sit inside the machine and watch the game played via magnets. Unfortunatly no one has been able to study the machine because it was destroyed in a fire.

    Maybe Deep Blue is the modern day Turk.

  42. Certainly there are unsolvable games by kfg · · Score: 1

    Chaos theory can be used to prove it.

    The most trivial ( and for AI purposes useless) example is the single fair toss of a fair coin.

    Parchisi is a more advanced version. It is not resolvable to a guarunteed set of moves to ensure victory ( a draw being provably impossible).

    This is why games involving chance are so popular with the, ummmmm, populace. A five year old can beat an 80 year old who has been playing parchisi all of his life. Whereas the 80 year old will *never* lose a game of tic tac toe to the five year old, because it is not only solvable, it has been solved.

    Various form of games of cooperation are also unsolvable because it isn't even possible to define in advance what the goal is, let alone a stratagy to achieve it.

    Your point of view ( and that of many AI researchers) relies on the concept that universe is a predictable machine if one simply knows all the parameters, whereas it is now known that even if all the parameters are known results may be fundamentally unpredictable.

    KFG

    1. Re:Certainly there are unsolvable games by kmellis · · Score: 1
      Chaos theory has absolutely nothing to do with the toss of a coin. I can only try to guess at what you think you are trying to say. You seem to be arguing that a) the universe is not deterministic; b) human comprehension of the universe must be non-deterministic; c) all machine computation is necessarily deterministic; and therefore, d) computers cannot do what humans can do.

      All of those except the first are incorrect.

      Chaos theory, by the way, is deterministic. It just shows that determinisitc systems can exhibit "chaotic" behavior that is difficult to predict without duplicating the system.

      You seem to be synthesizing the bottom-up problem of the anti-determinism of quantum physics with the top-down problem of the apparently anti-reductionism of chaos theory. That is to say, the universe is non-deterministic because of QM, therefore human cognition is in some sense non-deterministic. Then, from the top-down view, human cognition is "impossible" to reduce to a deterministic system since it is obviously chaotic.

      That second proposition is a falsehood built on the misunderstanding of the truth of chaos theory. Chaos theory says that is is very difficult or impossible as a practical matter to identify all the properties of the deterministic system that give rise to chaotic behavior. Put another, a chaotic system is difficult to "reverse engineer". But that doesn't mean that it's not deterministic. You can easily produce chaotic output from a computer algorithm. Does that make your computer non-deterministic and human-like? Of course it doesn't.

      While the essential non-deterimism of the quantum world is without question, whether this results in an all-pervasive non-determinism in the macro world is an open question. I think most physicists would agree that, for the most part, the macro world behaves deterministically. It certainly seems to. Most of the varieties of applied physics assumes that it does, and they sure do seem to work. :) While people like Penrose and others have tried to link human cognition directly with quantum physics and thus place it in a "special" realm; this is, in my opinion, incredibly premature and irresponsible. And, anyway, such a view doesn't preclude the possibility of a artifical implementation of such a system.

      Your conclusion:

      " Your point of view ( and that of many AI researchers) relies on the concept that universe is a predictable machine if one simply knows all the parameters, whereas it is now known that even if all the parameters are known results may be fundamentally unpredictable.
      I don't know of any AI researchers that are relying on a deterministic universe in the sense that you imply; and, related to this, your second statement is true but misleading. QM may say that every physical process must not be absolutely predictable, but it also allows (and indeed relies upon) various degrees of unpredictability. The more macrocosmic a process is, the more predictable it is, to the point of being effectively determinstic. There is no currently persuasive reason to believe that human cognition is any less deterministic than any other macrocosmic process. Chaotic, yes; non-deterministic, no. You should be clear on that distinction.
  43. The fascination of chess AI by ThePyro · · Score: 2, Insightful

    The reason that computer chess fascinates so many people is exactly because brute force doesn't work. The possibilities are so enormous that you can't even begin to look at them all.

    In the most recent Man vs. Machine match, the computer was actually slower than Deep Blue. Yet it played amazingly good chess. Unfortunately Deep Blue isn't still around, so we can only speculate that Deep Junior is the superior program.

    Humans are slower still; MUCH slower. And yet we can, in many cases, play better chess than computers. The difference is that chess masters know instinctively which moves to consider while machines are stuck looking at a huge number of moves. The holy grail of chess AI would be to finally come up with program that can cut down the number of moves to consider just like the human brain can. Such a breakthrough would be a landmark achievement in AI and would have tons of practical applications outside of playing chess.

    I can agree with you on one point, though... chess "technology" probably puts too much effort into the game tree searching aspect of the problem.

    Most of the effort is being put towards better position evaluation algorithms, etc... In this way, chess programs are being improved by basically tweaking algorithms we already have and hard-coding in the programmer's own knowledge about the strategic value of certain positions. Things like "doubled pawns are bad" and "in a locked pawn structure a knight is worth more than a bishop".

    If we're going to make real progress we definitely need to move away from those approaches and start trying to get at the previously mentioned "holy grail" of chess. Brute-forcing human players to death shouldn't be the goal. We should instead focus on how the human mind approaches such an impossibly huge problem, and still manages to kick the computer's ass.

  44. /. interview by wowbagger · · Score: 4, Interesting

    Hey guys, see if you can get Gary to consent to an interview on /.

    I know the question I would ask:

    Given that "they" say computers own the opening and the endgame, while masters own the middle, what would you think of a match up of 2 chess programs and 2 grand masters (yourself being one) - with the computers to advise, but the master to make the final decision? Who would you want to play against (man and machine), and what program would you choose to be your assistant?

    1. Re:/. interview by BSDevil · · Score: 2, Interesting

      I think I can say with pretty good authority that he'd say no to this. Given any situation, when you have two people/things who beleive that they are very good at something trying to work together, neither is very interested in the other's advice. Each beleives they are superior, and as such, they follow their opinion.

      Another reason I don't think this idea would work deals with the long-term nature of chess. When selecting a move, you plan out that move as a preface to a series of other moves. I'm not sure which would be more difficult: having man explain its long-term strategy to the machine, or the other way around. Chess also deals with the individual style of the player; their school of Chess will influence how they play. If you reformulate this question as "Would two grandmasters play in partnership with one another against another pair, bearing in mind that the grandmasters can only communicate on slips of paper," then the answer becomes clearer. And yes, given that Deep Blue did beat a grandmaster, I think we can call him ("it?") one, for sake of argument.

      Although I do think it would be kinda cool to get Kasparov on here in the hot seat; not really to discuss his match with Deep Blue, but more see his take on the impact of powerful machines on society, from the point of view of someone has to compete for his livelyhood against them.

      --
      Cue The Sun...
    2. Re:/. interview by sailesh · · Score: 2, Informative

      Actually this is not new. This is called "Advanced Chess". There was an Advanced Chess tournament held a couple years back and all the Super GMs (> 2700 rating) competed. I believe that Vishy Anand won it. Basically however it left people kinda cold. Let me also be a karma whore: http://www.chessbase.com/events/events.asp?pid=133

    3. Re:/. interview by sailesh · · Score: 1

      Phoooey .. I'll never learn this HTML thang .. Advanced Chess

    4. Re:/. interview by YeeHaW_Jelte · · Score: 2, Interesting

      Yeah, that'd be great. I'd like to ask him if and what special tactics he uses when playing computers. I figure he studies his opponents previous games, regardless of whether his opponent is a man or a machine, but how would his preparations be different when preparing to play a computer?

      --

      ---
      "The chances of a demonic possession spreading are remote -- relax."
    5. Re:/. interview by Skwinx · · Score: 1

      "I think I can say with pretty good authority that he'd say no to [a match with human and machine against human and machine]."

      Not only did he not say "no" to it, he more or less invented it. Advanced chess matches have become semi-annual since Kasparov and Topalov first played in Leon in 1998 (a recap by the always-excellent ChessBase team).

  45. Two stupid things you said by Dr.+Spork · · Score: 1
    The slightly less stupid one is about the solvability of chess. Yes, chess is theoretically solvable. However, the number of arrangements you would have to calculate are far greater than the number of atoms in the universe. Good luck solving that! The solvability of chess plays no role in the design of current (and future) chess programs. None of them can just "brute force" look down every decision tree. They have to be "smart" about which lines they care about and which they ignore. Programming in this smartness is what chess software is all about. As Kasparov said, it makes much more of a difference than two orders magnitude in processing speed. If Junior isn't real AI then we have no AI.

    Now for the more stupid thing: Where did you hear that "white win has been proven?" I think you're full of shit. All the evidence I heard points to black always being able to force a draw. But what would a proof of either look like?

    And if you do a search for how many posts here have mentioned that go programs are easier to beat than chess programs, you will see why you must now be shot.

    1. Re:Two stupid things you said by kfg · · Score: 1

      Therefore it's impossible to play a game of chess.

      Think about it.

      Humans routinely solve problems with computational trees larger than the number of atoms in the universe. It's *easy* for humans. It's impossible for computers.

      Not to mention solving problems that aren't computable by *any* number of discrete steps.

      By the way, who told the computer to ignore certain lines? It didn't figure it out for itself.

      Think about that too.

      KFG

    2. Re:Two stupid things you said by kmellis · · Score: 1
      " Humans routinely solve problems with computational trees larger than the number of atoms in the universe. It's *easy* for humans. It's impossible for computers."
      Why? Maybe computers could manage to do so the same way that humans do. Or are you postulating some metaphysical means by which humans accomplish this feat?

      And, anyway, the post you're replying to already pointed out that modern chess algorithms don't rely on exhaustive searches. They apply judgment filters to cull the search tree. Is it cheating that the human programmers are then inserting human knowledge into the algorithm? No, because human chess players also learn from other humans how to recognize worthless lines of inquiry. They also learn on their own, something that chess algorithms are only beginning to do and quite rudimentarily at that--but there's no rigorous argument that this isn't possible for them, as well. Again, the only argument against this is that such learning is somehow magical and essentially metaphysical--and that's a stupid argument (at least from a scientific standpoint).

      You seem very caught up in the extremely suspicious notion that humans discarding (or not considering) worthless lines of inquiry, or recognizing (implied in your other example) the truth of the Godel Statement, are examples of some impossible-to-mechanistically-duplicate holistic comprehension. But that's a prejudice with no real evidence to support it.

  46. Kasparov wants it both ways by alispguru · · Score: 1
    Don't be taken in by Kasparov's noble words about "scientific" study of computer chess. There are two ways to think about a man vs. machine chess match:

    A scientific test. Everybody's preparations would be done openly. There would be joint post-game analysis with an emphasis on whose strategy worked better.

    A sporting test. Everybody's preparations would be done in secret, to hopefully surprise the opposition. Post-game analysis would be done seperately by both sides, with spin thrusters fully engaged.

    Kasparov does competitive chess for a living - he can't approach these games in a scientific quest-for-knowledge mode. Note that he gets paid competition rates for these games.

    What he clearly wants is for him to be able to treat the computer teams as full-out adversaries, but for them to cooperate with him and give away anything they discover about chess. That way, they can't become a threat to him or his sport.

    --

    To a Lisp hacker, XML is S-expressions in drag.
  47. mit slashdotted - again by Pharmboy · · Score: 0, Redundant

    quoted from the slashdotted http://www.mit.edu/~mkgray/head-explode.html

    How To Tell If Your Head's About To Blow Up
    From the WEEKLY WORLD NEWS, May 24, 1994

    MOSCOW -- Doctors are blaming a rare electrical imbalance in the brain for the bizarre death of a chess player whose head literally exploded in the middle of a championship game!

    No one else was hurt in the fatal explosion but four players and three officials at the Moscow Candidate Masters' Chess Championships were sprayed with blood and brain matter when Nikolai Titov's head suddenly blew apart. Experts say he suffered from a condition called Hyper-Cerebral Electrosis or HCE.

    "He was deep in concentration with his eyes focused on the board," says Titov's opponent, Vladimir Dobrynin. "All of a sudden his hands flew to his temples and he screamed in pain. Everyone looked up from their games, startled by the noise. Then, as if someone had put a bomb in his cranium, his head popped like a firecracker."

    Incredibly, Titiov's is not the first case in which a person's head has spontaneously exploded. Five people are known to have died of HCE in the last 25 years. The most recent death occurred just three years ago in 1991, when European psychic Barbara Nicole's skull burst. Miss Nicole's story was reported by newspapers worldwide, including WWN. "HCE is an extremely rare physical imbalance," said Dr. Anatoly Martinenko, famed neurologist and expert on the human brain who did the autopsy on the brilliant chess expert. "It is a condition in which the circuits of the brain become overloaded by the body's own electricity. The explosions happen during periods of intense mental activity when lots of current is surging through the brain. Victims are highly intelligent people with great powers of concentration. Both Miss Nicole and Mr. Titov were intense people who tended to keep those cerebral circuits overloaded. In a way it could be said they were literally too smart for their own good."

    Although Dr. Martinenko says there are probably many undiagnosed cases, he hastens to add that very few people will die from HCE. "Most people who have it will never know. At this point, medical science still doesn't know much about HCE. And since fatalities are so rare it will probably be years before research money becomes available."

    In the meantime, the doctor urges people to take it easy and not think too hard for long periods of time. "Take frequent relaxation breaks when you're doing things that take lots of mental focus," he recommends.

    Although HCE is very rare, it can kill. Dr. Martinenko says knowing you have the condition can greatly improve your odds of surviving it. A "yes" answer to any three of the following seven questions could mean that you have HCE:

    Does your head sometimes ache when you think too hard? (Head pain can indicate overloaded brain circuits.)

    Do you ever hear a faint ringing or humming sound in your ears? (It could be the sound of electricity in the skull cavity.)

    Do you sometimes find yourself unable to get a thought out of your head? (This is a possible sign of too much electrical activity in the cerebral cortex.)

    Do you spend more than five hours a day reading, balancing your checkbook, or other thoughtful activity? (A common symptom of HCE is a tendency to over-use the brain.)

    When you get angry or frustrated do you feel pressure in your temples? (Friends of people who died of HCE say the victims often complained of head pressure in times of strong emotion.)

    Do you ever overeat on ice cream, doughnuts and other sweets? (A craving for sugar is typical of people with too much electrical pressure in the cranium.)

    Do you tend to analyze yourself too much? (HCE sufferers are often introspective, "over-thinking" their lives.)

    --
    Tequila: It's not just for breakfast anymore!
  48. Go by kermit6306 · · Score: 1

    Why is it so much more difficult to design a system that crushes people in Go? Shouldn't that be considered a more interesting endeavour?

    1. Re:Go by Duds · · Score: 1

      Simply because Go is more complex.

      You'd never ever be able to evaluate as high a percentage of moves in Go as you do for Chess so you have to go at it heuristically even more so than with chess.

      And that's where it gets tricky.

      Plus Go is more of an obscure game. These things have to be funded and Chess is well known and PR friendly.

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

      As someone mentioned in a later post in a game like chess you need to be able to look ahead and to evaluate your current position. Both of these are harder in go than in chess. Looking ahead is harder because the board is much larger in go and evaluating a position is harder because there is less hierarchy and the threat is indirect through being surrounded rather than direct by being captured as in chess.

    3. Re:Go by Kintanon · · Score: 1

      It's also more difficult to establish a goal in Go. In chess your goal is clear, "Capture the King", in Go the goal is much more ephemeral, "Surround the most territory points securely". Also, there is no clear "end" to a Go game until both players agree to stop placing stones. I picked up one Go program that didn't ever have an End condition met. It would keep placing stones for ever. That meant it would fill in its own territory until there were no more legal moves, then I would place one stone and take all of the stones it had on the board, and it would start over filling the board in until it had no legal moves.
      GNUGo is much better at figuring out when the game is over and will Pass at the appropriate times. Sometimes it passes a bit early but it never continues to play stones long after it has become pointless.
      And with GNUGo running on a dual 2.4ghz Xeon it kicks my ass. I regularly lose by 30 moku in an even game. But I can usually beat it with a 3 stone handicap and sometimes with a 2 stone. And for those keeping track my rating is 7kyu. Which sucks, but doesn't suck uberhard.

      Kintanon

      --
      Check out JoshJitsu.info for Brazilian Ji
  49. I'm not sure I entirely agree by Trepidity · · Score: 2, Insightful

    I'm not convinced that a human is capable of solving the halting problem in the general case. In a case where the human can trace all possible execution paths, or deduce other things about the program's behavior, it's solvable, but a computer can solve the problem in these cases as well. In short, give me any particular program that a human can solve the halting problem for, and I'd bet you can codify the logic used so that a computer can do so just as well (and given enough samples, code a general computer program with the same power as the human in this domain).

    Basically, to prove your point, you'd need to show that humans have some processing power strictly greater than that of a Turing machine, which is a somewhat controversial thesis.

    1. Re:I'm not sure I entirely agree by Anonymous Coward · · Score: 0

      In short, give me any particular program that a human can solve the halting problem for, and I'd bet you can codify the logic used so that a computer can do so just as well

      The problem is not in tailoring a specific program to a specific piece of source code, but in the fact that given a candidate program for the general solution, you can always create a counterexample that breaks it.

  50. I suppose I should've been more clear by Trepidity · · Score: 1

    I'm aware that there are unsolvable games; more specifically I was questioning the existence of unsolvable-by-a-computer games that are nonetheless solvable by a human. That is, for any given game, the computer should be able to play as well as or better than a human player. For unsolvable games, this simply means emulating the heuristics a human player uses.

    1. Re:I suppose I should've been more clear by kfg · · Score: 1

      By definition any game solvable by a human is solvable by a computer programed by a human.

      That isn't an example of AI. That's an example of solving an equation. A very complex equation, perhaps, but in essence it's no different than than a computer adding 2 and 2 and getting four, and no more proof of intelligence.

      Here's something for you to try. Write a computer program for Tic Tac Toe that only knows the *rules* and *deduces* on its own the perfect strategy.

      Not so easy.

      Now do it again with the Towers of Hanoi.

      KFG

  51. a controversial claim by Trepidity · · Score: 1

    It's speculated (by some anyway) that much of human "intelligence," in this example the comparatively excellent middle-game play, is essentially an extremely advanced pattern recognition ability (Kasparov's famous quip that he only analyzes 2-3 moves/second, "but they're the best ones"). Certainly computers have nowhere near this good pattern recognition currently (they have trouble even consistently recognizing faces under different lighting conditions and angles, something humans do effortlessly). However, I see no reason why it is in principle impossible for computer pattern recognition to meet or exceed that of humans, and thus excel at tasks that require it.

  52. Really? They had to dismantle Deep Blue... by SuperKendall · · Score: 5, Funny

    ...because it kept insisting Fischer had a computer in his shoe while playing!! It wouldn't shut up, and they had to put it down... all very embarrassing for IBM. No wonder they kept it quiet.

    --
    "There is more worth loving than we have strength to love." - Brian Jay Stanley
  53. A change in direction for chess AI is needed by Anonymous Coward · · Score: 0

    I would really like to see the developers of chess playing programmers try Computer-Assisted chess. The really interesting aspect of computing (to me) is the human-computer interface. Computers are supposed to help us, make us more efficient and effective.

    Why not pit two teams of a human with computer against each other and see how the much more interesting the problem becomes. At this point its not just brute force vs. intelligence. Programs and their interfaces will have to be customized to the player.

  54. Deep Blue gets overclocked.. by Whitecloud · · Score: 1
    What makes this new era so exciting is that there are many programs using different techniques that produce distinct styles. Deep Junior is as different from Deep Fritz as Kasparov is from Karpov.

    Or as different as Deep Blue and a chess playing Wookie. "Let the wookie win!"

    --

    Do you need a website upgrade?

  55. art does imitate life it seems... by visgoth · · Score: 1

    So that's why the tachikoma in GITS:SAC episode 8 decides it's playing chess rather than go versus Togusa... cute :)

    --
    My patience is infinite, my time is not.
  56. So what? by dh003i · · Score: 2, Insightful

    So what, he's arrogant? He's also done a lot for the chess world. And, quite frankly, he's the best chess player since B. Fischer (yes, still better than that upstart Kramnick).

    The simple fact is, that when people talk about the best chess players ever, there are two candidates for #1: Bobby Fischer and Gary Kasparov. Since they've never played each-other, we don't know who's better than who, and it's a topic of unsubstantiated speculation.

    Regarding Bobby Fischer, I'm tired of hearing about his anti-semitism. Bobby Fischer is himself half-Jewish, and is friends with several Jewish people, despite his anti-semitic beliefs. Irrelevant of the man's political beliefs -- which he's entitled to, like the rest of us, think whatever the fuck he wants -- he's still one of the greatest chess players of all time.

  57. well, that's machine learning by Trepidity · · Score: 2, Insightful

    There are some pretty good machine learning techniques that can do things like that. Some start with more hints than others, and some work better than others. It's definitely a very open area of research.

    I'd also note that if computers can do this, however, it's imposing stronger requirements on them than on humans -- most humans learn a great deal of things from others rather than deducing them on their own from basic rules or first principles, which is in some ways akin to programming a computer with strategies.

    1. Re:well, that's machine learning by kfg · · Score: 1

      The question isn't whether they do, it's whether they *have* to.

      You *can* learn to play an excellent game of chess by being told nothing but the rules. And many have. A few have even learned the rules just by observation.

      The fact that many ( and I might argue most) people are idiotic robots would be beside the point if it weren't for the fact that even chimpanzees have shown greater problem solving abilities in certain areas than any computer has, or can be shown to be capable of.

      Look, I'm not arguing that AI isn't possible. I don't see any inate reason why people can't build some sort of machine that can "think."

      I'm simply stating that showing it can add two beads to two more beads and then hold them up for review ain't it. A Z80 isn't smarter than a human because it can recalculate a spreadsheet faster than a whole room full of accountants.

      The accountant knows what the spreadsheet *means* (whatever that means).

      Deductive and inductive reasoning are the key to intelligence and that has to be the proper goal of AI, and a computer that can't do it ain't smart.

      *A* human was asked to determine whether an object contained the specified weight in gold, and the result was the law of displacment.

      I've only asked for the Towers of Hanoi, which I was able to solve without hints. Is it really too much to ask a computer to demonstrate the same skill before I aknowledge it as my equal?

      Now how about a computer that *concieves* the Towers of Hanoi.

      KFG

  58. I will be impressed by tmortn · · Score: 1

    When a Computer can beat a GM without an exaustive move library. The problem with the move library and deep tree search is that in the event of strong matches and algorythmic solutions is the choice being made is the one either derived by the human player in the recorded match.. not by the chess program itself. In the event of mathmatical solutions such as the limited end game scenarios this is rearly any differant than a human/human game especailly between masters... though as computers get progressively more copmutational power they are able to mathmatically solve an end game with more and more pieces which is kind of like a computer being able to sort faster and more acurately.... not something indicative of intelligence.

    When the chess program can take nothing but its knowledge of the rules and its own experience and re-creates or improoves on the same decisions when presented with classic game states then Tourings challenge will be trully acomplished.

    To me the accopmlishments of Deep Blue and Deep Junior are somewhat akin to a computer being able to sort a list faster than a person. Its apples and oranges, a computer has yet to truly play a game of chess in my book. They have however very effectively indexed and to some extent abstracted massive game archive records to effectively choose from past sucesfull HUMAN decisions.

    Again its impressive.... but when they can create those decisions in ignorance of what has been done/tried before and can consistently make the same level of decision without haveing that database it will be truly unreal.

    --
    I don't ask you to be me. I only ask you not expect me to be you.
    1. Re:I will be impressed by nomadic · · Score: 1

      When a Computer can beat a GM without an exaustive move library.

      Why should they even try? It's not like Kasparov doesn't have an exhaustive move library stored in his head.

    2. Re:I will be impressed by tmortn · · Score: 1

      Let me define exhaustive as beyond human capacity. True enough that Kasparov has a library in his head but more importantly he has conceptual knowledge. He might be able to fully regurgitate dozens, possibly even hundreds of games move for move and I'll give him the benifit of the doubt and say he has perfect recall of all of that while he is playing a game, but Deep Blue and Deep Junior have game archives in the thousands and permuation archives possibly out into the millions that they can search for a match to a current board configuration in seconds not to mention an ability to compare multiple game states at several moves deep that a human can only dream of. Yet it still has no concept, it can't concieve new lines.

      Kasparov understands WHY you make a move which is very different from simply knowing what move(s) has been made before. I will be impressed when the computer can reason out a move as opposed to matching a stored response. Incidentally I have played a few people who try to play like a computer, they are tough only so long as you play to their knowledge. They tend to be very helpless if you can direct them into an unexplored line ( especially if you know what they have studied ) even if tactically its weaker.... the same weakness brute force computer algo's tend to have. Its realtively easy to get a person to an un-explored line as human memory is generaly limited in this respect, a solid copmuter algo with an Exhaustive library is far more difficult to de-rail.

      In short I'll be impressed when the program thinks for itself. Don't get me wrong... both Jr, and Blue are impressive machines and their match successes are a testement to the advancing field of Machine AI but right now its the Puncher beating the Boxer and that has its appeal... but the true Advent of AI will be when we see a boxer and a boxer squared off.

      --
      I don't ask you to be me. I only ask you not expect me to be you.
  59. What was really funny... by pinosho · · Score: 2, Funny

    ...is the write up that Deep Junior made on its observations of the match. It really tore Kasparov up, I think it was bitter, claiming a computer was feeding Kasparov answers. I heard Kasparov blew Deep Junior off at a chess match some time ago, preferring to go play with its old friend HAL instead...

  60. Turing test? A few thoughts. by ScorpiusFan · · Score: 1

    I think to make the chess program pass the Turing test it would have to be able to understand when it's feasible submit a draw, and how to evaluate a draw proposal. This would exhibit the human behavior associated with "taking chances" and evaluating risks.

    I think during the Kasparov/Deep Junior tournament that the Deep Junior program creators were evaluating the draw proposals.

    Other attributes to make the chess program seem like a human player would be to add simulated fatigue and rare miscalcuations.

    Also, did IBM state their chess program was all about accomplishing the Turing test, or were they just trying to make a program that could beat a top-level human player? Or were they trying for both objectives?

  61. Behind Deep Blue by agurkan · · Score: 1

    I think Kasparov should read this book. He is getting ridiculous about his conspiracy theories. World does not revolve around him. He is beaten, goal achieved, the programmers of Deep Blue have lives, too. And I am not surprised that they want to keep Kasparov out of it.

    --
    ato
    1. Re:Behind Deep Blue by ThresholdRPG · · Score: 1

      This is at least the THIRD time you have pimped this book.

      You are so biased it is getting really ridiculous.

      --

      -Michael
      Threshold RPG
  62. If you wish I'm perfectly willing to stipulate. . by kfg · · Score: 1

    I just pulled that out of my ass.

    It certainly makes no difference to any of my arguments.

    KFG

  63. Fischer Random Chess by Jayson · · Score: 4, Interesting

    So as computers slowly overtake the best players, will Fischer random chess draw more attention. In this randomc chess variation, the inital piece configuration is randomly determined (within certain parameters to make it still have some of the same strategic elements of chess) and the same for both players (much as the way it is will regular chess). Bobby Fischer developed it to get rid of the the opening advantage the is gained with massive studying and memorization. It basically eliminates the idea of an opening sequence since there are thousands of different initial boards. However, good opening principles still dominate (piece development, king protection, pawn structure, etc).

    I think it is a great idea. It also leaves a huge advantage for good master level players over machines, since an opening book is virtually eliminated.

    1. Re:Fischer Random Chess by jvarsoke · · Score: 1

      Actually, in Fischer Random the opening book would not be eliminated just expanded to a size where no human could keep it in his/her head. It wouldn't be all that bad for a computer, necesarily since storage of data isn't really a problem.

      Opening books, however, are created and tailored by GMs doing theory. AFAIK there is no computer algorythm to determine correct opening play from scratch. Thus, for a while the computer would be off kilter, but only until the humans had developed some opening theory for each of the setups.

      -j

    2. Re:Fischer Random Chess by mikeg22 · · Score: 1

      IM and GM players don't generally have much of a problem with opening lines. They have played so many matches and studied so much that they might as well have an opening database sitting right in front of them, it would make no difference.

    3. Re:Fischer Random Chess by mattdm · · Score: 1

      Bobby Fischer developed it to get rid of the the opening advantage the is gained with massive studying and memorization.

      This just pushes things back by a few years. In not-so-long, computers will be able to analyze all of the different possible beginning sequences too -- in other words, even more massive studying and memorization.

    4. Re:Fischer Random Chess by Sodium+Attack · · Score: 1

      It also leaves a huge advantage for good master level players over machines, since an opening book is virtually eliminated.

      Quite the opposite. Master level players and above rely quite heavily on their own "opening books," and may often play the first 15-20 moves of a game by rote. They are able to avoid the common opening traps, not so much because they work them out at the board, but because they've seen them before.

      A new position in Fischer Random chess brings about a whole new set of potential opening traps. The master-level player will still be able to see and avoid many of these, but probably not all of them (not some of the ones which are several moves deep), whereas the computer will be able to see new, complicated opening traps with ease.

      --

      Never take moderation advice from sigs, including this one.

  64. An attempt. by mcc · · Score: 1
    I have a copy of this adaptive, open-source, markov-chain-based conversational "Artificial Intelligence" bot, which I connected to AIM some time ago and have been running since.

    As a response to your challenge, I have just now asked it some basic questions about the world political situation, and some subjects which tend for one reason or another to accumulate conspiracy theories. I will leave you to judge the results.

    mcc: Why does George W. Bush want to invade Iraq?

    megahal: Jim morrison is hiding in the midst of a mass of energy.

    mcc: I see. And what is the connection between Jim Morrison and Iraq?

    megahal: Jim morrison is hiding in the larger society, relationships between women within the next two weeks.

    mcc: Could that be considered an act of terrorism?

    megahal: W00t w00t w00t?

    mcc: Please stay on subject.

    megahal: Jim morrison in in the end it doesn't work for you.

    mcc: Is Saddam Hussein hiding weapons of mass destruction?

    megahal: Don't pay attention to your car, ma'am?" "will that be considered an act of terrorism?

    mcc: What would you say is the role of the international oil trade insofar as the current situation in Iraq goes?

    megahal: By virtue of this subject.

    mcc: Do you think Osama Bin Laden is working with Saddam Hussein?

    megahal: Grand theft, genocide, racism, initiating the destruction of a mass of energy.

    mcc: Left alone with any weapons of mass destruction he may have, do you think that Saddam Hussein poses a threat to the outside world?

    megahal: Insofar as capitalism has created a world spun purely out of me and get bored eassily its veryt hard to find this here beach! Man's got a job interview in like 30:00 so if you distribute copies of the international war crimes tribunal at the hague that the term is not only a good bot.

    mcc: Why do France and Germany wish to wait before allowing military action in Iraq?

    megahal: I can tell you that you think jm should do with me and i vote.

    mcc: So enough on Iraq for the moment. In the late nineties, Bobby Fischer claimed that several thousand dollars of his memorabilia had been stolen by an International Jewish Conspiracy. What are your thoughts on this?

    megahal: He could not find a way to destruction.

    mcc: What are your thoughts on the Scientologists?

    megahal: One of the world jewish conspiracy?

    mcc: What happened to Rudolph Hess?

    megahal: Few of the tower of babel.

    mcc: What are your thoughts on Ayn Rand?

    megahal: And my mistake is that roles depend on the scientologists?

    mcc: What are your thoughts on the Roman Catholic Church?

    megahal: This has happened to rudolph hess?

    mcc: Who shot Malcom X?

    megahal: Feng and english are your thoughts on ayn rand?

    mcc: Thank you for your time.

    megahal: Wait..what..i am so confused.

  65. Let's post another one... Yaaaaay.... by Mulletproof · · Score: 1

    Just curious, but what is the big deal about posting these brute-force chess matches? AI, sure, cool. But given enough thrust, a rock will fly too, y'know...

    --
    You need a FREE iPod Nano
  66. So, what does he think of IBM? by slashbrent · · Score: 1

    I wish he could have better expressed his feelings toward IBM. One could be left with the feeling he is slightly ambivilent his experience with them...

    --

    Moderators need an additional choice: "Karma Whore" for people who cut-and-paste articles as their comments!
  67. Other games by Anonymous Coward · · Score: 1, Funny

    How good is Deep Blue/Junior at poker?

  68. opening books by Jayson · · Score: 1

    Computer opening books are based on human opening books. There would be so many possible lines, that there would effectively be no more use in memorizing individual opening lines. If there is no human opening open, then there is no computer opening book.

    Fischer random would spur research in learning opening lines automatically, but the further you get from the ending, the harder it is to tell the value of a position. Computers may have opening books, but they would probably be so shallow that they aren't worth the effort.

    It is almost guarenteed to reset the bar for computers, though.

  69. That is Fischer's point by Jayson · · Score: 1

    He sees it as a way to bring back creativity into the game and move away from the memorization. I hardly see it as a bad thing. It should be who can play the game best, not who can memorize the lines.

    And it does make a difference. IMs/GMs specialize for a couple of reasons, one of them being that it is impossible to memorize all opening lines.

  70. Re:Do Iraqis have internet access? by bfree · · Score: 1

    I presume that's why we have so many Anonymous Cowards in here!

    But more seriously, what % of Iraqi's have economic and physical access to these cafés? What monitoring takes place within Iraq to detect dissident net users? Do the cafe's offer cryptography and anonymous surfing?

    And seeing as though I am going to get moderated to hell anyway, here's a poll result (telephone poll as part of a much larger poll on irish politics) that made my week when I read it on Sunday in the Irish Independent (can't find it online unfortunately):

    Who do you fear most?
    Bush: 60%
    Saddam: 39%

    --

    Never underestimate the dark side of the Source

  71. Quicktime sucks by t0ny · · Score: 1

    Slashdot is just amazing. Nobody whines about having to use Apple's proprietary software which ruins Win32 machines, but they whine about using MS's stuff.

    --

    Manipulate the moderator system! Mod someone as "overrated" today.

  72. Deep Blue's creator would... by neibwe · · Score: 1
    Well, here's one option.
    Question from Frantic: According to what was published DB was evaluating 200 million positions per second (vs 2.5 to 5 million for the 8-way Simmons server running Deep Fritz). How fast would be Beep Blue today if the project continued?

    CrazyBird: if we redo the chip in say, 0.13 micron, and with a improved architecture, it should be possible to do one billion nodes/sec on a single chip.
    CrazyBird: so a trillion nodes/sec machine is actually possible today.
    CrazyBird: i was planning to shock kasparov should he [have] agree[d] to a new match:).[1]
    ...
    [0.09 micron gives you something like 40-fold increase in area density and 6-fold increase in speed, which means through technology alone, a single chip can be more powerful than the entire Deep Blue. Put that on a CompactFlash card and plug it into a PocketPC...]
    [2]

    _____________
    [1] CrazyBird is Feng-Hsiung Hsu, one of Deep Blue's two programmers.
    [2] Interview with Hsu. [http://www.chessclub.com/event/crazybird1.html]
    1. Re:Deep Blue's creator would... by neibwe · · Score: 1
      Whoops. I got the facts wrong on the "two progammers thing" because in the interview Hsu said in reply to a
      Question from mpjaya: - How many programmers worked on the project Deep Blue in total?
      CrazyBird: it was a three-person project, Murray, Joe and I.
      I brain farted, thinking that 'Joe' was Joel Benjamin (the chess consultant.) The "Deep Blue" team was actually bigger than 3 people. It's listed on IBM's Deep Blue site

      The cheese title "Deep Blue's creator would..." was from me typoing another post about why there wasn't an IBM rematch. (It was due to Kasparov's public accusations of the D.B. team and IBM.)
  73. no computer will beat kasparov any day soon by tevman · · Score: 1

    a computer won't be able to beat kasparov or anyother chess player any time soon, although i believe it could be done easily. If any company were (stupid enough) to _really_ sponsor a project that could beat a human, it would be sucide for said business. Who is going to be the evil comapny that builds a machine greater than man!!!!... i can just hear the mobs now...

    I think that we have had this balance for a while but _choose_ not to accept our fate(think cloning).

    --
    sig is broken try again tomorrow
  74. Kaspy overrated by Anonymous Coward · · Score: 0

    Not only would Fischer beat Kasparov, but so would Morphy, Steinitz, Alekhine and Capablanca (if resurrected and allowed to briefly brush up on modern insights).

  75. Humans are slower..... by oliverthered · · Score: 1

    This is incorrect, humans are faster over multi-dimensional and special problems where the sets are non-linear.
    Humans are good(fast) at abstract set reduction, which helps a lot in chess.

    --
    thank God the internet isn't a human right.
  76. Re:*unarmed civilians* by Anonymous Coward · · Score: 0

    He was refering to the terrorists, not the passengers.

  77. Controversial Thesis by Anonymous Coward · · Score: 0

    It would be more unnerving to Mankind to prove that humans don't have "processing power" greater than that of a Turing Machine.

  78. I code therefore I am by Anonymous Coward · · Score: 0

    I feel so relieved that I'm not just an algorithm.

  79. 12th International Computer Chess Championship by gilh · · Score: 1

    For those interested in Computer Chess, there is a tournament starting shortly: information here

  80. Re:so ... by ShooterNeo · · Score: 1

    Well, this is a common argument and there's a simple escape : yes, the computer isn't any better than those who programmed it...if the programmers had the ability to think for the thousands of years of subjective time required to play chess like Deep Blue. (That is, it would take thousands of years for a human to work out the problem like it does)

    Presumably a self improving AI would be subject to the same argument. Sure, it wouldn't be any smarter than the people who programmed it (and taught it)...if the people had a few spare million years and the ability to change the workings of their own minds. You can tell this argument to the kill-bot when it comes for you, I'm sure it'll be amused for the microsecond it takes to process it.

  81. Deep Fritz by Puu · · Score: 1

    Recently there was an interesting game between Kramnik (who beat Kasparov) and Deep Fritz, a multiproc derivative of the German Fritz 7 chess program (evaluated to be a better player than Deep Blue).

    In contrast to Kasparov vs. Deep Blue, Kramnik was allowed to study the program beforehand and was allowed days off in the tournament for resting. In turn, the Deep Fritz team was allowed to change the program's opening strategies during the tournament.

    The first half went to Kramnik 4-1 (3 victories, 2 draws), but then the DF team realised Kramnik had always exchanged queens early on to suit his favorite style (of playing strong positions with the strongest individual piece out), modified the program's opening strategy to be more careful with the queen, and the end result was a 4-4 tie.

    Google may come up with something if somebody is actually interested in chess. :-P

  82. This may have already been said but... by StressGuy · · Score: 1

    I watched the Kasparov Vs. Deep Blue match. I kinda had the impression that Kasparov was sort of a whiner when he lost but I also think that IBM owed him a rematch. I mean, Kasparov was playing that machine year after year and then, when Deep Blue finally won, IBM immediately dismantles the machine. It didn't make IBM look good in my eyes.

    I also got the impression that Kasprov didn't really prepare as much for that match. Perhaps he had taken victory as a given after years of win after win.

    Also, whiner though he may have been, he did make some legit points about access to the game logs, etc.

    --
    A goal is a dream with a deadline
  83. Re:so ... by blue+trane · · Score: 1

    Still, the brute force approach - where you examine every single possible path - will always do at least as well as, and probably often beat any "algorithmic" or heuristic search. (Given unlimited resources.)

    That's why we should be investing in ways to increase resources, instead of wasting time with clever little algorithmic solutions that ultimately will be less successful than the brute force approach...

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

    I don't understand the point.

    Humans get tired. Humans eventually make mistakes.

    Computers ALWAYS follow instructions flawlessly. If they make a "mistake" it's a logic error on the part of the programmer. The computer would make the same "mistake" in the first minute or in the tenth year.

    Making a big event out of a human playing chess against a machine is just sensationalism. If you REALLY wanted to test your "chess algorithm" you would give the human UNLIMITED time to plan their next move, and would keep cameras and media away.

    But I guess the point is the sensationalism, right? :)

  85. That's a retarded backpedal by Anonymous Coward · · Score: 0

    Seriously. You back out of humans vs. computers by saying the that they are the same thing. If this is your belief, then the answer is trivial.

  86. Re:3D Chess??? by Kintanon · · Score: 1

    I have that issue with Go, I'm a 7-9kyu player using Yahoo, or Cgoban or other programs, but with a real Goban in front of me I'm a 4-6 kyu player.
    Something about the visual texture of the Go game helps me "feel" the way the game is progressing.

    Kintanon

    --
    Check out JoshJitsu.info for Brazilian Ji
  87. the middle game proves by Jayson · · Score: 1

    (1) The frrther the computer is from the end of the game, the poorer its evaluation.

    (2) The more close a position is, the poorer its evaluation.

    Whatever loss in opening book a master may have, it is far swamped by what the computer loses. It effectively pushes the computers worst phase of the game up through the opening.