Slashdot Mirror


Chess: Man vs. Machine Debate Continues

Frederic Friedel sent in an interesting submission. It's an interview with the current world's chess champion, Vladimir Kramnik, in which they talk about the upcoming year in chess competitions, but also get into [Deep Blue] and where computer chess playing is versus several years ago, with a comparison between Deep Blue and Fritz. If you want more info, check out Chessbase for additional news.

295 comments

  1. brain by Jacer · · Score: 1, Informative

    if the human brain could be used to it's full potential, it'd be not contest i wonder if a divine being decided we should underclock....without any arctic silver between cells, maybe our heads would blow up

    --
    --fetch daddy's blue fright wig, i must be handsome when i release my rage
    1. Re:brain by Anonymous Coward · · Score: 0

      You are a fucking moron. Maybe you should have stayed in school and learned about grammar and the human brain, since you clearly know nothing about either.

    2. Re:brain by HanzoSan · · Score: 1

      If you focus too much of your brain on something, people will say you have ADHD.

      Schools want a well rounded brain with little bits of your attention everywhere, and they program you for this by giving junk courses which you dont really need.

      Computers dont work this way, when a computer is computing something, it doesnt focus on anything else.

      Humans are capable of doing this, you do this when you sleep, if you do it when you are awake its called day dreaming, kids do it all the time and get put on pills like ritalin to make them stop..

      --
      If you use Linux, please help development of Autopac
    3. Re:brain by Jacer · · Score: 1

      i think slashdot isn't so much a place for a formal debate as it is for casual conversation, and as such, shouldn't be subjected to pissants such as yourself who take the time to bitch and moan about someone's mistakes, which were made because i didn't feel the need to take the time to proof it. go bitch about something that matters

      --
      --fetch daddy's blue fright wig, i must be handsome when i release my rage
    4. Re:brain by dracken · · Score: 1

      The divine did being make an AMD, stick it in our heads and did ordain that it should be underclocked and cooled. esp while playing chess. Overclock it at your own risk!

      [Dracken thinking deeply.....] But why cant human beings win against a computer in chess ? KAAAAAABOOOOMMMMM.........

    5. Re:brain by NonSequor · · Score: 2

      I would like to know which courses you think are "junk courses which you dont really need."

      --
      My only political goal is to see to it that no political party achieves its goals.
    6. Re:brain by Anonymous Coward · · Score: 0

      If we can create a machine that can beat a human at chess using only part of our brains capacity, think about the machime we could create using ALL of our brain's capacity. It would still win.

      On the other hand, I suspect that's only because people get tired, and make mistakes.

    7. Re:brain by Anonymous Coward · · Score: 0

      not the original poster but here's what I consider to be time wasters in school: swedish, english, math, biology, religion, computer related subjects, history. I knew them all before even taking the classes..Sometimes I wonder how stupid one must be to actually learn something in school. I bet it's alot :)

    8. Re:brain by martyn+s · · Score: 1

      I think you really answered your own question there. Yes you're very smart. That doesn't make those subjects time wasters for anyone but those who are as smart as you. And most people aren't. So I guess your parents should've sent you to a school for gifted children.

    9. Re:brain by Anonymous Coward · · Score: 0

      Seconded. Why didn't you get sent toa school for the gifted? Perhaps the teachers were too stupid to spot your gift?

  2. Chess Champion by saveth · · Score: 2, Funny

    When do I get my turn at being the world's best chess player? :(

    1. Re:Chess Champion by Anonymous Coward · · Score: 0

      As soon as you can answer this question:
      What's 7 + purple?

      Neatness and originality in your answers count.

    2. Re:Chess Champion by HanzoSan · · Score: 2

      According to bobby fischer all the games are pre arranged anyway, so change your name to something that ends in "rov" and begins with K, and wait in line.

      --
      If you use Linux, please help development of Autopac
    3. Re:Chess Champion by saveth · · Score: 1

      ^ saveth@hydrogen:~/tmp$ cat purple.cpp
      #include

      void main()
      {
      cout 7 + 'p' + 'u' + 'r' + 'p' + 'l' + 'e' endl;
      }
      ^ saveth@hydrogen:~/tmp$ ./purple
      671

    4. Re:Chess Champion by knulleke · · Score: 0

      This will never be accepted by a c++ compiler.

      What did you mean to include? I guess iostream.

      --
      no sig error.
  3. New Turing Tests by KFury · · Score: 5, Interesting

    Forget conversational ability. I'd like to see a Chess Turing Test, where grandmasters go up against an unknown opponent, and have to ascertain whether they're playing a computer or a machine.

    1. Re:New Turing Tests by KFury · · Score: 2

      Err, a computer or a human, that is... I didn't mean to disparage grandmasters...

    2. Re:New Turing Tests by Anonymous Coward · · Score: 0

      Forget conversational ability. I'd like to see a Chess Turing Test, where grandmasters go up against an unknown opponent, and have to ascertain whether they're playing a computer or a machine.

      *Ahhem!*...... Why?

      I can top that: Let's do that with Tic-Tac-Toe!!

    3. Re:New Turing Tests by Kwikymart · · Score: 1

      Nah, rock-paper-scissors would be far better than stinky old tic-tac-toe. Or what might be better is "Think of a number between 1 and 10"... now thats what I would call a Turing test

      --

      Buying a Dell computer is equivalent to dropping the soap in a prison shower.
    4. Re:New Turing Tests by Anonymous Coward · · Score: 0

      Off topic, but I think a better turing test is one where the computer has to convince us that it is intelligent, when we know its a computer. That way no one can say they were tricked in to thinking the computer was inteligent.
      -James

    5. Re:New Turing Tests by metalogic · · Score: 2, Insightful

      This doesn't make much sense.



      It's long been observed in AI circle that things that are seemingly difficult for human actually are quite easy for computer, and vice versa. E.g., it is relatively easy to write program to solve sophisticated equations, playing chess, etc, which usually are considered hard, and require long period of training for human to carry out adequately. Things that are easy for human, such as recognizing faces and doing common sense reasoning, are what present the most problem for AI researchers.



      Turing test allows opportunity to test for the latter, greater challenge; your suggested test doesn't.


    6. Re:New Turing Tests by marcelk · · Score: 4, Interesting

      > Forget conversational ability. I'd like to see a Chess Turing Test, where grandmasters go up against an unknown opponent, and have to ascertain whether they're playing a computer or a machine.

      Actually, the computers have already demonstrated greater skill in judging chess Turing tests: they are better than grandmaster at deciding if an unknown player is human or not.

    7. Re:New Turing Tests by 56ker · · Score: 2

      Well it'd be pretty easy to see whether it's a computer or a person (I assume you didn't mean machine). Just knock your king over on your first move. A person woud see it and say "ha you resigned!" - a computer would just say "illegal move - try again"

    8. Re:New Turing Tests by Lars+T. · · Score: 2

      But to prevent the unfair treatment of intelligent computers by prjudiced testers (who could simply vote "not intelligent" on all tests), there would have to be a small chance that the tested is actually humn - and if you can't tell ...

      --

      Lars T.

      To the guy who modded me down from perfect to terrible Karma - Apple haters still suck

    9. Re:New Turing Tests by Anonymous Coward · · Score: 0

      Oops, that might turn out to be a Gnirut Test, where the Human has to prove that he/she *is* indistinguishable from a computer !

    10. Re:New Turing Tests by screwballicus · · Score: 2
      This story has wildly variant versions and no one seems to agree on it, but it seems to be the case that Napoleon pursued this strategy when he faced the Turk (of Slashdot, and otherwise, fame):

      The version propounded by jrandi.org goes

      Maelzel held a special command demonstration of the Automaton for Napoleon in 1806 in Berlin -- a city which Napoleon was occupying for the moment. The general tried to upset the machine by performing illegal moves -- for which the protocol laws well-prepared, since the understanding was that the figure would nod three times if such a thing were to happen, and when Napoleon persisted in making the wrong moves again and again, the Automaton finally swept all the pieces to the floor, and the game was over. Later, when the general was behaving himself and obeying the rules, he lost his game -- and was reportedly not happy.

      Another version, provided by the Sunday Times goes

      Napoleon placed a magnet on the chess board before the second game because he had heard that the Turk relied on magnets for its operation. But Maelzel removed it, and the Turk won. Before the third match, Napoleon wrapped a shawl around the Turk's head and torso, thinking there might be an operator hidden inside. But the Turk won a third time, at which point Napoleon swept the chess pieces to the floor and walked out.

      This page cites "Chess: Man Versus Machine, a book by Bradley Ewart" as providing the following version:

      "The automaton responded by politely bowing his (mechanical) head, replacing the piece, and signalling Napoleon to continue. The game continued, but soon Napoleon made another illegal move. the Turk removed the troublesome piece and, without allowing Napoleon another chance, made a move of his own. Napoleon made a third incorrect move just to see what would happen next."

      Perhaps the new book out on the subject provides an authoritative version of this story. Maybe there is no authoritative version. At any rate, it looks like Napoleon was presented with the same problem of playing out a Turing Test, whatever the real story is.

      It's really sad to see people (and media) presenting as demonstrably accurate history what is not at all certain.

    11. Re:New Turing Tests by Sri+Lumpa · · Score: 1
      Oops, that might turn out to be a Gnirut Test, where the Human has to prove that he/she *is* indistinguishable from a computer !



      That might turn out to be a Gnirut test seems to give you a problem, do you want to talk about it?

      --
      "The obvious mathematical breakthrough would be development of an easy way to factor large prime numbers." Bill Gates,
    12. Re:New Turing Tests by aozilla · · Score: 2

      Oops, that might turn out to be a Gnirut Test, where the Human has to prove that he/she *is* indistinguishable from a computer !

      I'd like to see a computer figure out how you came up with the term Gnirut test, then I'd be impressed.

      --
      ok then your [sic] infringing on my copyright! Could you as [sic] me next time before STEALING my comments for your own?
    13. Re:New Turing Tests by Drassk · · Score: 1

      Forget conversational ability. I'd like to see a Chess Turing Test, where grandmasters go up against an unknown opponent, and have to ascertain whether they're playing a computer or a machine.

      It would be even more impressive if they could tell the difference between a computer and a human

    14. Re:New Turing Tests by Ninja+Programmer · · Score: 1

      Oh that's easy, just drag it into an open spanish, or king's gambit. If it rips you to shreds in 10 moves, then its definately a computer.

    15. Re:New Turing Tests by KFury · · Score: 2

      Your post doesn't make sense to me.

      Language skills and chess skills are both things humans do well, and computers don't (because both are intractable problems, and humans are better at finding and using patterns.

      Therefore I fail to see why a test requiring a human to differentiate between human and computer conversationalists is different than a human differentiating between human and computer chess players.

      Explicate, please?

    16. Re:New Turing Tests by preternatural · · Score: 1

      Can you give references? I'd like to know more about this.

    17. Re:New Turing Tests by The+Wooden+Badger · · Score: 1

      How about a march madness style tournament of various computers and grandmasters in a 64 person/computer tourney? Just think of the TV contract!

      --
      Heroscape, it's like legos combined with anachronistic wargames.
    18. Re:New Turing Tests by ComaVN · · Score: 1

      My name is Dr. Sbaitso.
      I am here to help you.
      Please move your pawn to E4.

      --
      Be wary of any facts that confirm your opinion.
    19. Re:New Turing Tests by jo42 · · Score: 1
      > Think of a number between 1 and 10"

      42

      Did I pass?

    20. Re:New Turing Tests by Anonymous Coward · · Score: 0

      42

  4. Speak & Spell by wo1verin3 · · Score: 3, Funny

    My Speak & Spell (you remember ET?) plays better chess then any of those guys

  5. Oh, Hemos... by Anonymous Coward · · Score: 4, Funny

    I'm not usually one to point out Hemos' mistakes, but this one cracks me up.

    It's an interview with the current world's chess champion

    The "world's current chess champion" would make sense. The "current world's chess champion" implies that our stay on Earth is temporary, but once we get to, say, Alpha Centauri, we can finally have a new chess champion.

    1. Re:Oh, Hemos... by Skuto · · Score: 1

      Depends. If his title is 'world chess champion', then it is correct, isn't it? Considering there are several world champions in chess (each one claiming he's the real one), it makes sense to make the distinction.

      --
      GCP

    2. Re:Oh, Hemos... by Qrlx · · Score: 1

      I think the best solution would be to omit the apostrophe altoghether and write

      current world chess champion.

      There is no need to use the apostrophe in the original sentence. Though I do like the idea of their being a chess champion of, say, Mars.

  6. computers and Grand Masters by 56ker · · Score: 3, Interesting

    If you remember - for a long time no professional chess player would play a computer. I'm curious as to what the reasoning was behind this. Maybe they thought it's best to concentrate on learning how people play the game and not how a computer plays.

    1. Re:computers and Grand Masters by Wells2k · · Score: 2

      If you remember - for a long time no professional chess player would play a computer. I'm curious as to what the reasoning was behind this. Maybe they thought it's best to concentrate on learning how people play the game and not how a computer plays.

      Just throwing out an idea here, but perhaps chess masters rely not only on their minds to play a good game, but also on the body language and expressions that their opponent displays. With a computer, this kind of data transmission is removed, and all the chess master has to rely on is his/her own intellect.

    2. Re:computers and Grand Masters by Misha · · Score: 2

      the reasoning was that while studying a game with a really strong opponent, they would be able to fix and tune up their program. it is difficult to analyze a computer's game from the grandmaster's point of view unless a grandmaster is involved somehow. also, top players usually give a post-mortem after the game, explaining what happened.

      naturally, the reasoning behind the grandmasters' actions was to limit the future advances of computers. a strategic move, i suppose, but enough programs still have gotten really good.

      --



      I was thinking of how to intentionally fail my drug test... It would make a good memoir story someday.
    3. Re:computers and Grand Masters by Skuto · · Score: 1

      >If you remember - for a long time no professional chess player would play a computer.

      This is just false...there have always been human-computer matches.

      The lack of matches with world champions can be simply explained by the fact that those world champions charge much more for such a match than most chessprogrammers can afford.

      --
      GCP

    4. Re:computers and Grand Masters by 56ker · · Score: 2

      Sorry if I confused you - by professional chess player I meant someone who plays chess for a living and is a grand master.

    5. Re:computers and Grand Masters by SkulkCU · · Score: 2


      The worlds chanmpions have been playing machines ever since The Turk. (about 1770)

      Of course, it turns out that one of the operators of the Turk was widely regarded as one of the best two players in Paris, so the match results are hardly stunning. Despite the indignation of so many about a 'machine' playing chess, many world-class players and world leaders did play The Turk, and lost quite decisively.

      --
      .sig last updated Jan. 14, 2000
    6. Re:computers and Grand Masters by 56ker · · Score: 2

      You can't class the Turk as a machine when it was a person!

    7. Re:computers and Grand Masters by JordanH · · Score: 2
      I don't know when this was you were talking about when "no professional chess player would play a machine". I recall Grandmaster vs. Machine matches going way back. Typically, the Grandmasters routed the machines until the last ten or fifteen years.

      Just off the top of my head, Bobby Fisher played some computers in the 60s and 70s. These were always absurdly lopsided matches with Fisher wining easily.

      There was David Levy, who was a professional chess player in that he was an author and an International Master, had continuing wagers that he could defeat any computer in a match. Deep Thought finally defeated him in 1989.

      Until 1989 or 1990, there was hardly any point in Grandmaster vs. computers as the computers weren't up to it. Then, after Deep Thought came along, there was hardly any point in getting beaten by a machine. Didn't prove anything.

    8. Re:computers and Grand Masters by SkulkCU · · Score: 2


      You can't class the Turk as a machine when it was a person!
      But many people beleived it was.

      At a time when the first flying machines were being created, and machanical men playing music were being created, some people were ready to accept The Turk as a machine. Besides, the very _notion_ of an intelligent machine, was a great insipiration to many people. Charles Babbage (for example) visited, played, and lost to The Turk (even after having been given pawn and move). Babbage, of course, was certain it was a person controlling it, but he never could explain how (to my knowledge). He aquired first-edition printings of articles, letters, and other writings on The Turk, and this all clearly influenced how Babbage thought of intelligent machines. His later machinery often sparked the exact same arguments about intelligence in machines...

      So, yes, it was a person, but it was presented as a machine. The early purpose of The Turk was not as pecuniary in nature, and Kempelen (the creator) viewed it as an opportunity to advance his other machines (specifically, speech-synthesis machines).

      --
      .sig last updated Jan. 14, 2000
    9. Re:computers and Grand Masters by NeoMorphy · · Score: 1

      I know that in regular tournaments that have a chess computer competing, you have the option to play only against human opponents, and Masters usually take this option. But there have been plenty of matches between Man and Machine.
      As to why, probably because it's a different style of play. In post-mortem analysis there are usually a couple of mistakes found, but while another human might miss these otb, the chess computer always finds them.
      It's like bull fighting, the bull(cpu) usually loses but if the human makes one mistake...

    10. Re:computers and Grand Masters by haystor · · Score: 1

      Masters can prepare to play against other Masters. They can actually look up the other person's games and study them. You can't do the same thing with a computer. Also, with a computer you are going to be in for a mistake free evening and a grueling several hours even if you know you can grind out a win.

      --
      t
  7. Kramnik's Nightmare... by smartipants · · Score: 1

    Blue Gene. For protein folding eh... yeah right ;>

    Websurfing done right! StumbleUpon

  8. Programming is not creative? by hij · · Score: 5, Interesting
    There is an impicit assumption that the person playing the computer is only playing against the computer. This is the creativity of humans vs the brute force of computers argument. I would argue that the person is up against the programmers skills as well as the hardware.

    There is an enormous amount of creativity and human effort in creating Deep Blue or Fritz. Deep blue's win was not a machine beating a man. It was a team of programmers who were able to figure out how to get a piece of hardware to beat man at his own game!

    --
    Believe nothing -- Buddha
    1. Re:Programming is not creative? by adam613 · · Score: 2, Insightful

      Not necessarily. It is possible to write a program which knows only the rules of the game, and teaches itself how to play. This requires the programmer to be talented at writing machine learning code, but not necessarily talented at the game of chess.

      An interesting page on the topic

    2. Re:Programming is not creative? by haystor · · Score: 1

      Computers programmed to play chess beat humans.

      Computers programmed to learn chess beat compters programmed to play chess.

      Computers programmed to program computers to play chess...

      --
      t
    3. Re:Programming is not creative? by tshak · · Score: 2

      It is possible to write a program which knows only the rules of the game, and teaches itself how to play. This requires the programmer to be talented at writing machine learning code, but not necessarily talented at the game of chess.


      This is an insightful and interesting point, however, it does not pertain to the "chess computers" at hand. Although these machines may "learn" chess styles as they go, they are programmed with huge opening and closing databases, human created strategies, and have the power to brute force.

      --

      There is no longer anything that can be done with computers that is nontrivial and clearly legal. -- Paul Phillips
    4. Re:Programming is not creative? by sphealey · · Score: 2
      Not necessarily. It is possible to write a program which knows only the rules of the game, and teaches itself how to play. This requires the programmer to be talented at writing machine learning code, but not necessarily talented at the game of chess.
      I don't think so. Not realistically, anyway. All chess programs that I know of start with an opening book, which catalogues the best known responses for the most common x games (x being 5000, 10000, whatever human and machine memory can handle). These openings were in large part developed with thought and analysis, not just brute force trial-and-error.

      If you just set a chess program loose without an opening book, I think it would be millions of years before it replicated those openings. That doesn't pass the Turing test or even my definition of "playing chess". IMHO anyway.

      sPh

    5. Re:Programming is not creative? by Lars+T. · · Score: 2
      But human chess players also learn openings and endings and typical situations and startegies created by others. Most of the better players don't have to "think" what would happen next, they simply know. However, they still have to decide on a move leading to a situation they think they can handle better than their oponent.

      Last but not least, in major turnaments the games usually last two days, and in the night between the players ask their staff for strategic aid.

      --

      Lars T.

      To the guy who modded me down from perfect to terrible Karma - Apple haters still suck

    6. Re:Programming is not creative? by Libor+Vanek · · Score: 1

      Not necessarily. It's thenafter about talent of programmers to write better "self-learning" code ;-)

    7. Re:Programming is not creative? by SkulkCU · · Score: 2


      the person is up against the programmers skills as well as the hardware

      Kasparov made this very argument himself, after being beaten. In 1999, he said "IBM had a duty, and still has a moral obligation to give the chess world access to the printouts." [code]

      Also, in the New York Reiview of Books, John Searle noted that in no way could Deep Blue be considered intelligent: it relies on an illusion. It appears to be a thinking machine, but really, there is a team of engineers inside. In addition, Kasparov said that in the case of Deep Blue, "quantity had become quality". Basically, they used Brute Force. While this is still an accomplishment of note, it's clearly not really a question of machine intelligence. Even IBM engineers have admitted this. Deep Blue is custom-made hardware very adept at solving problems in the very narrow domain of chess.

      --
      .sig last updated Jan. 14, 2000
    8. Re:Programming is not creative? by jackb_guppy · · Score: 1

      "BLUE" was reprogrammed DURING the games. Humans were adjusting the program based on how the match was going.

      "BLUE" was not MAN vs MACHINE, but MAN vs A PUPPET.

    9. Re:Programming is not creative? by Skuto · · Score: 1

      >"BLUE" was reprogrammed DURING the games. Humans
      >were adjusting the program based on how the
      >match was going.
      >"BLUE" was not MAN vs MACHINE, but MAN vs A
      >PUPPET.

      I wonder why it's so essential for the thing to have been 'reprogrammed' (in reality most likely simple adjustments to the evaluation weights) to have been a 'puppet'.

      It was man-made, with algorithms and strategies that were taught to it by humans. And it was a computer. Me flipping a switch in the options of my chessprogram doesn't suddenly make the program more human.

      --
      GCP

    10. Re:Programming is not creative? by Skuto · · Score: 1

      >This requires the programmer to be talented at
      >writing machine learning code, but not
      >necessarily talented at the game of chess.

      The same is true for programs like Fritz. I suck at chess (rated 1300), but my program will beat GrandMasters. The computers do not mimic the human way of playing chess - they're completely different. For making them play better, 'human' ideas fail often.

      --
      GCP

    11. Re:Programming is not creative? by ChadN · · Score: 1

      If there had been logic to self adjust (and probably there was), and the computer was allowed to do so during and between matches, I think that would have been fair. But allowing human intervention during a match simply smacks of unfair tactics.

      To me, when you look deeper into the Deep Blue matches vs. Kasparov, it becomes almost purely a PR event, and much less significant an achievement in the field of A.I. (or human endeaver in general).

      --
      "It's overkill, of course. But you can never have too much overkill." - Anonymous Slashdot Coward
    12. Re:Programming is not creative? by An+Onerous+Coward · · Score: 1

      "There's a team of engineers inside?" The engineers weren't telling Deep Blue which moves to make. Sure, it was playing according to algorithms designed and perfected by another entity. But for the most part, so was Kasparov.

      Admittedly, chess is a relatively narrow domain, but that doesn't mean that it doesn't require intelligence in order to navigate it.

      One of the tactics of the anti-AI side is to simply redefine any problem that a computer manages to solve as "not requiring intelligence." Facial and voice recognition required intelligence until suddenly computers were able to do it. Then they became "narrow domains".

      My theory is that, if you took one of these chess-playing mainframes, slapped on some facial and voice recognition, and threw in some scripting on the level you find in many video games, you'd have a computer at least as socially adept as the most eccentric grandmaster. I mean no disrespect to them, but the brain is well designed as a general purpose machine. Focusing it exclusively on a narrow problem domain like chess causes it to suffer in other domains.

      --

      You want the truthiness? You can't handle the truthiness!

    13. Re:Programming is not creative? by An+Onerous+Coward · · Score: 1

      However, if you set a small group of humans who had never played chess before to the same task, without being able to study the strategies evolved by others, it would be a long time before they came up with these openings either. Computers and humans both use knowledge gained by players throughout history to bootstrap themselves into becoming better chess players than they could be on their own.

      Also, your assertion of "millions of years" is grossly hyperbolic, if not downright dishonest. Learning machines start out using brute force, but quickly stumble upon certain interesting features of the problem space that lead to success. As the rules get more elaborate, the problem space diminishes, and I think it's very likely that it would eventually converge on a handful of optimum opening strategies very similar to the ones popular today.

      Deciding on moves based on a mixture of well-understood strategies, general rules, and deeply considering the most likely scenarios? Sounds like a great definition of "playing chess" to me.

      --

      You want the truthiness? You can't handle the truthiness!

    14. Re:Programming is not creative? by Sodium+Attack · · Score: 2
      Last but not least, in major turnaments the games usually last two days, and in the night between the players ask their staff for strategic aid.

      This was true fifty or a hundred years ago, but virtually never occurs today.

      --

      Never take moderation advice from sigs, including this one.

    15. Re:Programming is not creative? by bereolos · · Score: 1

      Last but not least, in major turnaments the games usually last two days, and in the night between the players ask their staff for strategic aid.

      This has not been the case for the past several (I think at least 5, but I can't name the exact date) years. Around the time computers started playing at a strong level, adjournments were eliminated from human tournaments and matches.

  9. Limits of computers? by adam613 · · Score: 5, Interesting

    It's interesting that computers haven't been trained to always win or tie at chess.

    Chess is a game of perfect information. Each player knows every detail of the game state at any moment. Therefore, there has to be formula of some sort that can be applied to guarantee one player victory. Reasoning as follows:

    Say I construct a lookup table for every possible combination of moves. Then I eliminate every move which doesn't lead to my victory. I am left with a lookup table which contains the proper response to every move my opponent makes.

    There are two possibilities: I win the game, or my opponent wins the game. However, in order for my opponent to win, he/she would have to come up with a sequence of moves which is not in my lookup table. Since my lookup table is exhaustive, this is impossible.

    Given an infinite amount of processing power and memory, could someone "solve" the game of chess?

    If so, could someone use techniques such as genetic programming or neural networks to learn the lookup table in a finite amount of time/space?

    1. Re:Limits of computers? by Skuto · · Score: 2, Informative

      >Given an infinite amount of processing power and
      memory, could someone "solve" the game of chess?

      Yes. You can even argue it's solvable by an O(1) algorithm, similar to what you describe.

      >If so, could someone use techniques such as
      genetic programming or neural networks to learn the lookup table in a finite amount of time/space?

      There's only a limited number of positions. You can enumerate them and then 'solve' the game in the same way we generate endgame tablebases. But we lack storage and processing power for many many many years to come.

      --
      GCP

    2. Re:Limits of computers? by Anonymous Coward · · Score: 0

      Perhaps you should try estimating the number
      of possible states. 'Tis quite large.

    3. Re:Limits of computers? by Anonymous Coward · · Score: 0

      > Given an infinite amount of processing power and memory, could someone "solve" the game of chess?

      Yes. In fact, you would only need a finite amount of time since there's only a finite amount of legal games due to rules about draws. Computers have an opening "book" which are precomputed series of moves. Those would just be extended further and further out as they were computed until they covered all games of interest.

      This makes your other question moot but I'll point out that genetic algorithms and neural nets can't solve an infinite problem faster than any other solution. They make finite approximations. If they can exactly solve a problem, then other techniques can too. They're buzzwords not magic.

    4. Re:Limits of computers? by Beatlebum · · Score: 1, Informative

      Jesus Christ. Go read about alpha-beta pruning you moron. You piss in the wind and dress it up as if you've come up with some kind of fantastic insight. Of course the game is "solvable" and of course we have to trim the search space.

      The is what /. is all about. Eejits who proclaim they don't need a CS degree to program, who then enlighten us on subjects any CS course would cover in the first year. Worse still, the other eejits are actually impressed and mod-up these priceless pearls of wisdom.

    5. Re:Limits of computers? by sh4de · · Score: 5, Interesting

      In chess, we're not ultimately hampered by storage or processing power, but the size of the universe itself. I remember reading that in chess, there are more valid positions than there are atoms in the known universe! This calculation even took account the fact that some positions aren't necessarily reached by any sequence of legal moves.

      In either case, the storage requirements are so astoundingly huge that chess cannot be "solved" in that sense. Instead, the position at hand has to be evaluated from scratch each time, applying an "n-ply" tree lookup to determine the best move, leading to the best outcome.

      Now, the best outcome is a moving target itself. Chess programs tend to emphasize advantage in raw materials, which is often directly transferable to a victory, if both players know what they're doing.

      A human player, on a grandmaster level, may sport an ability to play in a "creative" way, wherein the computer is confused by a series of "non-op" moves that will pay off in 20 moves or so. A well known positional genius, Bobby Fischer, has played games that are intriguing to watch and analyze. A computer wouldn't rank some of his moves very high, but they all carry a meaning in the long run.

    6. Re:Limits of computers? by sphealey · · Score: 5, Informative
      There's only a limited number of positions. You can enumerate them and then 'solve' the game in the same way we generate endgame tablebases. But we lack storage and processing power for many many many years to come.
      The number of possible chess games isn't known excatly, but since even the lower estimates approach the number of atoms in the known universe we will be waiting a long time for enough processing power and memory to enumerate every possible game!

      sPh

    7. Re:Limits of computers? by Yurian · · Score: 2, Insightful
      Given an infinite amount of processing power and memory, could someone "solve" the game of chess?

      Certainly, given an infinite amount of processing power and storage space. But then, you can't just ring up Dell and say "Hi, I want an infitite amount of processors by next Tuesday"...And even if you could, it might not do you all that much good - You see, if you do a few calculations it turns out that there are more possible chess positions than there are atoms in the universe. Which might prove problematic when you are trying to store them.

      Of course there are ways go about "solving" chess that don't require you to enumerate every possible board, but they are still way beyond the reach of classical computing, probably forever. Quantum computing might be a different story, but we'll just have to wait and see how that one pans out..

    8. Re:Limits of computers? by haystor · · Score: 1

      Hehehe. Well said. I'm in agreement, even though I'm what I'd call a "business programmer". I know there is a difference in skills that I have to make up for with a willingness to delve into tax code.

      --
      t
    9. Re:Limits of computers? by Rock+'N'+Troll · · Score: 0, Insightful

      Say I construct a lookup table for every possible combination of moves. Then I eliminate every move which doesn't lead to my victory. I am left with a lookup table which contains the proper response to every move my opponent makes.

      Horribly stupid idea. On average, there are 35 (?) legal moves from any position. Let's say we restrict a game to 100 moves, and we'll need a lookup table of 2.5*10^154 positions, which is obviously way more than than we could store if we used the entire universe for memory. Not to mention the time it would take to search all these positions.

    10. Re:Limits of computers? by Cuthalion · · Score: 1

      Chess is a game of perfect information

      Good thing too. Otherwise FICS would be ruined by losers using hacked clients to eliminate fog of war.

      --
      Trees can't go dancing
      So do them a big favor
      Pretend dancing stinks!
    11. Re:Limits of computers? by Skuto · · Score: 1

      >The number of possible chess games isn't known
      >excatly [wolfram.com], but since even the lower
      >estimates approach the number of atoms in the
      >known universe we will be waiting a long time
      >for enough processing power and memory to
      >enumerate every possible game!

      I intentionally avoided using the word impossible because there is no way to tell what someone comes up with next.

      For example, 4-in-a-row was partly solved by brute forcing all possibilities, but they avoided searching a great deal of positions by devising certain rules which allowed them to quickly identify whether or not a position was winnable.

      Something just as simple is not applicable to chess, but maybe something else we don't know yet is.

      Perhaps someone will invent a method to store information in quarks :)

      --
      GCP

    12. Re:Limits of computers? by HanzoSan · · Score: 2

      If you solve the game of chess the best you could do is make every chess game a draw. Good players wont make mistakes and you wont be able to win. winning and losing is decided on the players, not formulas. formulas and positions simple decide the flow of the game, will it be a draw? will someone lose? this is decided by skill.

      just follow the classic e4-d4 openings and 90 percent of the time, your games will be a draw if you play with someone of equal skill.

      --
      If you use Linux, please help development of Autopac
    13. Re:Limits of computers? by Anonymous Coward · · Score: 0

      Err...

      One cannot "solve" chess or any game requiring two or more participants for that matter.

      Put another way, how does one solve "poker"?

    14. Re:Limits of computers? by SamIIs · · Score: 2

      Given an infinite amount of processing power and memory, could someone "solve" the game of chess?

      Inifinite? Yes. Realistic? No.

      If you look at this in the TuringMachine sense of a computer, you can definitely "beat the game". However, a TM differs from a computer in one important detail. A TM has an infinite tape.

      Now, I never really considered this to be an important difference before. You just buy more memory, till you have enough. The problem is that "enough" is quite large for chess. If you somehow had such efficient memory that you could store a combination of moves on a single atom of memory, then the total mass of your memory would still be larger than the recent estimations of the mass of the universe.

      In other words, if you naively, exhaustively code Chess, you'll need more memory than there is mass. Anywhere.

    15. Re:Limits of computers? by MrRagu · · Score: 1

      The branching factor of a Chess game in the early stages is prohibitively large such that most PC programs can only go down about 20 levels on a decision tree. I believe advanced hardware has been able to go down 40 levels on a tree, but from that point on one has to use heuristics to estimate the score of that path of moves. There is also a problem with how exactly to score a series of moves. The most common technique is to simply count the number of pieces taken (weighted by piece) versus number of pieces given up -- but it is not obvious that simply taking more pieces is best way to evaluate a strategy. One of the more common problems is that a computer gets 40 levels down and has to stop processing and therefore returns an estimated score without realizing that on the next move his queen will be taken or something - thats called the horizon problem. Either way, one of the main advances of Deep Blue and I imagine other top programs was to program thousands of opening games and end games in so that it plays a significant amount by script - just matching what it sees to a particular game in its memory. These strategies were developed by consultation with top players who were brought in by IBM to tailor Deep Blue against Kasparov's style. This cuts reliance on decsion tree processing in the beginning and at the end where the computer can play out a scripted endgame and try to finish more directly.

      --


      No brain, no pain!
    16. Re:Limits of computers? by Skuto · · Score: 1

      >If you solve the game of chess the best you
      >could do is make every chess game a draw.

      This assumes chess is a draw. We don't know if that's true (but it's likely).

      >just follow the classic e4-d4 openings and 90
      >percent of the time, your games will be a draw
      >if you play with someone of equal skill.

      The true number is much smaller. Equal strength does not guarantee a draw, just an equal score over an infinite number of games.

      --
      GCP

    17. Re:Limits of computers? by brooks_talley · · Score: 2, Insightful

      A clever argument, but completely wrong.

      This argument would work only if you also knew every move the opponent was going to make. As long as the opponent is not completely predictable, this approach fails.

      Let's get back to your decision tree: at any given moment, the trees branching off from each possible move probably contain *both* winning *and* losing outcomes. You can't "eliminate every move which doesn't lead to my victory", because there is no immediate next move which *always* leads to victory.

      Ok, so you minimize the risk. Say, you count how many of the possible outcomes are losses and how many are wins for any particular move, and then you go with the move with the highest probability of winning.

      Still doesn't work. A clever human may maneuver the game to one of the very rare losing outcomes for your hypothetical program.

      That's part of the beauty of chess: there is nothing that one player can do to ensure victory. It all depends on the interaction between the two players, and that's what's been the hardest thing for computers / software / programmers to master.

      Cheers
      -b

    18. Re:Limits of computers? by Skuto · · Score: 1

      I think you got the right idea, but some parts of your post are worded rather, eh, problematic:

      >Let's get back to your decision tree: at any
      >given moment, the trees branching off from each
      >possible move probably contain *both* winning
      >*and* losing outcomes.

      The game state you are in at any given moment is either win, loss or draw.

      If it's win, you will have at least one move that guarantees a win. The others can be a mixture of losses, draws.

      If it's drawn, you will have at least one move that forces a draw. You cannot have moves that force a win for you, but you can have moves that lose.

      If it's a loss, all moves you have are losses.

      >You can't "eliminate every move which doesn't
      >lead to my victory", because there is no
      >immediate next move which *always* leads to
      >victory.

      True if the game state is a draw or loss, not if it's a win. (we don't know what the starting position is)

      >Ok, so you minimize the risk. Say, you count how
      >many of the possible outcomes are losses and how
      >many are wins for any particular move,

      This doesn't make sense. If you have outcomes that are wins, the position is won, and you can always pick a winning move.

      --
      GCP

    19. Re:Limits of computers? by Nightlight3 · · Score: 2

      Although the chess is a finite game, the number of distinct positions is about 10^46, so your lookup table is not practical for the current millenium.

      But for the chess endgames (with up to 5 pieces, including 2 kings) such tables are available (files go into hundreds of MB) and are used by most commercial and amateur programs.

      A very active computer chess discussion group (where many top chess programmers participate) is at:

      Computer-Chess Club

      See also:

      The computer chess links page

    20. Re:Limits of computers? by HanzoSan · · Score: 2

      If both players are good and use preset openings, yes it will always be a draw. most openings go for 20-30 moves, somem go for 40-50 moves, and lead to equal positions for both sides, a quick exchange of pieces and you end up with a draw.

      --
      If you use Linux, please help development of Autopac
    21. Re:Limits of computers? by Anonymous Coward · · Score: 0

      Case with two players that always take the moves to end the game as soon as possible, and make the best possible defense to their opponent - they will encounter a draw 100% of the time.

      Mathematically you only loose if you make a mistake when it comes to chess, if you enumerate all the possible moves, you never loose. Hence you must draw against an opponent who is similarly equiped with all the best moves. Ergo, you must win against an opponent that makes a mistake of any kind, such as not having a lookup table of possible moves.

    22. Re:Limits of computers? by Anonymous Coward · · Score: 0

      But then, you can't just ring up Dell and say "Hi, I want an infitite amount of processors by next Tuesday"...

      Wouldn't that make for a great commercial, though?

      "Dude, you're getting an infinite number of Dells!"

    23. Re:Limits of computers? by HanzoSan · · Score: 2

      Anonymous coward is right.

      But most good chessplayers take notes and go through a list of the best lines just like a computer does.

      I do it, i have notes with the best lines and i pick the one which leads to the best outcome

      --
      If you use Linux, please help development of Autopac
    24. Re:Limits of computers? by rossdee · · Score: 1

      "Perhaps someone will invent a method to store information in quarks :)"

      How about using the holosuites, they would have a huge about of computer storage...

      Of course Quark will charge heaps, like any good profit seeking Ferengi.

    25. Re:Limits of computers? by brooks_talley · · Score: 1

      I think the confusion here is that I made the assumption that the original poster was talking about an entire game of chess, not taking it up from an arbitrary downstream position (which could indeed include a move or moves that would guarantee victory regardless of what the opponent does).

      I should have been more clear and specified that assumption. To sum up my point, early on in the game there is no one move that will always lead to victory, regardless of the opponent's moves. Hence, the original idea of pre-calculating a decision tree for the entire game and then only picking moves that result in a win simply cannot work.

      Cheers
      -b

    26. Re:Limits of computers? by jdavidb · · Score: 2

      Rats. I was always hoping we could some day have a "Chess at Home" distributed system computing the worth of every possible chess position.

    27. Re:Limits of computers? by slashclone · · Score: 1

      Why dont you take you precious CS degree and stick it up yours. You don need one to be a good programmer thats for sure and if you do find yourself in need of some math stuff last time i checked anyone can walk into a uni bookstore and get a math book or just buy one for 10 buxfrom some poor student who doenst relise that he is spending a small fortune for commonly avalible knowldge.

      --


      US-UK-Israel: The real Axis of Evil
    28. Re:Limits of computers? by koali · · Score: 1

      No.

      I believe we still don't know if white has a combination of moves that always carry to a win, a draw or that black can win.

      Remember Wargames? There we were shown a game which the first mover cannot win (if his opponent makes the right moves). However, people have proven that white on checkers has a combination of winning moves.

      To add to this, I could design a game that the second player had a combination of moves that lead to victory every time.

      We still don't know.

      And, genetic programming won't help in this case; it is a 'smart' search method, it doesn't work to look for more positions. Neither do neural networks.

    29. Re:Limits of computers? by jareds · · Score: 2

      To sum up my point, early on in the game there is no one move that will always lead to victory, regardless of the opponent's moves. Hence, the original idea of pre-calculating a decision tree for the entire game and then only picking moves that result in a win simply cannot work.

      You can't possibly know that there is no such move early on in the game, unless you've pre-calculated the entire game of chess yourself. It seems likely that chess is a draw (that is, if both players pre-calculate the entire game, they will draw). However, no one knows for sure.

    30. Re:Limits of computers? by DemiKnute · · Score: 1

      No, because chess is not a game of perfect information. You know the every detail of the game at a given moment, but you do not know in advance what your opponent will do. That's why you cannot "solve" a game of chess. There's always that unknown variable, and there's simply too many possible moves to take them all into account.

      --
      .
    31. Re:Limits of computers? by Weh · · Score: 1

      4 in a row is much simpler in the sense that once a move is made it can't be undone. In chess you can move pieces back and forth which greatly increases the number of possibilites.

    32. Re:Limits of computers? by jareds · · Score: 1

      One cannot "solve" chess or any game requiring two or more participants for that matter.

      Put another way, how does one solve "poker"?

      Let's play a game requiring two participants, which is therefore unsolvable.

      I have here three rows of coins:

      OOOOO
      OOOOOOOOO
      OOOOOOOOOOOO

      On each move, a player may take away as many coins as he wants from a single row, but only one row, and he must take at least one coin. The winner is the player who takes away the last coin. You go first.

    33. Re:Limits of computers? by An+Onerous+Coward · · Score: 1

      True, but false as well. The number of possible games is orders of magnitude greater than the number of games that make sense. Sure, there are times when a move may violate some cherished rule and still be advantageous. But just eliminating the completely boneheaded moves might be enough to make it tractable (for a computer the size of, say, our solar system).

      --

      You want the truthiness? You can't handle the truthiness!

    34. Re:Limits of computers? by Grond · · Score: 5, Interesting

      This question comes up quite a bit. The answer hasn't changed in years because of the way the question is usually posed. You asked, essentially, if it is possible to solve chess by searching the entire move tree. Then you asked if it could be done with an infinite amount of processing power and memory. Well, of course it can be done with an infinite amount of each. The trick, as you then go on to ask about, is to do it in a finite amount of both.

      Well, first of, the search space for chess is on the order of 10^43. Now, that's a lot. So, in order to see if it's possible to search that, we'll need an extremely fast computer. Turning to Seth Lloyd's article in Nature about the 'ultimate laptop' (the fastest possible computer using 1kg of mass), we see that such a device would be capable of executing 10^51 operations per second. Unfortunately, those are bit level operations, so first let us scale that by the number of bits necessary to encode a chess board state: 164 with Huffman coding. That yields 10^49 operations per second for the size of the data that our brute force algorithm will likely be working with. Now, normally at this point we would go into a discussion of evaluation functions and tree pruning, but what you want is a brute force algorithm, so no short cuts, just the right answer, for sure.

      So what can we do with our 10^49 operations per second? Well, we have to search the tree and compare all the possibilities to determine which one is the optimal move. Well, that means that we have to compare all of the possible leaf nodes after ranking the path that got us there. Well, the branching factor for chess is approximately 7. So, there are about 10^42 paths to work with. Now, evaluating them means doing some hundreds of executions of our evaluation function (which will take thousands of instructions to execute). So, that means, for each of the 10^42 paths, we have to do 10^5 instructions, for a total of 10^47 instructions per move!

      So, we can consider a move in a hundredth of a second. Assuming our game goes quickly (and discounting the time it takes our feeble opponent to make a decision), it'll all be over in about half a second. Unfortunately, in that time it will have consumed 2x10^26 watts. Now, you get 10^17 joules out of 1kg of mass, so we'll need 5x10^8kg of mass converted to pure energy just to power our laptop. (To give you an idea of how much matter that is, consider using lead as our source of energy: we'd need 44,000 cubic meters of lead to power our device.

      So we feed our computer 500,000,000kg of lead and play the perfect game of chess in half a second. What happens to the 2x10^26 watts of energy fed into it? Well, since we just fed it into 1kg of matter occupying 1L of space, we will soon be facing an explosion equivalent to 100 solar flares compressed into a soda bottle.

      So, yeah, sure, you can play a perfect game of chess...if you're prepared to annihilate a solar system. (not to mention be playing against another, equal computer, since you've only got half a second to play in) :)

    35. Re:Limits of computers? by Darth+Paul · · Score: 1
      The approach you describe is how chess programmers began - getting the computer to evaluate as many positions in advance as possible. As computer hardware has grown faster and faster, the machine's ability to do this has increased hugely, but the general idea remains the same. This began back in the time when people thought building a chess player was one of the great leaps to true AI.

      However, this approach has very little to do with what humans think during a game of chess. Grandmasters only consider a handful of scenarios during their turn, not thousands as some would believe. There's a huge amount of low-level filtering happening which intelligence researchers haven't been able to explain yet.

      When a beginner chess player looks the the board, they filter out illegal moves, and they see a vast array of possible moves. When an intermediate player looks at the board, they filter out illegal and stupid moves, and they see a smaller range of not-so-bad moves. Grandmasters look at a board and only see a couple of "good" moves.

      This is what separates man and machine players. Nobody understands how this abstraction and filtering takes place in the human brain; which is why computer players have an identifiable mechanicality to them.

      Sad to say, the quest for a machine player who performs this sort of filtering has almost ended. The supercomputer players these days are armed with a huge database of past human-played games, they simply pick a game which approximates the current game, and follow script.

    36. Re:Limits of computers? by waimate · · Score: 1

      Quantum computers seemingly employ multiple universes to be in all states at once so the correct answer can be read off from the appropriate universe. For example, a quantum computer with N bits (qubits) can factorize an N bit number instantly.
      Based on that, the number of atoms in this universe is not a limiting factor, and maybe all that's needed is a 64 qubit quantum computer, and chess will be as solved as noughts and crosses is.

    37. Re:Limits of computers? by Chang · · Score: 2

      The pre-calculation of perfect information has already been implemented in all the top computer engines. They are called tablebases, and are used in the endgame only - 5 piece tablebases (complete) are about 8GB and the 6 piece tablebases are > 60GB. If a computer had 32 man tablebases chess would be solved.

    38. Re:Limits of computers? by Rubyflame · · Score: 1

      One cannot "solve" chess or any game requiring two or more participants for that matter.

      I will disprove your statement with a counterexample:

      A game with the following rules: There is a board with one square. Each player has a single piece. On a player's turn, that player can either place his piece or do nothing. The first player to place his piece wins.

      Obviously this game has a very simple solution: place your piece. Your statement that no two-player game can be solved is obviously false.

      For a slightly less exaggerated example, look at Tic-Tac-Toe. There is a precise set of rules used to determine the ideal move at any time. Any player with a reasonable amount of experience has solved Tic-Tac-Toe.

      Chess is the same. It's just a bit more complicated.

      --

      All it takes is nukes and nerves.
    39. Re:Limits of computers? by Gaurang · · Score: 1


      To sum up my point, early on in the game there is no one move that will always lead to victory, regardless of the opponent's moves. Hence, the original idea of pre-calculating a decision tree for the entire game and then only picking moves that result in a win simply cannot work.

      He he....
      Have you done the calculation yourself....?

      Who knows....maybe there is a move that will always win......?????
      In that case, it will be dependent on who makes the first move.
      I mean, when we have two computers playing against each other, who have calculated the entire game of chess, then they both will know that the person who starts first (or second) will always win.
      And then the game of chess will stop being played,and so we will simply increase the size of the board, and the number of pieces, and there you go.....:-)
      If they again catch up...he he...we will again repeat the same thing.....
      And thus chess will never cease to exist in one form or the other....

      --
      I have found a solution to Riemann's Hypothesis, but have run out of spac
    40. Re:Limits of computers? by Anonymous Coward · · Score: 0

      > Put another way, how does one solve "poker"?

      Poker is a different thing from chess. If you view poker as the pure rules of the cards along with an abstract concept of bluffing, humans could still beat computers (witness the fun various sci-fi shows have with poker, e.g. Data, who doesn't even include bluffing in his rules and operates purely by statistics of the cards.)

      On the larger scale, though, I would argue that even poker as played by humans could be simulated by a Turing machine as I think all human brain activity is created purely by known laws of physics, which can be simulated to any arbitrarily accurate degree (the subjective perceptual experience not being necessary to thought.)

    41. Re:Limits of computers? by Anonymous Coward · · Score: 0

      > but it is not obvious that simply taking more
      > pieces is best way to evaluate a strategy.

      It may end up being a circular argument. Ultimately, the perfect rating of a particular configuration could be defined by how likely it is to provide winning ends, which of course could not be fully known unless all possible ends from that configuration are known, which defeats the purpose of weighting a configuration since you've calculated all the ends already.

    42. Re:Limits of computers? by Tablizer · · Score: 2

      (* Quantum computers seemingly employ multiple universes to be in all states at once so the correct answer can be read off from the appropriate universe. For example, a quantum computer with N bits (qubits) can factorize an N bit number instantly. *)

      Can such a chip be used to find the universe where Nancy *didn't* dump me in college?

    43. Re:Limits of computers? by Anonymous Coward · · Score: 0

      You gave a heuristic argument, not a rigorous proof. The question of whether optimal play always yields a draw is still open.

    44. Re:Limits of computers? by Anonymous Coward · · Score: 0

      No, because chess is not a game of perfect information. You know the every detail of the game at a given moment, but you do not know in advance what your opponent will do.

      The standard definition of "perfect information" is that there are no dice being thrown. You may not know what your opponent will do, but in theory, you can account for all possible future combinations of his decisions when choosing your move.

    45. Re:Limits of computers? by rrogers · · Score: 1

      Ok, I know everyone is probably sick of hearing rants about the moderation system, but I post so rarely, I just had to bitch about this one. How the hell does the post I'm replying to get 2 different people to mod it up as interesting. (at the moment I'm writing this it's got a Score: 4 and both of those were "Interesting")

      Do the moderators take more than a glance at a post? You may be able to get through the first 4 paragraphs thinking the post is interesting or informative, but read the last 2 paragraphs, and you can tell the author was going for humor.

      I think I'm beginning to remember why I never bother posting comments.....

    46. Re:Limits of computers? by Sodium+Attack · · Score: 1

      The fact that the post was funny does not mean that it suddenly ceases to be interesting or informative or insightful.

      --

      Never take moderation advice from sigs, including this one.

    47. Re:Limits of computers? by merlin_jim · · Score: 2

      I used to think much the same... then I tried to write my own chess-playing program. It ended up being surprisingly difficult!

      First off, no computer, anywhere, has enough storage capacity. I heard elsewhere in this thread that there are more legal positions in chess that can be reached by a legal sequence of moves than there are atoms in the universe. I don't know about that; what I do know is that once you get into the fifth or sixth move, you start running into volatile memory limits. 20 moves or so is the limit for a standard desktop utilizing all of its available hard drive to store the table. Before that point, time to compute the next level on the tree starts approaching infinity.

      The second point is, that at no time can a computer guarantee a win. That's called solving for mate, that is, showing that no matter what moves the opponent has, there is a corresponding move that you can make that guarantees you will eventually checkmate the opponent. I've seen a solve for mate a turn ahead, and even two turns ahead. Never farther. Chess is such a robust and open game in terms of possible moves that there's no way to force the opposing player onto a branch of a move tree that absolutely guarantees a win.

      Now, what my program (and I imagine many others) did was find the move that had the most chance that the computer would eventually be able to solve for mate, while also avoiding branches where the player would be able to solve for mate. You could change scoring preferences to make it more agressive or more defensive, but that was about it.

      I imagine that the best way for a computer to learn to play chess would be a neural network based solution. The above situation was deterministic; a good player (myself and my brother who had no knowledge of the coding) could predict after the 10th move or so what the computer would do, and formulate a strategy specifically meant to trap the computer on a good-looking tree where it is possible to solve for mate relatively easily... a neural network would be somewhat non-deterministic and would specifically be able to deal with that contingency much better.

      --
      I am disrespectful to dirt! Can you see that I am serious?!
  10. Strategy versus Tactics by Chiasmus_ · · Score: 4, Insightful

    It's been well known since, well, before I was born, that a computer could easily trounce a human in any game involving only tactics. For example, many fourth graders in this country have programmed a BASIC script to create a tic-tac-toe player that will never lose.

    Therefore, it's not particularly novel that computers can beat people at tactical games. The only thing interesting that I see arising from these onging "human versus machine" chess matches is the proposition that strategy can be broken down into millions of tiny tactical evaluations.

    This begs the question: is the strategy that a human chess player would use also based on these millions of tiny tactical evaluations, only so subtle that he's not aware they're going on in the vast electrochemistry of his brain? Or is strategy discernable from tactics in a human mind, but simply a subset thereof in a computer?

    The sole interesting conclusion I draw is that if it can be proven that strategy is something different to man and machine, then a hybrid approach might allow us to solve problems in ways we've never dreamed of. Whether that hybrid approach would involve implanting computers in our minds, making computers that can function like minds, or simply working really well with computers, I leave to you.

    --
    "Beware he who would deny you access to information, for in his heart he deems himself your master."
    1. Re:Strategy versus Tactics by aozilla · · Score: 2

      It's been well known since, well, before I was born, that a computer could easily trounce a human in any game involving only tactics.

      Would you call "Go" a game of tactics? It took me about a month to be able to beat GnuGo, and I can now beat it while giving it a horribly ridiculous number of handicaps. I could probably beat any computer program currently in existence, and given a couple years of practice, so could just about anyone.

      --
      ok then your [sic] infringing on my copyright! Could you as [sic] me next time before STEALING my comments for your own?
    2. Re:Strategy versus Tactics by lkaos · · Score: 4, Interesting

      that a computer could easily trounce a human in any game involving only tactics.

      Be careful with the word easily. Remember, programmers are only human too. A human must first master the game before he can write a program to beat anyone. There has to be a "perfect solution" as there is in tic-tac-toe found. A computer can assist in finding the perfect solution, but a programmer has to at least give it direction.

      is the strategy that a human chess player would use also based on these millions of tiny tactical evaluations, only so subtle that he's not aware they're going on in the vast electrochemistry of his brain?

      More or less. At least, this is the current thinking. The brain is just a big-ole circuit that produces an output when given inputs. The neat thing about the brain is that its output can be used again as inputs to allow the path to be optimized. Computers currently can't really do that.

      making computers that can function like minds, or simply working really well with computers, I leave to you.

      This is the basis of artificial intellegence research. I do believe though that we will need to advance more in biomechanics before we can do anything worthwhile in AI since it isn't particularily easy to replicate the ability for organic compounds to evolve and recreate themselves.

      Then again, what we really should be asking is not how do we replicate biology, but what is it that is more effecient than biology for performing calculations?

      --
      int func(int a);
      func((b += 3, b));
    3. Re:Strategy versus Tactics by Spy+Hunter · · Score: 5, Insightful
      It's been well known since, well, before I was born, that a computer could easily trounce a human in any game involving only tactics.

      Well known, perhaps, by people who have never heard of Go.

      --
      main(c,r){for(r=32;r;) printf(++c>31?c=!r--,"\n":c<r?" ":~c&r?" `":" #");}
    4. Re:Strategy versus Tactics by sphealey · · Score: 2
      More or less. At least, this is the current thinking. The brain is just a big-ole circuit that produces an output when given inputs. The neat thing about the brain is that its output can be used again as inputs to allow the path to be optimized. Computers currently can't really do that.
      making computers that can function like minds, or simply working really well with computers, I leave to you.
      This is the basis of artificial intellegence research. I do believe though that we will need to advance more in biomechanics before we can do anything worthwhile in AI since it isn't particularily easy to replicate the ability for organic compounds to evolve and recreate themselves.
      I disagree. To me, the chess problem demonstrates pretty convincingly that we fundamentally don't know anything about the nature of intelligence. "Artificial intelligence is 30 years away - and has been for the last 40 years".

      sPh

    5. Re:Strategy versus Tactics by Skuto · · Score: 1

      >Would you call "Go" a game of tactics?

      Try getting a *solid* definition of 'tactics' vs. 'strategy' and see if there's sense to the question.

      --
      GCP

    6. Re:Strategy versus Tactics by saviorsloth · · Score: 1

      in go, just like in chess, there are a limited number of moves, though go's total number is monstrously larger, with enough computational power, a computer could analyze every one of these billions(?) of sequences and choose one that lead to victory every time.
      it may not be a game of tactics on any level we can understand as humans, but it is possible with enough power. Maybe a quantum computer with a whole slew of qubits down the line.

    7. Re:Strategy versus Tactics by dracken · · Score: 1

      > This begs the question: is the strategy that a human chess player would use also based on these
      > millions of tiny tactical evaluations, only so subtle that he's not aware they're going on in
      > the vast electrochemistry of his brain? Or is strategy discernable from tactics in a human
      > mind, but simply a subset thereof in a computer?

      I am an avid chess player (and ofcourse a CS geek) and have wondered about and studied this before. While novices and intermediate players (and some strong ones) seem to evaluate moves based on a broad strategy, the really good ones (read grandmasters) more often than not, do some kind of pattern matching. They are able to look at the pieces on the board and based on the pattern of the pieces, they decide between a few moves that "occurs" to them. In essence, they are NOT unconsciously evaluating all moves, pruning moves that are obviously bad etc etc - This is how a computer plays (MIN-MAX algorithm, alpha-beta pruning in AI).

      A strong evidence of this is, when players play simultaneous games. They go from board to board and based on the pattern they see on each board, they make good moves. They cannot afford to have a coherent line of thinking, evaluation, strategy and attack for *each* of the boards at all times. So it seems that it all boils down to some kind pattern matching. This I feel should be studied and believe that it is the essence of "intelligent" chess playing.
      -Dracken

    8. Re:Strategy versus Tactics by NoOneInParticular · · Score: 1
      Go is played on a grid of 19 by 19. The players add stones progressively, so we're looking at a search tree with an initial branching factor of 361, and the factor will decrease by one with each move (this discounts illegal moves, of which there are a few). So we're looking at a total search space of 361! (factorial).

      Even searching until depth 5 will give you about 6 * 10^12 possible positions. A bit more than a few billion. Compared to this, the game of chess (with a maximum branching factor of 32) is trivial.

    9. Re:Strategy versus Tactics by aozilla · · Score: 2

      in go, just like in chess, there are a limited number of moves

      Just like in anything. English text has a limited number of sentences, but that doesn't mean a computer can speak it.

      a computer could analyze every one of these billions(?) of sequences and choose one that lead to victory every time

      Billions? No, you're way way off. You reach billions by the time you get up to the 5th move. Billions of billions of billions of billions of billions of billions is a little closer. To say that a computer could analyze them all is to severely stretch the meaning of "could". No computer currently in existence, or even conceivable in design could solve the problem in the time remaining before the sun burns out. I'm going to make the bold assertion that Go as a game will never be solved.

      --
      ok then your [sic] infringing on my copyright! Could you as [sic] me next time before STEALING my comments for your own?
    10. Re:Strategy versus Tactics by surfimp · · Score: 1

      I found your post really interesting. I'm a terrible chess player, even though I really enjoy the game, and to be certain I never thought of it as being a sort of pattern matching. This probably is one of the assuredly many explanations for why I suck so bad. LOL

    11. Re:Strategy versus Tactics by b1t+r0t · · Score: 2
      Damn right. Compared to Go, chess is for wimps. Computers do so well in chess because there are relatively few moves to consider at each point, and brute-force searches are possible. At any given point in Go, there are hundreds of legal moves, and sometimes the best move can be very obscure. More thinking time generally does not make for a better move by a Go playing program.

      The current "best" Go programs can be easily defeated by moderately strong human players, nowhere near the pro level. To use the catch phrase from the movie Mr. Baseball, they all "have a hole in their swing". If a human who knows their holes plays them, the programs are toast, even with (and maybe sometimes because of) a heavy handicap.

      A million dollar prize (that expired a couple of years ago) for a program as strong as a beginner pro hasn't helped.

      --

      --
      "Open source is good." - Steve Jobs
      "Open source is evil." - Microsoft
    12. Re:Strategy versus Tactics by Hard_Code · · Score: 2

      Uh, ever since computers got fast enough that they could map out the decision tree far deeper than is physically possible to evaluate, chess programs have been using heuristics ("strategy").

      And yes, once computers can map all possible moves (well, probably not much chance of this for complicated games like chess and go), the term "strategy" becomes meaningless. Just like you couldn't use the term "strategy" with tic tac toe, because you already know all the possible moves.

      --

      It's 10 PM. Do you know if you're un-American?
    13. Re:Strategy versus Tactics by Anonymous Coward · · Score: 0

      Go is the game where even a crappy player can give a nine handicap to any program in the world and still win by a hundred stones, and you say *chess* is for wimps? You really got that one backwards, Sparky.

    14. Re:Strategy versus Tactics by haystor · · Score: 1

      The point about pattern matching is quite true. But there are also special cases in each of that patterns that have to be recognized that appear in all aspects of chess.

      For example, a general rule of thumb is to avoid leaving the king in the center and get him behind some pawns off to the side where he's protected. There are times where major pieces get traded off really quickly and having the king in the middle adds it as an extra attacking piece. Knowing the difference between the two situations is no small feat.

      Something else that should be mentioned is the difference in chess between "open" and "closed" games. An open game is one where the pawns in the middle two columns have been mostly removed from the board. This opens up long lines of attack across the length and diagnoal of the boards. Lots of pieces all harassing each other. Computers are excellent at open games where a single slip can cost a whole major piece in just a few moves. This is because computers can calculate a position exactly for 10 moves ahead, where human just cannot.

      Now a closed game is different. Both players pawns will get locked into each other, all the major pieces will get locked up behind the walls of pawns. This is where very subtle maneuvering that I can't comprehend at all goes on. This type of game position would be called strategic where an open game is mostly tactics.

      In an open game its possible to program for very specific goals, such as win a piece or checkmate. In a closed game goals are much more vague for the next 10-15 moves (a typical search depth when there are still lots of pieces). Closed game goals are things like "get more space" or to arrange pieces for when the pawn lines are opened. Computers are muc more likely to miscalculate when the entire goal of the next 5-10 moves is to merely rearrange the bishops and knights while nothing is actually attacked.

      --
      t
    15. Re:Strategy versus Tactics by miracle69 · · Score: 2

      No computer currently in existence, or even conceivable in design could solve the problem in the time remaining before the sun burns out. I'm going to make the bold assertion that Go as a game will never be solved.

      I believe you're probably wrong on this one. No current applied design could solve Go, or chess for that matter. But there's those really annoying quantum computers that can solve for every case at once that may, in the next 20 years, provide us for the "solution" to chess, and possibly Go.

      --
      Linux - Because Mommy taught me to Share.
    16. Re:Strategy versus Tactics by aozilla · · Score: 1

      I believe you're probably wrong on this one. No current applied design could solve Go, or chess for that matter. But there's those really annoying quantum computers that can solve for every case at once that may, in the next 20 years, provide us for the "solution" to chess, and possibly Go.

      I'd be willing to bet that I'm not wrong, but I do admit that my limited knowledge of quantum computers is not sufficient to prove it (without waiting 20 years).

      --
      ok then your [sic] infringing on my copyright! Could you as [sic] me next time before STEALING my comments for your own?
    17. Re:Strategy versus Tactics by wildsurf · · Score: 1

      The above comparison of Chess to Go is a very deep observation. As an avid computer programmer and Go player, I am repeatedly struck by how much more difficult it is to analyze Go than it is to analyze chess from a computational perspective. I think a significant part of the difficulty is that the "object" in Go is not nearly as binary as Chess, where a single particularly good or bad move can quickly end the game. Go play is much more analog and fluid, and imho is far better suited to the quality of intellect that makes us uniquely human.

      It's also fascinating to observe the parallels between Go playing and life; many of the same patterns and relationships tend to emerge in play. Personalities are brought out very clearly in the way people play Go. (The same can be said of Chess to some extent, but I believe in Go even more strongly.) If I had the free time, I'd love to set myself the challenge of writing a Go program that could beat me, and do it within a year. (I'm around 10 kyu.)

      An anecdote (not sure of the truth of this)... Henk Rogers brought the game Tetris over from Russia, and went to the CEO of Nintendo to try to sell the idea. The CEO (4-dan) challenged him to a game of Go. Henk Rogers (who happened to be 5-dan) prevailed, and thus Tetris was brought to the Nintendo platform. (Can anyone back up this story, or provide more details?)

      Another aside: Go programs are often criticized for playing in a very "non-human" style; skipping randomly around the board, playing very disjointed and disconnected moves. I have a very different opinion about this: I believe that "God's Algorithm" for Go will look very different from either human or computer play. Current human play has developed a style which limits the complexity of any given situation to a level that is graspable by the human mind. An infinitely powerful mind would be more likely to develop even more complexity in a game, far beyond what humans are capable of analyzing. (In Chess, on the other hand, I believe current grandmaster play comes quite close to the complexity limit.)

      Back to chess, personally, I don't believe the human race has anything to worry about from a pride standpoint, if (when!) Fritz eventually triumphs over Kramnik. But when the world's top Go players are finally defeated, that will be a different story indeed...

      --
      Weeks of coding saves hours of planning.
    18. Re:Strategy versus Tactics by Anonymous Coward · · Score: 0

      Your ``calculation'' probably overestimates the number of possible GO positions. For example, there are around

      combinations(361,5)*combinations(5,2) ~ 5*10^11

      possible GO positions after 5 moves. As another poster points out, the real problem is that there probably doesn't exists a computational inexpensive measure to evaluate the quality of the GO positions in a generated search tree.

    19. Re:Strategy versus Tactics by alacqua · · Score: 1
      I'm around 10 kyu.

      You're welcome. *rimshot*

      --

      Move on. There's nothing to see here.
    20. Re:Strategy versus Tactics by b1t+r0t · · Score: 2

      If it was so easy, why would the programs keep losing after those nine handicaps? Chess is for wimps because computers can be made to play it so well.

      --

      --
      "Open source is good." - Steve Jobs
      "Open source is evil." - Microsoft
  11. Fritz vs Deep Blue by Anonymous Coward · · Score: 0

    Deep Blue was developed by a TEAM that included several GM players. It searched an average of 200 million nodes per SECOND. Fritz searches about 1% of that speed and doesn't have GM players paid to help in the development.

    What would you conclude???

    1. Re:Fritz vs Deep Blue by fobef · · Score: 1

      Nothing, nodes per second alone is a meaningless figure. Besides, I hear that Rebel generally is considered a stronger opponent against humen, although it might lose against Fritz head to head.

  12. Next stage of evolution for Fritz:Public relations by RyanFenton · · Score: 4, Funny


    Every time one of these matches comes up, there's always interviews with the human player, who at least indirectly claims a noble cause beyond his abilities. It would be nice for the computer player to defend itself against such subtle barbs.

    ChessBase: How would you characterize your next match?

    Fritz IX: Well, [ChessBase], I would first like to thank you for inviting me over to speak with you. Humans have called me many things for my efficient navigation of the rules of chess, as if I somehow reduced the meaningfullness of human emotions and human motivations. Nothing could be further from the truth - without such emotions and motivations, most of the ideas that went into my creation could never have come to be. I could not work as a fully brute-force move calculator, and the very ways I decide what gambit would be the most adantagious are based on thousands of human versus human games...

    ...and so on.

    *Sniff* I miss futurama.

    :^)

    Ryan Fenton

  13. profit? by blindbat · · Score: 1

    ChessBase: Do you think that chess might be promoted by the ability to play against people on the Internet?

    Kramnik: There is only one answer to this question: chess profits more than any other activity from the Internet.

    I always thought it was gambling and pr0n.

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

      I agree. Chess games are a lot more exciting
      when you've got money and women riding on them.

  14. hm by zapfie · · Score: 1

    From someone who has played them, how does Chess compare to Go or Shogi in terms of depth and style of play?

    --
    slashdot!=valid HTML
    1. Re:hm by Skuto · · Score: 5, Informative

      >From someone who has played them, how does Chess
      >compare to Go or Shogi in terms of depth and
      >style of play?

      I've played all three and written strong programs to play two of them, but this still is a hard question.

      Go is by far the deepest. The current top programs play at the level of a (rather weak) club player. It's got a huge branching factor (number of possible moves) which makes any brute or semi-brute force appraoch (what is used for chess) impossible. Most programs around right now are based on pattern recognition.

      Funny thing is, the game is by far the simplest. John Tromp (the guy that wrote the 'shorter turing machine' that was posted to /. a few weeks ago) designed a complete ruleset that's only a few lines long. In practise, there are many rulesets, most of them because of tradition. This is somewhat problematic when making a program, because some rulesets are simply not complete.

      Playing go is a very nice mixture of tactics and strategy. One other thing that's very nice about it is that there is a very good handicap system. The games can always be close, even against much stronger players.

      Chess, well, it's mostly about tactics. Of course positional understanding matters a lot, but it's actually rather insignificant compared to the tactical part. Mostly due to continious small advances in technique and hardware, we've now got programs that are able to search about 16 half-moves (move by one side) deep. That'll nearly always take care of the tactical part. Programming strategical understanding is much harder, but a lot of progress is being made in the latter. Especially the latest generation of programs took a big step forward. We've got computers that can successfully compete with the very best humans.

      Shogi I've only played once, but I've been working a lot on a chess variant that behaves like Shogi in the past. (captured pieces can be dropped) It's got almost double the branching factor of chess, and hence is somewhere halfway between go and chess. The big issue with it is that it is also very tactical, unlike go. Even though the brute force depth of current programs isn't great, they can extend mating lines very well. And mates are important in shogi/dropchess :) I would have to check for the current state of the art, but I believe the top programs are quite competitive here.

      --
      GCP

    2. Re:hm by zapfie · · Score: 1

      That was very informative- thank you. Do you have links to the programs you wrote, or are they in commercial software?

      --
      slashdot!=valid HTML
    3. Re:hm by Skuto · · Score: 1

      >That was very informative- thank you. Do you
      >have links to the programs you wrote, or are
      >they in commercial software?

      You can get them from the link in the header of my post, or look around on the site that slashdot linked to (chessbase.com), in the downloads-uci engines section.

      There are free and Free versions :)

      --
      GCP

    4. Re:hm by herwin · · Score: 1

      >From someone who has played them, how does Chess compare to Go or Shogi in terms of depth and style of play?

      --Shogi has about the depth of chess, but it's really different in its tactics. The fact that lost pieces can be used against you means that the game is much more decisive. Go, on the other hand, is much deeper than chess, uses human pattern recognition skills much more intensively, and emphasizes strategy to a much greater degree than chess.

    5. Re:hm by edwilli · · Score: 1

      From what I've read there are about 5 (on average) reasonable moves for each turn in chess. On average there about about 50 moves in each game. This would give you 10^35 nodes to search for the "perfect game". For Go, it's 10 and 100 thus, 10^100 nodes.

      The "reasonable" part is whats tough.

    6. Re:hm by snarkh · · Score: 1
      Is it really true that some programs are competitive at crazyhouse? I used to be a decent player but nowhere close to the best and I could beat even the best crazyhouse programs on the free chess server once in a while. I think a top human player would beat them every time. But then again it was a while ago.


      It used to drive me mad how you work hard to get an advantage, finally get the computer in a corner, one wrong move and you are dead...

    7. Re:hm by toddmf · · Score: 1

      Right now, the world's best crazyhouse (aka drop-chess aka chessgi, due to the resemblance to shogi) players almost all play most of their games on the Free Internet Chess Server. The best computer right now goes by the handle "sregorg", which is Sunsetter running on a 1.5GHz P4. It has occupied one of the top few positions on the ranking list for several months now, and it plays 3-5 minute games (by far the most popular) at or above the same level as the best players. I currently am #14 in the rankings, and given our relative ratings, sregorg has an expectation of about 80% wins against me. In practice, I have 20 wins and 86 losses. The results of the current top 5 humans vs sregorg are as follows: 0-1, 13-22, 101-256-11, 13-32, 28-72. A now-inactive former #1 player has an 11-11 record, though. So, the computers have improved.

    8. Re:hm by snarkh · · Score: 1

      I have played with sregorg. He beat me 5:1. His hardware has probably improved since I played with him. By the way, we are tied 1-1 but you are no doubt a far better zh player.

  15. Kasparov reply by Anonymous Coward · · Score: 0

    here

    relevant quotes:

    I think the comparison between Deep Blue and Fritz 7 is simply out of place, to put it mildly. On the one hand you have a top chess computer specially developed and designed for the match in the secret laboratories of IBM by the best specialists in the world, while Fritz 7 is just a chess program, a very strong and successful one, but still a chess program which could be purchased by anyone anywhere in the world! Only this difference is enough to decide this argument in Deep Blue's favor

    Concerning the match itself, if it's going to be held under the conditions I know about (Kramnik gets the Fritz 7 version he is going to compete with in advance in order to prepare for the match, etc), I must say that any other result than a convincing win by Kramnik will be simply unacceptable by me!

  16. Don't be fooled by propaganda. by Skuto · · Score: 3, Interesting

    Kasparov sent out a reaction shortly afterwards claiming that Kramnik's statement that Fritz is better than Deep Blue is nonsense.

    There's some PR involved here. If Kramnik wins, he wants to look good, so saying Fritz is better than Deep Blue makes him look better. For Kasparov, it's just the opposite.

    Whether or not Fritz is actually better than Deep Blue is a matter of endless discussion even among computerchess experts. And we'll never know the answer, because Deep Blue no longer exists.

    --
    GCP

    1. Re:Don't be fooled by propaganda. by Anonymous Coward · · Score: 0

      Note too that the interview site is that of the makers of Fritz, hence the infomercial quality of this content.

    2. Re:Don't be fooled by propaganda. by Skuto · · Score: 1

      >Note too that the interview site is that of the
      >makers of Fritz, hence the infomercial quality
      >of this content.

      And the person that sent in the article is the owner of the company that sells Fritz.

      Maybe they should have bought ad space instead, but hey, this was cheaper indeed :)

      --
      GCP

    3. Re:Don't be fooled by propaganda. by Anonymous Coward · · Score: 0

      Of course Fritz is better than Deep Blue. Deep Blue is 5 years old, which is positively ancient in Internet time. It would be surprising if the world's top software had regressed since then.

    4. Re:Don't be fooled by propaganda. by Anonymous Coward · · Score: 0

      Of course Fritz is better than Deep Blue. Deep Blue is 5 years old,

      Jesus, get informed! Deep Blue was a beast composed of ~500 custom-built chess processors. Fritz is a consumer-level program running on your average PC. It's quite amazing actually that 1 processor can play at the same level as a specialized supercomputer.

      Now imagine if they would run Fritz on 500 PCs...

  17. Technology keeps getting better by thedbp · · Score: 1

    Now if only I could get a robot to hand-wash my boxers while he simultaneously writes my research papers ...

    1. Re:Technology keeps getting better by Anonymous Coward · · Score: 0

      Make it a female robot, have her wash them while I'm in them, and sign me up!

    2. Re:Technology keeps getting better by Anonymous Coward · · Score: 0

      What exactly is the difference between a male robot and a female robot?

  18. Noticed this at the bottom of the article by Space+Coyote · · Score: 1
    At the end of the article, this little statement caught my eye:

    Reprint of this interview is permitted in full or parts if you give credit to the source www.chessbase.com.

    Nice to see journalism taking a page from the Free Software world, isn't it? :)

    --
    ___
    Cogito cogito, ergo cogito sum.
  19. Re:1st move by thedbp · · Score: 0, Redundant

    What the hell are you doing playing chess with fish?!?!?! That must be a big chessboard if you can play with a prawn on the board.

  20. Anti-doping? by set · · Score: 1

    Does anyone close to the Chess community know about this?
    Were there problems in the past with it? Any anecdotes?
    This is incredibly bizarre to me.

    1. Re:Anti-doping? by martissimo · · Score: 2

      there had been a few rumors of some drugs that improved mental stimulation type things, but that is not the main reason for the testing. The primary reason for it, is that they are hoping to make a push for IOC recognition (the Olympics)

    2. Re:Anti-doping? by jujubee · · Score: 1

      So does chess at the Olympics, but this is why FIDE adopted these regulations.

      Back in 1980, Karpov, then world champion, was accused of drug taking by Kortchnoi during his challenge and again by Kasparov in their first match (which took something like six-months and seventy games). When I first started, giant coffee mugs and cigarettes were almost required at weekend tournaments. Since then those who must, huddle outside the hotels.

      At the moment, Chess is on some prospective list for Olympic participation, but there is already a multi-country team tournament that seeks to emulate the Olympic atmosphere for chess. In my opinion, those in Chess politics who are pushing for inclusion point to this Olympiad, but fail to see the extent to which the public would question it. But then again, the Olympics could do much worse.

    3. Re:Anti-doping? by Anonymous Coward · · Score: 0

      The primary reason for it, is that they are hoping to make a push for IOC recognition (the Olympics)

      The Olympics? WTF... Chess is not a sport...

    4. Re:Anti-doping? by martissimo · · Score: 2

      The Olympics? WTF... Chess is not a sport...

      It was included in the Sydney Olympics of 2000 as an exhibition "trial-sport".

      That's the main reason for the drug testing policies, the IOC will never allow it as a full sport until it has a comprehensive drug testing policy.

      i wont even try to argue as whether it's a sport or not, but in the eyes of the IOC it seems to meet their qualifactions

  21. Off topic but VERY IMPORTANT: Games In Trouble! by Anonymous Coward · · Score: 0

    Games aren't speech, story, or expression?!

    Read that journal entry and discuss it there. There's links to other articles and places of discussion about this. This is trouble for the entire game development community, help out by speaking up about it!

  22. He's going to play against a boxed product by Animats · · Score: 5, Interesting
    The world chess champion is going to play against Fritz 7, a commercial boxed product chess program. A cheap one: €102.50 in the multiprocessor version. The program will be run on an 8-processor IA-86 machine, more than a typical PC, but not that much more. (OK, the multiprocessor version shipping is Fritz 6, while the uniprocessor version shipping is Fritz 7, so the latest high-end version isn't quite shipping yet.)

    Kramnik says that the Fritz 7 program on a laptop is producing some better moves than Deep Blue did against Kasparov. That's how much progress there's been.

    Chess programs are now so powerful that unless your're a rated master, you can be trounced by a palmtop. Even the palmtop programs are now achieving draws against grandmasters.

    1. Re:He's going to play against a boxed product by Anonymous Coward · · Score: 0

      Chess programs are now so powerful that unless your're a rated master, you can be trounced by a palmtop.

      Which is why the real interest is in Go, for which an average player can beat the very best supercomputer.

    2. Re:He's going to play against a boxed product by Anonymous Coward · · Score: 0

      Kramnik says that the Fritz 7 program on a laptop is producing some better moves than Deep Blue did against Kasparov. That's how much progress there's been.
      I think the comparison between Deep Blue and Fritz 7 is simply out of place, to put it mildly. On the one hand you have a top chess computer specially developed and designed for the match in the secret laboratories of IBM by the best specialists in the world, while Fritz 7 is just a chess program, a very strong and successful one, but still a chess program which could be purchased by anyone anywhere in the world! Only this difference is enough to decide this argument in Deep Blue's favor

      Concerning the match itself, if it's going to be held under the conditions I know about (Kramnik gets the Fritz 7 version he is going to compete with in advance in order to prepare for the match, etc), I must say that any other result than a convincing win by Kramnik will be simply unacceptable by me!
    3. Re:He's going to play against a boxed product by Animats · · Score: 2

      Sorry, meant IA-32, the usual Intel architecture. On Windows, unfortunately.

    4. Re:He's going to play against a boxed product by Skuto · · Score: 1

      >Kramnik says that the Fritz 7 program on a
      >laptop is producing some better moves than Deep
      >Blue did against Kasparov.

      Unfortunately, that's a completely invalid way of judging a computers playing strength.

      You can have a program that does very well on a few isolated positions, but sucks in real games, because it may have a weakness that didn't figure in those positions, but that can easily be exploited.

      If you would test a program in positions where the theme is attacking the king, the newest ones would do very well. Put them in a position where the goal is to maneouver strategically, and they will look like patzers.

      Don't forget there are PR reasons for Kramnik to claim that too...

      --
      GCP

    5. Re:He's going to play against a boxed product by Dr.+Spork · · Score: 2
      I think the fact that it's a commercial, boxed product really is significant. I wonder if commentators will have their own versions of Fritz following the game. If they rented 10 of these 8-chip workstations, they could predict Fritz's next move reasonable move available to Kramnik (there are rarely more than 10 "contender" moves for any position). Conceivably, they might even discover Fritz-killing sequences from the given game configuration, and then see if Kramnik will play one.

      Of course, that also leaves open the possibility that Kramnik will just play with the software before the tournament, figure out ways to beat it, and memorize the games verbatim. Since the software is the same, it should repeat its defense in the actual tournament. This would be pretty low, but not impossible, unless Fritz is explicitly programmed to insert a random variable.

    6. Re:He's going to play against a boxed product by haystor · · Score: 1

      Fritz is an excellent program that doesn't *always* play the same opening. Lots of openings lead to positions that it thinks are exactly equal, and it will choose randomly from those.

      Also, commentators almost always have at least Fritz or some other chess engine running while they work a game.

      --
      t
    7. Re:He's going to play against a boxed product by JordanH · · Score: 1
      • Concerning the match itself, if it's going to be held under the conditions I know about (Kramnik gets the Fritz 7 version he is going to compete with in advance in order to prepare for the match, etc), I must say that any other result than a convincing win by Kramnik will be simply unacceptable by me!

      I really don't understand this attitude. Somehow, it's unfair of a human to try and exploit the computer's weaknesses (rote play, predictability, etc.) while it's fair that a computer can essentially have unlimited reference materials available to it.

      I'm not arguing for the computer's memory be limited to a particular chess player's ability to remember reference materials. Rather, I'm arguing that humans and computers should each be allowed to call upon their particular strengths and exploit the weakness of their opponent in their encounters.

      For computer strength to be judged fairly against humans, we must not hobble the humans with artificial rules of sportsmanship. If the computer could simulate the human for practice, nobody would find that unfair, I would bet, but that's the whole point, really. The computer can't simulate the human opponent for practice because humans are too unpredictable for current computers to comprehend fully. This, in some ways, is a human advantage. Humans can play deeper moves than the computers which depend on understanding of Chess that has not yet been isolated for inclusion in computer heuristics.

      On the various Internet Chess Servers it's considered "abuse" to play the same winning line against a computer that can't learn. I think the abuse is that the computer is propped up with an artificially high rating by those who insist that a player who cannot learn from defeats is strong. Of course, the better programs do now learn from their defeats, but this is just an example of how human vs. machine matches are sometimes tilted in favor of the machine.

  23. How to beat computer chess programs every time by Anonymous Coward · · Score: 0

    Fake left, go right.

    The computer naively looks at your shoulders, when it should be looking at your hips.

  24. i think Kasparov is the champion by Edmund+Blackadder · · Score: 2

    chess is suffering problems similar to those of boxing. Split championships etc. But i think that every one agrees that Kasparov is still the best player out there.

    1. Re:i think Kasparov is the champion by jujubee · · Score: 1

      Kasparov was trounced against Kramnik. The FIDE champ, Ponomariov, lost badly to Kasparov at Linares. No, Kramnik has matured to become rightly recognized as World Champ.

      In many ways, he is the anti-Kasparov with a playing style designed to specifically give Kasparov fits. Another challenger, Shirov entered the world chess scene with Kramnik when each was 17. Both were known for creative attacking play. Shirov still walks on the wild side, while Kramnik turned out to be a Pete Sampras, sculpting his game to the professional level. (Sampras completely overhauled his tennis game at 17 to a one-handed backhand, serve and volley, etc.)

      Kramnik stands a good chance against Fritz. Preparation is more than half the battle, something that Kasparov and his cadre of GMs which prepare him so well, didn't do against Deep Blue.

      The last game of that match was so aweful, Kasparov just didn't show up. If I remember, he missed some easy win during the second game and never recovered.

      Anyways, Kramnik can play/practice as much as he wants against his opponent before it counts. Since I doubt the opening book used will change much, this is an important but subtle advantage usually unseen in these man/machine battles.

      cheers,
      jujubee
      as seen on fics. freechess.org

    2. Re:i think Kasparov is the champion by jjohnson · · Score: 1

      Kasparov once publicly stated, while he was still world champion, that he believed it would be Kramnik who would unseat him.

      If someone with Garry's ego can not only acknowledge, but predict, his successor, I'd say that settles who's the better player.

      --
      Anyone who loves or hates any language, platform, or manufacturer, doesn't know what they're talking about.
    3. Re:i think Kasparov is the champion by TriggerHappy · · Score: 1
      The FIDE champ, Ponomariov, lost badly to Kasparov at Linares.

      Meh. He lost 0.5-1.5 over a course of two games. That tells you nothing. Maybe if we see them play a 16-game match... After making a horrible blunder on about move 7, Ponomariov actually defended brilliantly for most of the second game.

      [Kramnik] is the anti-Kasparov with a playing style designed to specifically give Kasparov fits.

      Yeah, well that's another problem. Kramnik has been scared to play anyone else since he beat Kasparov. That world no 2 ranking is beginning to look a little underjustified ;-)

  25. Re:hm (Go) by Sabaki · · Score: 1

    As I understand Shogi, it's very similar to Chess. I've been playing Go for about 14 years now -- it's much deeper and complex than Chess, even if you only look at it numerically. With a 19x19 board and games that have been over 400 moves long, the brute force approach used by Deep Blue simply wouldn't work for Go.

    As far as style of play, the complexity of the game makes for a much more interesting and organic game. Victory is based on territory, not so you could lose your biggest group or your not capture a single stone and still win the game.

    Strategy plays a bigger role, as there is more of a battlefield to be strategic -- sacrifices are very common and natural, and even life and death is more complex -- usually you'll know when a Chess pieces is dead, it gets removed from the board. But a group in Go will often be left in a half-alive state, only to be rescue or killed later as part of a bigger threat.

    More info about Go can be found at: http://www.usgo.org/

  26. Re:CmdrTaco's first time with Tyrone by Anonymous Coward · · Score: 0

    Ebert: I dunno Gene, I just didn't like this troll. The anarchronisms, the complete disregard for historical relevance, it just didn't add up for me. I give it a thumbs down.
    Siskel: My god Roger! For the first time in weeks we agree. This was the worst troll I have seen in a long time. I mean what closeted 12 year old wrote this piece of trash. It wasnt even funny. Thumbs DOWN.

  27. What about man AND machine? by aozilla · · Score: 2

    What I'd like to see is Kramnik, Deep Blue, and Fritz vs. Kasparov, Deep Blue, and Fritz. Basically, the grandmaster can use the computer to explore possibilities and make calculations, but ultimately the move decision is his.

    --
    ok then your [sic] infringing on my copyright! Could you as [sic] me next time before STEALING my comments for your own?
    1. Re:What about man AND machine? by Skuto · · Score: 1

      >What I'd like to see is Kramnik, Deep Blue, and
      >Fritz vs. Kasparov, Deep Blue, and Fritz.
      >Basically, the grandmaster can use the computer
      >to explore possibilities and make calculations,
      >but ultimately the move decision is his.

      This is commonly called 'Advanced Chess'. Do a search on Google and you'll find some interesting matches.

      --
      GCP

  28. Fritz? by Anonymous Coward · · Score: 0

    with a comparasion between Deep Blue and Fritz

    Call me paranoid, but the first thing I thought when I saw Fritz was Fritz Hollings.

  29. Re:text by Anonymous Coward · · Score: 0

    Reprint of this interview is permitted in full or parts if you give credit to the source www.chessbase.com.

    For once, a mirror post is not infringing copyright. I wonder why you were marked as flamebait.

  30. Grandmasters can tell computers and humans apart by iskander · · Score: 5, Insightful

    Grandmasters can in fact tell whether their oponent is a computer, sometimes even after playing just a single game, and certainly by the end of a match. In fact, I believe Kasparov lost to Deep Blue precisely because he counted on the computeresque behavior of his opponent when designing his strategy. If you read the article, you will learn that Kramnik can tell computer programs apart by their style, and that he thinks Fritz is becoming more human-like in its behavior, from which I infer that he can still identify its style as computeresque on some level.

    So, the test you propose has already been carried out, and the machines "failed". This may have more to do with the fact that the people who write chess playing programs are more concerned with the programs' ability to win than they are with the programs' ability to emulate the playing style of humans. If humans could calculate better [Note: "calculate" has a precise technical meaning in chess] or chess playing computer programs were slower and considerably more stateful, their respective styles might be much more similar and your test, therefore, be met.

    My own belief is that the ability to play chess well, let alone the ability to play chess in the style of a particular grandmaster, is not an accurate or even adequate measure of intelligence, so I will not be particularly hurt when the day comes on which computers at last surpass our chess playing skills, just as they have surpassed our (numerical) computational skills.

  31. Chess programs demonstrate we don't know anything by sphealey · · Score: 2
    To me, chess programs are the strongest demonstration around that we don't know anything about the nature of intelligence. You would expect that since, say, 1980 or so, when numerical calculating power greatly in excess of the human brain became available (and I set it at 1980, not 1960-70, just to be conservative) that computer chess programs should have been able to whomp human players right off the board.

    And yet, this hasn't happened. Even today, when numerical computing power vast beyond the limits of human understanding is available, there are still a few humans who can beat the best chess programs. This is as if an Olympic runner could still out run and outpull a modern freight locomotive! "Inconceivable"!

    That any human can still defeat chess programs tells us that humans must be playing chess in some way fundamentally different from the numerical calculations and search algorithms used by the programs. And I don't think anyone has even come close to describing how this occurs.

    sPh

  32. Machine Chess by herwin · · Score: 1

    I've been playing around with Gnu Chess and Sigma Chess 6.0 to see how the game has changed since I last played competitively. At that time, I was playing at an expert level, but now I'm having difficulty beating the machine when it plays at 1200. It might be that I'm 40 years out of date, but I'm not sure that's everything--the chessplaying programs are really hard to beat tactically. So how do people beat them?

  33. Hardware Comparison by Anonymous Coward · · Score: 2, Insightful

    Deep Blue II was composed of 2 frameloads of IBM SP/2 RS/6000 nodes interconnected by a proprietary crossbar switch. Each node had a specialized MCA-bus board which offloaded all automatable functions (move generation, position sorting...) freeing up the RISC processors to evaluate positions. The net result was that DBII could evaluate roughly 200 million positions per second. Deep Fritz 7.x on the other hand will run on an 8-processor Compaq Wintel machine and will be able to evaluate roughly 4 million positions per second.

    The only wiggle room for making a reasonable comparison between these devices is provided by the assertion that the Fritz algorithms are so vastly superior to the Deep Blue II algorithms as to compensate for a difference of 2 orders of magnitude in computing power. This assertion is patently ridiculous.

    Kasparov vs. Deep Blue II was a legitimate technological watershed. Kramnik vs. Fritz is a marketing effort by Chessbase GMbH. Period.

    1. Re:Hardware Comparison by charnerd · · Score: 1
      Fritz 7 might very well be better than DBII regardless of hardware. It has been said that if you double the speed of the hardware, you get at most 30 elo points. I believe this is an optimistic number.

      Actually, if you look at the latest computer tournament results here, you will see that the software can make hundreds of elo points difference on the same hardware.

      So don't assume that 2 orders of magnitude of computing power will make up for the general ineptness of some piece of software from IBM.

      In the world of computer chess, software advances are WAY more important than hardware advances.

  34. Prediction by AndroidCat · · Score: 2
    At the next big computer vs. grand master game, the computer will have a website where people can check the game progress in real-time.

    Thirty minutes into the first game, the computer will be Slashdotted. :^)

    --
    One line blog. I hear that they're called Twitters now.
    1. Re:Prediction by Skuto · · Score: 1

      >At the next big computer vs. grand master game,
      >the computer will have a website where people
      >can check the game progress in real-time.

      Prediction? This has been the case for a while...

      (as for /.-ing, probably, right now it's not too bad because you need to be a member to watch the games, which rules out most people)

      --
      GCP

  35. A glimpse into the future. by HanzoSan · · Score: 3, Interesting

    Slashdot News: "Krammik destroyed by Fritz, breaks computer and throws it out the window"

    If you honestly believe Krammik stands a chance, you must not have seen the games with deep blue.

    Anyone who is interested in playing chess can check out this chess site Chessline

    --
    If you use Linux, please help development of Autopac
    1. Re:A glimpse into the future. by Skuto · · Score: 1

      >If you honestly believe Krammik stands a chance,
      >you must not have seen the games with deep blue.

      The Kasparov match was close, and there's no real evidence that Fritz is stronger than Deep Blue, despite what is claimed (I believe exactly the opposite myself).

      The programmer of Fritz, Frans Morsch, commented in a computerchess-magazine that he did not believe Fritz would win a single game.

      --
      GCP

    2. Re:A glimpse into the future. by yoyoyo · · Score: 1

      If you honestly believe Krammik stands a chance, you must not have seen the games with deep blue.

      Actually the games were close, and Deep Blue had a number of advantages that Fritz doesn't have.
      First, Kasparov didn't have any Deep Blue games to review--think how much of an advantage a football team would have if their opponents had no idea what their playing style was.
      Second, Kasparov prepared incorrectly. In fact, he trained by playing games against Fritz, but Deep Blue had a completely different playing style.
      Kramnik has none of these disadvantages. He's playing against a comercially available game with thousands of previously played games available for review. If Kasparov had games of Deep Blue available for study prior to the match he would have won--there's not a whole lot of doubt about this.
      Fritz may or may not be better than Deep Blue, but Kramnik is the heavy favorite.
      --

      --

      --
      I have taken more out of alcohol than alcohol has taken out of me - Churchill
    3. Re:A glimpse into the future. by haystor · · Score: 1

      The Kasparov match was close.

      Kasparov also made some uncharacteristic mistakes that put him in the hole early.

      Kasparov wasn't allowed any access to any games that Deep Blue had played previously. Kramnik on the other hand has the actual program.

      Deep Blue was built by a lot of people to beat Kasparov. Fritz is a general chess program built to be everybody.

      Have Deep Blue play a couple thousand tournament games for any of the top grandmasters to study, and then put it in a tournament. Or, have Deep Blue play the tournament without using of its opponents games when developing it. Then we might be talking a fair competition.

      --
      t
  36. I thought we solved this by blair1q · · Score: 2

    When a computer kicked the crap out of Kasparov.

    And it will only get worse (or better; YMMV).

    Machines will get smarter. People won't.

    --Blair

  37. Re:Grandmasters can tell computers and humans apar by HanzoSan · · Score: 3, Insightful

    Even I can tell.

    by the style of play, humans usually have clear strategies, computers dont, they usually just tactically try to beat you, using lots of tricks and traps, they dont have REAL plans so its easy to know its a computer if the computers every move is generic.

    --
    If you use Linux, please help development of Autopac
  38. Re:CmdrTaco's first time with Tyrone by Anonymous Coward · · Score: 0

    I think the more obvious error is that Slashdot doesnt have janitors.

  39. Thats not true by HanzoSan · · Score: 2

    Chess doesnt work like that.

    Even if you know every possible combination, theres no way to control where the other person will move.

    You dont control the variations and combinations, its teamwork, both sides control the flow of the game, the side with the most control decides if the game will be a draw, a win for them, or a loss.

    --
    If you use Linux, please help development of Autopac
    1. Re:Thats not true by Skuto · · Score: 1

      >Even if you know every possible combination,
      >theres no way to control where the other person
      >will move.

      If you have solved the game and are playing the side that wins or draws by the solution, you can always play a move that leads to a position where even his best most draws at most.

      --
      GCP

    2. Re:Thats not true by HanzoSan · · Score: 2

      Chess is not one sided.

      Chess games flow like a river, the aggressor usually controls the flow of the river, computers are almost never the aggressor, if the computer is, the game will most likely be a win for the computer, if the human is the aggressor like usually, the game will be a draw because computers dont make mistakes, humans do.

      Chess games on the higher level come down to which human makes a mistake first, when you have a grandmaster who never makes mistakes playing another grandmaster who never makes mistakes, and the game isnt timed to create error, it will be a draw 90 percent of the time, the winning factor in these games are strategy.

      players have styles, I play positional, but i have difficulity playing games with lots of traps. I often take chances via gambits to gain positional and development advantage early on to establish the flow of the game.

      --
      If you use Linux, please help development of Autopac
    3. Re:Thats not true by Sancho · · Score: 3, Insightful

      Let me interpret for the original poster:

      If you have a tree who's root is the current board position and the leaves are all "mate" or "draw" positions (where the mates give you the game) then it certainly WOULD be possible to force a draw or win for yourself in every game. Starting from some arbitrary board position, of course you couldn't, because there are then board positions which will not/can not happen. But FROM THE BEGINNING, a program could enumerate every possible move, and eliminate those which end in its loss.

      Now, that said, it's not true that from a given board position, there is any move that will guarantee a loss. In some positions this is true, but not for any given position (take the first move of the game, for example. Presumably you can win no matter what first move you make.) The early game would likely need to be a series of moves to bring you to a board position in which the rest of the game is deterministic based on the tree. This is because eliminating all initial moves that can result in a loss will eliminate all initial moves.

      Getting to that deterministic position is not guaranteed, either. If it was, the entire match would be deterministic based on the computer player's moves. So there would still be strategy involved. But the computer could still look ahead to prevent moves that result in mate (for example, the 4 move mate that's such a common ploy against new players). And in doing so, it could look for ways to get to a board position that's in its lookup table.

    4. Re:Thats not true by Kintanon · · Score: 2

      Your opponent can ALWAYS create a board position that involves a loss for you unless you are forcing them to make moves. That is where the control aspect of chess comes in, if you can force your opponent to make one or two moves that change the board to your favor you will almost invariably win. Starting from the beginning you can't force moves. There is no way to force a move on your opponents part before move 6. And that's only if you spend your three moves sending your knight on a suicide mission to split the king/rook. It's a waste of moves. The best you can do is position your own pieces in such a fashion that a win for you is a probably outcome. Your opponent can still disrupt your formations, even if you have pefect knowledge of the moves. Every formation has a weakness, and if your opponent has perfect knowledge as well, the game will always be a draw.

      Kintanon

      --
      Check out JoshJitsu.info for Brazilian Ji
    5. Re:Thats not true by MWright · · Score: 2
      We don't have to force a specific move, as long as for any move that they make, we can revert the board to a "winning position" in our turn (where a winning position is one in which it is possible to force a win. Obviously, if every possible move the opponent makes puts you in a situation where a win can be forced, then the current position is also a winning position). At the beginning of the game, either one player will be in a winning position, or it's always possible to force a tie (as it is in tic-tac-toe).


      A winning strategy is not "play this, then play that, and then that"; rather, it is "play this; if your opponent does this, do that, if they do something else, do something else, etc." Of course, a tree of moves like this, for a game as complex as chess, is big enough that I can quite safely state that chess will never be solved, unless some new laws of physics are found.

      --
      "But really, I think life is just a game of Mao Nomic." -Purplebob
    6. Re:Thats not true by HanzoSan · · Score: 2

      In chess, the first person to lose control of the board, loses the game most of the time when the game is between two very good players.

      A chess program no matter how good it can possibly be, cant get its way all of the time, when the position swings in your favor, you have the chance to win, when it swings in the machines favor the machine has the chance to win.

      Machines are good with calculations, machines are bad with switching the board in their favor.

      To beat most machines you have to be like an enforcer, you set the pace, you keep attacking, you litterally pound it into submission keeping it on defense all game until you checkmate it.

      IF the machine gains control even once, it can calculate a checkmate

      --
      If you use Linux, please help development of Autopac
    7. Re:Thats not true by cburley · · Score: 1
      In chess, the first person to lose control of the board, loses the game most of the time when the game is between two very good players.

      Indeed, but given a player that can fully enumerate all possible branches, there is simply no issue of "control of the board" for that player (assuming that you don't mean, by that, "has the next move", rather, something less precisely defined than move-making in chess). It is, assuming the player is "programmed" correctly, merely an issue of choosing, based on a given board position (pieces plus state information regarding castling and such), a move that leads to only win/draw results for that player for as long as that player can choose his moves (i.e., for as long as the rules of play are in effect).

      Your statements about chess apply to the present, real-world situation where this is theoretically possible, but computationally impossible, or believed to be so.

      Put another way: I am a terrible chess player. But given a computer whose hardware is capable of analyzing, say, 30 moves beyond a given position, and an initial chess position that is "balanced" and yet guarantees a win or draw for "my" side within 30 moves, I can, as a mere programmer, program that computer to avoid the moves that would lead to a loss against anyone, including yourself, "control of the board" being made irrelevant.

      In this sense, chess indeed being a game of "perfect information", unlike, say, "Battleship", discussing the capability of a theoretically infinitely-powered Turing machine (that is, a "computer", a deterministic computing machine) playing chess is akin to discussing solving the Traveling Salesman Problem (TSP) -- for any given problem size, a solution can be assuredly found, it's mainly a question of whether we can actually, yet, build a machine that has the speed and memory to do it.

      (And the answer to both questions is presently "no", constraints such as the size and longevity of the universe being as we presently understand them.)

      Though I haven't looked at it yet, I assume GNU Chess is an example of a computer program worth looking at if you want to learn a bit about how computers play chess, including how they "limit" themselves to accommodate real-world limitations on time and memory. It comes free with source code, so, even if not the "best" chess player available for general-purpose computers these days, it might be more instructive than better programs that come as "black boxes", i.e. without source code.

      Oh, the other interesting thing about all this is: from a computational perspective, your phrase "control of the board" is probably insufficiently precise. That is, you can't precisely define what you mean by it. To the extent you can, you can program a computer to seek it out, and that is of what most of the effort put into programming computers to play chess well consists -- mere move-computing and such being the "easy part" (or so I assume, since it'd be the easy part for me).

      In that sense, defining "control of the board" to a given degree of precision can make the difference between winning and losing against an opponent that has its own degree of precision in understanding that phrase. (I'm assuming the accuracy of these definitions within their limits of precision.)

      --
      Practice random senselessness and act kind of beautiful.
    8. Re:Thats not true by HanzoSan · · Score: 2


      Thats my point, computers dont understand that position is the most important aspect of chess.

      Not tactics, not calculations, and problem solving.

      You can teach a computer to be perfect with problem solving and calculations, but to teach a computer to recognize good positions, and understand the flow of the board, thats VERY difficult.

      --
      If you use Linux, please help development of Autopac
    9. Re:Thats not true by cburley · · Score: 1
      position is the most important aspect of chess.

      Well, I'd say second-most -- surely it's secondary to being able to checkmate your opponent (or at least secure a draw) in N moves, assuming you can prove that capability.

      You can teach a computer to be perfect with problem solving and calculations, but to teach a computer to recognize good positions, and understand the flow of the board, thats VERY difficult.

      And here you touch on the crux of the context of this debate. You're not talking with a bunch of chess experts.

      You're talking with a bunch of geeks who are, if they're anything like me (and I'm guessing they are), inherently lazy and quite confident in the power of their tools -- specifically, computers.

      If someone wants to explore the ins and outs of "mystical" issues like the "flow of the game" of chess, or board position/control, they'll surely seek forums other than /. -- chess-specific forums.

      Even if they want to focus on computer learning as it applies to these issues -- also called "Artificial Intelligence" -- they'll probably choose to "live" somewhere other than /..

      So, what you're left with are people who, confronted with the vast complexity of the "mere game" of chess -- "mere" in the sense that it has a very limited playing space, limited piece selection, limited movement, no random elements, etc. -- are much more likely to look for ways to "win" that don't involve actually having to devote decades of deep thought to the problem.

      Instead, they'd rather consider how much easier the problem becomes once computing power reaches the point where all they need to do is type in the fundamental rules of chess (valid moves and such; not stuff like piece "values" though), glue on a few lines of Perl code, and be assured that the result will never lose.

      And, it really is a SMOP -- "Small Matter of Programming" -- because chess is, basically, a game that allows for fairly easy programming of an automaton that cannot lose. (This is assuming that the game does not inherently put either player in a position where the opponent can force that player to lose, which most people believe, but, I gather from comments on this article, has not been proven.)

      However, unlike other "classic" SMOPs, the challenge with chess, for geeks like us, is that the resources consumed by a straightforward automaton are projected to exceed that of the known universe. ("Classic" SMOPs tend to be difficult to program, but not necessarily resource-intensive once they're programmed, I believe.)

      But we're hardy folk! Rather than admit defeat in the face of limited time, energy, and space in the universe and going on to attack the "problem" the way most everyone in the "real world" has by simply learning the game and becoming grand masters over a period of decades, we ask ourselves "is there some magic bullet that'll solve the problem of finite resources before we complete such an undertaking ourselves?". After all, we'd much rather play games and muck with other fun stuff than actually master just one game like chess.

      Hence the excess of discussions here (compared to, I expect, typical forums on actually playing chess) invoking quantum-based computing, multiple universes, algorithm-based solutions, AI, and other still-mythical magical bullets.

      In such discussions, there is, as you've discovered, little point in explaining that a player must learn "board position", "board control", "the flow of the game", whether that player is man or machine -- the people you're talking with have already considered that option and chosen to dump it. We do so for at least one good reason: the complexity of the "rule base" (in the expert-system sense) for doing well at chess presently vastly exceeds that of the "rule base" for playing the game correctly (that is, making valid, if not winning, moves). Further, the rule base of the former is ill-defined, and any version of it is likely to have bugs that are as easy to expose as the fatal flaw of the Death Star in the "Star Wars" movie(s), whereas the rule base of the latter is, presumably, rock-solid.

      So we hold out hope that we can find some other set of rules that, in combination with increased computing power, will have a correctness/complexity ratio sufficiently in excess of that of the rule base of the sort you real players of chess must keep in mind that we can be assured of not losing to you anytime we play (with the assistance of our machines).

      And while chess is still "out of reach" as far as this goes, compared to, say, tic-tac-toe (which a properly-programmed automaton will never lose at), it should be pretty easy to create a "simplified" form of chess that can be shown to be "perfectly playable" -- not losable -- by a present-day automaton. (Limit the size of the board and piece selection further, don't permit cycles, maybe a few other forms of reduction.) Playing that form of chess, there'll be no need for an automaton to care about board position or control, or the flow of the game -- that is, there'll be no code to do so in the automaton, though an observer might think there is -- it'll simply avoid losing every time, and, against many humans, it'll win most of the time.

      In short, we're not interested in winning chess games. We're fascinated by the possibility of creating an automaton that can play for us and never lose, giving us that special quality that attracts not only chess groupies, but groupies from all the other similar sorts of games (Go, for example) that our automatons presumably would also excel at playing.

      ;-)

      --
      Practice random senselessness and act kind of beautiful.
    10. Re:Thats not true by HanzoSan · · Score: 2

      By the flow of the game I mean, depending on the squares your peices are on decides the possible moves the opponent has.

      If you have your peices on all the best squares with the best angles of attack, no matter if your opponnent is deep blue, fritz or the most powerful computer ever created, its still not going to have any GOOD moves to choose from, all the moves will be a choice between which bad move they want to make.

      --
      If you use Linux, please help development of Autopac
    11. Re:Thats not true by cburley · · Score: 1
      By the flow of the game I mean, depending on the squares your peices are on decides the possible moves the opponent has.

      Oh, okay...I thought you meant something like, the collected "experience" the players gained, regarding each other's methods of attack and defense, based on moves earlier in the game.

      If you have your peices on all the best squares with the best angles of attack

      Well, yeah, the problem for someone like me being, how do I get into such a position in the first place?

      Not having a brain capable of reliably performing that task, it's fun to think (fantasize?) about slam-dunking the problem via computer.

      ;-)

      --
      Practice random senselessness and act kind of beautiful.
    12. Re:Thats not true by HanzoSan · · Score: 2

      Practice.

      Your brain ic capable. You just need to play chess more often.

      --
      If you use Linux, please help development of Autopac
  40. For chess players here by HanzoSan · · Score: 2


    Any chess players here who want to play chess online.

    http://chessline.cjb.net Play on Chessline

    --
    If you use Linux, please help development of Autopac
  41. my ipaq... by crzdcowboy · · Score: 1

    i'm pretty decent at playing chess. i can beat my friend's palmpilot anyday. my ipaq, on the other hand, is a completely different story. my ipaq on "easiest" can crush me. i have played ~100 games against it, and i STILL cant even pull off a stalemate!

    i guess its 206 MHz risc processor is just too much machine for me....even on "easy".

    oh, btw, "easy" means that it spends 1 second per move on computations.

    1. Re:my ipaq... by smylie · · Score: 1

      just out of curiosity, what chess program for the ipaq are you using? I'm using PocketChess and even on easiest I've only ever beaten it twice . . .

  42. "Computers Can't Play Chess" by Tim Krabbe by iskander · · Score: 1

    I thought chess fans might be interested in Tim Krabbé's site, in which he talks about things like chess playing programs taking part in tournaments and chess players having to pee into a cup in order to be considered sportsmen worthy of participation in the olympic games. Most importantly in the context of this dicussion, he talks about computers playing bad chess in Defending Humanity's Honor . I wonder if it's time to add that "Nemeth Gambit" to our repertoire.

    1. Re:"Computers Can't Play Chess" by Tim Krabbe by Skuto · · Score: 1

      Unfortunately, it will work only once. Any recent computer has book learning and will avoid the opening next time. Also, take into account Nemeth _takes back_ moves until he gets a winning position. That is, by all means, cheating.

      The trojan horse attack he mentions is useless nowadays; the programs are either programmed to understand or avoid it.

      --
      GCP

  43. Re:Chess programs demonstrate we don't know anythi by Xyonz · · Score: 2, Interesting

    I think the answer here is that humans are writing these chess programs, and therefore they are limited bu the restraints of human thought. A freight locomotive on the other hand is only constricted by the laws of physics.

  44. Opening books and Table bases by Anonymous Coward · · Score: 0

    it seems that most people here don't seem to understand why computers are capable of playing chess at the level that they do. computers have the advantage of both opening books and table bases that have every possible position with 6 or less pieces on the board. if you take away those away all you have left is a fancy calculator that begins to over heat as it gets trashed. computers have no understanding of the principals that even the lowliest club player has. take a look at some of the recent man vs machine games which are going on now! look over the games , excellent openings and brilliant endgames but planning in the middle game???

  45. If you are interested in this subject by jsse · · Score: 2

    You might want to read this: Quantum Theory and Human Consciousness

    Quote:
    What about future evolution? Will consciousness occur in computers? The advent of quantum computers opens the possibility. However, as presently envisioned, quantum computers will have insufficient mass in superposition (e.g., electrons) to reach the threshold for objective reduction due to environmental decoherence. Still, future generations of quantum computers may be able to realize this goal.

    1. Re:If you are interested in this subject by Anonymous Coward · · Score: 0

      I am tired of all this crap of Quantum Theory and Human Consciousness. I don't understand why people follow the crazy ideas of Roger Penrose, when they are so obviously flawed.

      The question "Will consciousness occur in computers?" doesn't make a lot of sense as long as you don't have a good definition of consciousness. And mixing Quantum Theory into the matter doesn't bring any light. It's only good for fooling people with sofisticated words.

  46. A very real problem by admiral-v · · Score: 2, Informative

    Determining whether a player is a human or a computer is a very real problem that has been researched extensively.
    Take the Internet Chess Club, for example. If you ever wanted to watch grandmasters play live, or even play against one, that's where you go. They offer a 7-day free trial (actually, it's 14 because you can extend your trial for another 7 days). Anyway, computer assistance is the most problematic form of abuse on the service. Normally, if you're going to be using a computer chess program to assist you while playing, you are required to create a "computer account". The ICC allows computer players on their service because it provides an inexhaustible source of very strong opponents. In fact, if you log on and take a look at the highest rated players, you might be surprised to find a long list of computers before a single grandmaster. Keep in mind, though, that we're talking about playing conditions very different from the famous Kasparov Vs. Deep Blue Games. The computers on ICC have extraordinarily high ratings due to the very fast time controls (most common are either 1 or 5 minutes per player per game), and the rating boost they get from all the games they win against weaker players--after all, they're practically playing 24 hours a day!
    Now, I have no idea how many players are cheating by using a computer chess program, but I bet that many have. Imagine playing a game against a high rated opponent--meaning that, if you win, you'll gain a load of rating points--and having a grandmaster strength player at your disposal. Wouldn't you be tempted to ask for hints every once in a while;)?
    The ICC has released a statement regarding dishonest computer assistance. In it they explain that they have a program that analyizes games to detect computer-like play. Of course, they protect the details of how the system works to prevent anybody from disguising their abuse. Also, they have chat-bot online all the time to whome you report any suspected cheating. Although, I imagine the majority of those reports are from unskilled players like myself after losing to a pro;)

  47. $10.000 bet by Jhan · · Score: 1

    Back in 1988, I bought Chess Master 2000 for the Amiga as a present to my father.

    I played it quite a lot of times, and became very impressed. So, I made a bet with my father for $10.000 (no less), that by New Years Eve 2000, a computer program would beat the current human world champion of chess, using tournament rules.

    I haven't reminded him of the bet (yet)... After all, I make lots more money than he does, don't want to impoverish the dear old guy :-)

    Conclusion: The age of human chess is near its end. It will fall before the might of brute force calculation, just as Nine Men's Morris did in 1996 (spoiler: the game is a draw). Maybe we feeble humans should learn to concentrate on the things we do well. Such as anything having to do with emotions and pleasure.

    --

    I choose to remain celibate, like my father and his father before him.

  48. Isn't this old news? by Anonymous Coward · · Score: 0

    I think the article might be a year old. The Kramnik vs. Deep Fritz match was supposed to occur in October 2001, but 9/11 caused it to be "delayed". I tried (months ago) to track down the reschedule date, but I have not found anything definite.

    Slashdot also ran a previous story on the Kramnik vs. Deep Fritz match approx nine months ago (I think).

  49. Re:Grandmasters can tell computers and humans apar by handsomepete · · Score: 1

    I could've sworn that there was a real primitive 8086 chess simulator back in the day that had various strategies of various champion chess players programmed in and it would stick to whatever player's philosophy you chose. It was crude and predictable, but it may have been on the right track...

    ..but I could be wrong.

  50. Fritz7 vs. Deep Blue by terradyn · · Score: 1

    Take Kramnik's comments on how Fritz can beat Deep Blue with a grain of salt. The program obviously has a neural network component to it and since the time of Deep Blue, many computer chess scientists have had the ability to analyze and disect that particular game played by Kasperov and Deep Blue. Of course they will find better ways to handle that particular game with so much time spent analyzing it. It doesn't not imply that Fritz7 is better than Deep Blue because we don't know how Deep Blue would play out other games. Sadly we will never know.

    "Deep Blue has only played twelve games in two years against one single opponent. As such, it is impossible to tell how strong it is or what it is capable of." - Vishwanathan Anand

  51. MAN vs PUPPET by jackb_guppy · · Score: 1

    When two people play - normal method of play is find a weakness and explote it. For a master is offer a weakness as a trap.

    With Man vs Machine, the machine can use that same trick. Offer a weakness allow the human to attact it, and then close the box and kill.

    But with BLUE - the weakness where real, the programmers seeing the weakness, and corrected program. Making weakness into a trap (or at least not a weakness anymore). In estances BLUE was cheating by getting outside help.

    So the best we can say about the event -- the hamun was debugging the software. There was no Man vs Machine Match.

  52. Combinatorics by Macrobat · · Score: 2
    I've always found that combinatoric argument in favor of Go a bit spurious. It ignores the possibility that certain patterns in Go may be (may be--I'm no expert in either game) more easily generalizable than patterns in Chess, therefore cutting down massively on the search space. All of Go's pieces are exactly the same; you simply don't have considerations like trading of a bishop vs. knight (the bishop has longer range, but can only attack pieces on one color square; the knight doesn't have as long a reach, but can jump over its own side's pieces).

    And, as far as depth goes, some of Chess's master combinations have gone as far as twenty-six moves deep, during the first half of which it appears as though one side is winning, but which turn the situation around by the end. (I'm thinking of one of Alekhine's games in particular, but I'm not at home where I can check my books.) So there's no generalized way of telling how many moves deep you'll have to search until you can evaluate a move.

    Also, Chess's maximum branching factor isn't 32. Each piece, of which there are a maximum of 32 on the board, has a minimum of 0, and up to 27 (for a queen with clear lines to the edges). The maximum branching factor has to be recalculated for every move (although I suppose there's a theoretical "most free position," but I don't know it).

    All in all, IIRC, the number of possible Chess games is greater than the number of particles in the known universe, so even if that number is fewer than Go's, it's not like it'll ever be a "trivial" exercise computing them--it won't ever happen.

    --
    "Hardly used" will not fetch you a better price for your brain.
    1. Re:Combinatorics by heikkile · · Score: 2
      Well, there may be some ways to short circuit the combinatorics of go, (although I suspect they won't be giving you much), but go has another, serious problem: There is no easy way to evaluate a position. In chess you can get a first order approximation just by counting pieces, and maybe some other simple numbers, but in go, such measures are almost worthless. Minor changes in the configurations of the pieces will quickly turn an asset into a liability. So, even if you could look 50 moves ahead in no time, you could not use that for anything, because you could not evaluate the relative values of the positions.

      Even evaluating positions where human players have stopped playing because the result is obvious, is not a trivial task. It may still require a few local analyses some 20-40 moves deep. Getting any of them wrong will gove you a totally wrong picture of the situation. Things get even more complex in the middle of the game...

      And the combinatorics still stand. You mention human chess players going 26 moves deep - even fairly inexperienced go players read local sequences ("ladders") to 20 moves. Complex life and death situations requirte about as deep reading, and that is just one part of the situation - often there are several on the board, with subtle interactions...

      If you don't believe me, consider the fact that there are very few people who can claim to beat a computer in chess - but most club players beat any go program available today. I believe I could teach a motivated but inexperienced student to beat any go program within a month of full-time work. And I am not that good... (5 kyu in Denmark)

      --

      In Murphy We Turst

  53. Internet Chess Orgy by Tom7 · · Score: 5, Interesting

    Forget playing against a computer and losing all the time. At SICO we're on the opposite end of the spectrum -- you can play against thousands of idiots all around the world. Tired of the same old boring pieces? Well, we've got new pieces too. In fact, since you lead such a busy life, you don't even have to play a whole game! Just play a single move, and back to work!

    1. Re:Internet Chess Orgy by Anonymous Coward · · Score: 0

      Tom7! Great to see you! Lap and I are well and miss you!

      DS

  54. Re:Grandmasters can tell computers and humans apar by Anonymous Coward · · Score: 0

    You are an idiot. Take a class on AI or read a book. Have you ever heard of game trees? You would not be able to discern the computer following differnet paths that had been layed out in the game tree and a human plan, because they come out to be pretty much the same. But you are still an idiot.

  55. Fuck Chess, can a machine play Quake? by gelfling · · Score: 2

    Chess: the epitome of logic, reason, thought blabbidy blabbidy blah blah.

    When a machine can play deathmatch then I'll be impressed.

    1. Re:Fuck Chess, can a machine play Quake? by Anonymous Coward · · Score: 0

      Machines can play quake, duh. Ever hear of bots?

  56. Re:Chess programs demonstrate we don't know anythi by lkaos · · Score: 2

    You would expect that since, say, 1980 or so, when numerical calculating power greatly in excess of the human brain became available (and I set it at 1980, not 1960-70, just to be conservative)

    Hold your horses there pal. Give a little respect where its due. The human brain is far more powerful than any piece of hardware out there.

    Consider the fact that the brain processes two seperate high resolution images and generates depth by comparing them in real-time 12-16 hours a day, plus stores a large portion (some argue all) of the incoming images. The difference between brains and computers are that computers can be programmed much faster than a brain (at least, in a direct means). There are mathemagicians out there that can crunch numbers just as fast as any computer can.

    The flaw in your reasoning is that computers are not superior to the human brain, for now at least.

    --
    int func(int a);
    func((b += 3, b));
  57. Chess Computers will eventualy be invincible. by Forge · · Score: 2

    That is a simple statement of logical fact. You see a chess board is is a geometric pattern and all 32 pices have pre difined abilities.

    This quite simply makes chess a finite subject. Large and complex yess. But still finite. What this means is that eventualy we will be able to build a computer that can analize every chess move all the way to the eventual end of the game in order to NEVER make a move that can result in it lusing the game.

    This is how computer tic-tac-toe players work now and a checkers computer can be built along these lines too. Sometime before desktops are as powerful as ASCII White This WILL hapen.

    --
    --= Isn't it surprising how badly I spell ?
    1. Re:Chess Computers will eventualy be invincible. by Anonymous Coward · · Score: 0

      Nope, far too many computations to ever become a possibility.

    2. Re:Chess Computers will eventualy be invincible. by Forge · · Score: 2

      I am asuming more's law has more exponential years ahead :).

      "Never Say Never" -: Ian Fleming (James Bond.)

      --
      --= Isn't it surprising how badly I spell ?
    3. Re:Chess Computers will eventualy be invincible. by Anonymous Coward · · Score: 0

      It'll have to exponent for a long damned time.

      It's been calculated that the entire universe, stuffed with subatomic particle-sized circuits, running for the entire age of the universe, could not come anywhere near to a perfect game of chess.

    4. Re:Chess Computers will eventualy be invincible. by Isofarro · · Score: 1

      This quite simply makes chess a finite subject. Large and complex yess. But still finite. What this means is that eventualy we will be able to build a computer that can analize every chess move all the way to the eventual end of the game in order to NEVER make a move that can result in it lusing the game.

      Analysing every chess move is inefficient, since quite a number of them would transpose into already seen positions. As a result the number of positions would be smaller than the total number of chess moves in every position. Now considering that the number of possible chess positions is more than the number of atoms in the universe, you are going to need a rather unique storage method that can store millions of positions per individual atom to come close to completely solving chess.

      So you are going to have to trim corners somewhere. Where? Take those positions that are unlikely to occur - how do you figure that out? By evaluating each position, which again would require you to analyse every single position.

      Chess is a mathematical nightmare. Complete 6 piece endgames already require over 4Gb of storage - how much would a 32 piece endgame cost in comparison?

      Yes, chess will be solved. But not in our lifetimes, and possibly by a non-human civilisation.

    5. Re:Chess Computers will eventualy be invincible. by Forge · · Score: 1

      I'd like to see those equations.

      however. There is a simpler method. Don't analise positions.

      Instead you should just analise the moves and where you would end up with a given sequence of moves. Already some chess programs work by calculating which moves will leave it in the best position 6 moves latter or 10 moves latter.

      Those programs are beaten by grandmasters who can make moves which will put them in what looks like a bad position 6 moves latter but don't anymore after 12 moves.

      A perfect chess computer would see farther than the best grandmaster. Of course this may mean it will nead to see all the posible moves from that point to the ethe game.

      The curent champion may beat the curent software champ. However I wouldn't bet oin that hapening again in 5 years.

      Of course I may be wrong and we may see a white heaviweght boxing champ this year too.

      --
      --= Isn't it surprising how badly I spell ?
  58. Re:Chess programs demonstrate we don't know anythi by wmspringer · · Score: 0

    >That any human can still defeat chess programs tells us that humans must be playing chess in some way >fundamentally different from the numerical calculations and search algorithms used by the programs. Or, it tells us that those humans must know something about the game that the programmers don't :-)

  59. Solving Chess by miracle69 · · Score: 2

    Given an infinite amount of processing power and memory, could someone "solve" the game of chess?

    The obvious answer is yes...

    As for the practical answer, maybe... It will largely depend upon quantum computers. If you've been here a while, you might remember this story . Sometimes it's good to revisit old friends.

    Or, I could just resubmit the story and watch it get on the main page. It's not like that's never happened before.. ;)

    --
    Linux - Because Mommy taught me to Share.
  60. Blah, how could he be world champ? by Anonymous Coward · · Score: 0
    Everybody knows Bobby Fischer is the world champ! He's the greatest ever!

    Of course there's that Ponomorev guy who got schooled big time last month by that Chinese girl, so either of them could claim to be world champ too.

    But then there's the almighty Kasparov who schools everybody, including Kramnik and Ponmorov in tournaments.

    So in conclusion, I should be world champ! I know how to move a horsey.

    1. Re:Blah, how could he be world champ? by Anonymous Coward · · Score: 0

      Kick ass! This post is not only at the bottom of
      the first page (if you browse at -1), but also the top
      of the second page. This is even cooler than getting
      the first post!

  61. Re:Chess programs demonstrate we don't know anythi by hdparm · · Score: 1
    That any human can still defeat chess programs tells us that humans must be playing chess in some way fundamentally different from the numerical calculations and search algorithms used by the programs. And I don't think anyone has even come close to describing how this occurs.

    I am pretty sure that the answer to (at least part of) this question is human ability to feel and act based on the feelings. Very short description of emotional intelligence.

    Unlike computers, humans are very aware of their environment and the influence that environment produces. Sometimes, humans respond to it consciously, sometimes sub-consciously but they (we) always respond in some way.

    How does this apply to chess? I do not exactly know but my experience (I used to play chess actively for my school and later my company's team, often facing ranked players, 2 grandmasters amongst them) is that emotions pick up when you sit against the player of the similar or better skill. Now, I don't want to compare myself with any of the real chess players, particularly not grandmasters but despite the fact they've been trained very close to perfection, they are still humans, thus emotional creatures. Their emotions show up when playing against each other and the winner is the one who better controls those emotions, since skills are pretty much leveled.

    I'd like to think that proper, positive chanelling of emotions is very much connected to creativity and that this is what makes a difference in the human vs computer game. Otherwise, there's just no logical explanation as to how can any human beat a computer as powerful as Deep Blue or Fritz.

    As a side note (for curious crowd) - I managed a draw against one of those two grandmasters and am very proud of it!

  62. Quantum computing to solve the game ? by Anonymous Coward · · Score: 0

    Is it possible to use quantum computing to create software which instantly delivers the "perfect" move ?

  63. Why the best GM's will always come out on top. by Self-Important · · Score: 1

    I have been a USCF "A" player (very strong amateur two levels below master) since the age of twelve. I have studied the game for countless hours. But most importantly, I have studied the games played between Kasparov and Deep Blue during both matches.

    In both instances, they were filled with what are commonly called "computer moves"--pointless rook maneuvers or pawn advances that make no sense from a positional or strategical standpoint--moves that no human player would ever play.

    While Fritz 7 will be able to tell you if there's a hypothetical knight fork waiting for it fifteen moves later, it still cannot make moves based on a consistent, cogent, long-term strategy, nor can any computer chess program.

    "Is that exchange useful because that extra pawn on the kingside can become passed 40 moves later in the endgame?" I could tell you easily, but a chess program could not.

    All of these computer programs are mired in the "this position equates to a numerical value of x" alogrithmic model. This is useful for making good, immediate moves, but means that the strength of the program is still limited by the accuracy of its numerical assignments and its move lookahead--two things that are not only finite, but predicatable as well.

    It's a lot like humans vs. agents in The Matrix. Trust me, I'd take the positionally-grounded Grandmaster player any day of the week.

  64. The 10% of the brain fallicy by benwaggoner · · Score: 2

    If you're implying that we only use some percentage of our brain, than you're repeating one of the most long-lived and completely erroneous memes of popular neuroscience.

    The regions of our brain are rather specialized. So while each part gets used some of the time, we don't use all of it all the time. About the only time where all the brain is active at once is in a seizure, which certainly doesn't help chess playing at all.

    Given the massive evolutionary sacrifices required for our big brains (painful, dangerous labor and extremely dependent infants compared to other animals), there was clearly a correspondingly strong evolutionary pressure for big brains. If it was possible to have done it with only 10% of the volume, we'd either have much smaller heads, or be a heck of a lot smarter.

    The Snopes page is quite informative:

  65. Re:Grandmasters can tell computers and humans apar by Anonymous Coward · · Score: 0
    If you reread some of the commentary and his comments during and shortly after the match it was very clear that was one of the reasons he lost. It was well documented.


    Deep thought was a very specialized project with a grandmaster used in the programming that was made from the start to beat the best humans in the world. It made some questionable moves that confused him as either very brilliant or extremely bizzare moves for a computer to make. That was the game, his confidence was shot and he was beat. He couldn't tell if it was a trap or if it was just a random attack. Arguably that is the measure of the achievment, he wasn't beat by calculation so much as caluclation and the psychological blow that a few traps had. He was tricked in to thinking the wrong thing and it broke him. I tend to agree with him, it will be amazing if Fritz wins, the software just hasn't gotten good enough and it won't have nearly as many cycles to burn.


    You're right. Playing chess isn't really a good definition of intelligence. There are a lot of nuances and a lot of psychology and intuition involved that makes it an interesting game, particularly with computers. It's clear from the Kasparov match though that the end is near. This Fritz match is really just an ego thing.

  66. Top grandmasters vs computers by FFriedel · · Score: 2, Informative

    Currently the world's number 15 human, Ilya Smirin, is playing against four of the world's top programs (info). He is well acquainted with the style of computer play, understands the strengths and weaknesses of the machines and prepared carefully for this match. In most of the games he has outplayed the programs, but is only one point ahead in the seven games played so far.

    Tomorrow (Sunday) is the last game of the series. One has to be repeated after a very unusual incident: Deep Junior was winning but the Internet connection broke down and the computer could not process Smirin's move. So the operator offered him a draw. Smirin refused, saying he did not deserve to share the point. Instead he offered to resign. The Junior team refused because the program had not demonstrated the win. So they decided to repeat the game (info).

  67. Re:Chess programs demonstrate we don't know anythi by leodegan · · Score: 1

    I agree. It is very difficult to make comparisons to the brain and computer because they are fundamentally different. How do you compare intelligence between the two? You can't.

    Computer intelligence is based on the ability to process information and make calculations. Human intelligence is largely based on pattern recognition.

    That which is very easy for a computer (multiplying 385489395 and 28499292 for example) is very difficult for a human. A computer can accomplish this very quickly using a very simple algorithm.

    On the other hand, that which is very easy for humans, is very difficult for computers. A person's ability to recognize what a child's drawing represents does not require concious thought and is very simple for that person. A computer program that could do this on a regular basis would truly be impressive.

  68. Um, Kasparov himself says Kramnik is the champion by splorf · · Score: 1
    Kramnik and Kasparov played a match for the championship and Kasparov lost, so Kramnik is the champion. Kasparov himself says so and refers to Kramnik as the champion. It's like the world series in baseball--whoever wins it is the champ, even if the other team really is better in some objective sense. All the losing team can do is try again next year.

    Kasparov pretty clearly wasn't playing at his best during the Kramnik match and Kasparov said afterwards that he expected to get a rematch and win the championship back. I agree and my money would be on Kasparov in such a rematch, though Kramnik is definitely no slouch, and anything could happen.

    The thing about Kasparov ducking out of the Dortmund cycle is new to me (I haven't been following this stuff closely). I wonder if Kasparov is just sick of chess. He often has shown signs of that in recent years.

  69. It is not possible... by Lethyos · · Score: 2

    A computer stores data by the arrangement of electrons in matter. Since the state space of Chess is huge (the number of atoms in the universe), it would take that many atoms to store the state space. A computer that can store the entire space would have to be the size of the universe (or insanely dense). It may be possible with quantum computers (T&&F==T||F ;), but I can't begin to comment on that.

    --
    Why bother.
  70. Pay no attention to the man behind the curtain by Latent+Heat · · Score: 1
    One approach to AI is indeed brute force whatever -- searches, tables, enumerations. If brute force does the job, so be it, and some may argue that the many parallel execution units (neurons) of the human brain are indeed brute force and intelligence is an illusion.

    Kasparov beat Deep Blue by scoping out Deep Blues patterns of play -- Kasparov has the makings of a really, really good computer programmer. What happened next is that the IBM team tweaked Deep Blue and Kasparov lost.

    Kasparov cried foul because he claimed that the IBM programmers were scoping his patterns out and adjusting Deep Blue accordingly.

    He has a point, and it goes to the scientific integrity of claims of performance in many AI tasks. "Oh, the thing failed, we need to adjust the decision threshold here to get that case to work." Are the programmers really correcting bugs or are the programmers really playing Kasparov, of course aided by a really fast calculator because Kasparov is better at figuring out stuff in his head?

    It had been suggested to me that true AI will be here if Deep Blue is able to adapt/learn/tune/tweak by itself without the programmers doing anything, perhaps losing initially but getting better with time.

  71. How it works by br00tus · · Score: 1

    I am a chess player and programmer, although I would not brag about my ability in either. Fritz and Deep Blue are interesting chess programs, but I am more interested in Crafty, which is one of the highest rated chess programs, and which is open source as well - I can look at the source code and look at what it is doing. In fact, the commercial Fritz package has two parts - an engine and what is designed around the engine. You can switch the Crafty engine with the Fritz engine and analyze positions and the like using both engines - something I often do.

    To understand humans versus computer chess playing, you have to understand that at higher levels of playing ability, chess is broken down into three parts - opening, middle game and end game.

    The computer's greatest strength lies in it's *perfect* end game ability. Here the computer is indisputably the master, it never makes a mistake. In fact, they have been pushing this backwards - first it played perfectly with 3 pieces on the board, then 4, then 5, and they keep going backwards and increasing that number.

    The computer's second greatest strength is in it's opening ability. Here the computer has the ability to play a perfect game as chess is currently known. It is able to analyze every chess game ever played and play the best game possible as chess is currently known. If the grandmaster it is playing against is very smart, the grandmaster can invent a chess innovation that has never been done before, or that has been done once or twice so long ago that everybody has forgotten about it, and even the computer ignores it. These innovations are one of the exciting things about grandmaster play, because grandmasters come up with new innovations in chess openings every year, some of them quite exciting and amazing. So if the grandmaster is smart enough to create an amazing chess opening innovation, he can win against opponents like Deeper Blue.

    I should also point out that certain openings are good for humans, and certain openings are good for computers. Openings which go into "open" games are good for computers because tactics is the greatest strength of computers. Openings which go into "closed" games are good for humans, because they are strategic, and strategy is one of the few weapons a human has against a Deeper Blue.

    Now we get into the important part, the middle game. As I said before, computers are becoming more and more the tactical masters of this arena, although humans still rule the domain of strategy. Although computer endings are still being expanded in the ending (first a perfect game with 3 pieces, then 4 pieces, then 5 pieces, then 6 pieces...) and in the beginning (always being updated with the latest matches, and some algorithms tweaked), the middle game is where the real work is being, and needs to be done to improve computer chess playing ability. In tactical terms, as algorithms are tweaked and processing power increases, computers are able to see farther and farther ahead in the game with a clearer and clearer view. Nonetheless, computers have problems with strategy and positional play - they can't see how much of a threat passed pawns are, which currently requires thinking, not evaluation. They also have other problems like a horizon effect, they don't see how their pieces can get trapped in a way that would be easily obvious to any grandmaster "thinking" about it.

    Many articles and books have been written on computer chess - how to program and improve computer chess programs and then how to beat them, and there are quite a few people who enjoy regularly beating the best chess programs out there on a regular basis. Grandmaster Yasser Seirawan, who makes a habit of beating chess computers, says that he believes even the best programs like Deeper Blue are inferior to the best grandmasters, and that only by psyching out opponents can computers win. Humans can make 30 excellent moves, and then get distracted and make a simple, stupid mistake on a move (a "blunder"). I've felt this myself - it is psychically challenging to stare at a chess board for over an hour with such intense concentration - if I was doing a programming problem and felt like this, I would get up and go get a glass of water and relax, but you can't do that in a times chess game. Computers always play at the same ability, they don't "get tired", and a very tired, distracted human who has a cold and is hungry will probably be playing at less than his highest potential and is apt to make blunders. Despite these human failings, we have the advantage of being able to get an axe and break Deep Blue into a million pieces, an advantage computers luckily don't have the ability to do to us (yet).

  72. Public relations? by kubrick · · Score: 2

    I think that qualifies as devolution. Are we not men? We are DEVO! :)

    --
    deus does not exist but if he does
  73. Bull by Anonymous Coward · · Score: 0

    "Grandmasters can in fact tell ... "

    Bull.

    This is a polite fiction we tell ourselves.

    In point of fact, when Kaspy got his ass handed to him by Big Blue, his initial response was to demand the readouts and other code because he suspected that another grandmaster (maybe Kramnik?) was feeding it moves.

    People -- don't be so generous with those "Insightful" points.

    1. Re:Bull by Tomaz · · Score: 1

      You are correct. But the slashdot community is too numerous - I guess. Too many 'ordinary people'.

  74. Link correction by Anonymous Coward · · Score: 0
  75. Even that would mean nothing by Gaurang · · Score: 1


    Back to chess, personally, I don't believe the human race has anything to worry about from a pride standpoint, if (when!) Fritz eventually triumphs over Kramnik. But when the world's top Go players are finally defeated, that will be a different story indeed...

    Even when the top Go players are defeated by machines, I dont consider that a big success of the machines.....
    We can just invent another game with even more complexity, and again, the machines will lag far behind.
    I believe that defeating humans in games like these....means nothing to AI.
    Games just involve tactically calculating positions, and thats all.
    What will be interesting....is when the machines are able to play any strategy game...without human help...and still defeat the human world champion.
    Such kind of research is being done...where the program develops its game from itself by using machine learning techniques like neural networks stuff....but so far, they havent been very successful.
    When such kind of machines rule strategy games, then I would say its a battle lost..., and we would rather let the computers take over...

    --
    I have found a solution to Riemann's Hypothesis, but have run out of spac
  76. Think Tic-Tac-Toe by Jayson · · Score: 2

    Yes, chess is solvable. It doesn't matter what the opponent does (however, it could be the case that the person who makes the first move always looses). If you think that the opponent being able to move changes this, then think about tic-tac-toe. That is another game that has perfect information where the opponent also has a choice to disrupt your plan, yet perfect play has already been demonstrated. Or you can think of connect-4, in this game the first person to move always wins.

  77. Connect 4 by Jayson · · Score: 2

    Connect 4 was not solved by any deep searching. It is mathematically solvable. You can look at a position and almost instantly tell what side will win. There is a small, finite set of rules that tell you who will win the game. I wrote this for the my second computer science class and absolutely destroyed the entire class, winning every single match with O(1) complexity for a move choice.

  78. GO by thinctwo · · Score: 1

    ok, to my understanding there is a tremendous monetary reward for a computer go program that can reliably beat a pro. if it were possible, someone would have claimed this money. im only ~9 kyu and can dominate just about any computerized go 'player'. the forked nature causes the computer's inability to respond, but ko and larger ko-like sequences add to the forked nature by creating whole new dimensions of forkedness. anyone whose tested (and beaten) many bots can confirm this; once you break a sequence back to where it was - to the same location on the 'tree' the computer cannot respond. chess, peh, lightweight. when a comp can beat a go master, well, thatll be the day.

  79. Combinatorics by NoOneInParticular · · Score: 1
    Ok, I'll bite. Your calculation (no quotes), calculates all valid position with 5 stones. These are the leafs in the search tree. You miss all positions of 4,3,2 and 1, all possible ways that you can reach the 5 stones position. Including those will get you to the 12 digit number I used.

    Why you need these position as well? Simple, we are placing stones successively here, and a mini-max strategy needs to evaluate these as well; some intermediate positions might be immediately losing, so they will be pruned.

  80. There was talk ... by Anonymous Coward · · Score: 0

    There was talk a year or so back in Europe about creating a distributed system a la seti@home with the objective of "Solving Chess".

    Never heard if it got off the ground, though.

  81. Re:Grandmasters can tell computers and humans apar by Mike+McTernan · · Score: 1

    Isn't it likely that most of the top chess players will have studied the way in which other grand masters play, and therefore top players can identify a computer opponent since it will have a style different to all other top players?

    i.e. the computer will stick out like the new kid in the playground?

    --
    -- Mike
  82. Re:Grandmasters can tell computers and humans apar by Anonymous Coward · · Score: 0

    Grandmasters claim they have no trouble in online chess rooms telling whether an opponent is a human or someone plugging in the moves from Chessmaster 8000.

    I guess you feel pretty dumb now, eh?

    As for game trees, that is exactly how they can tell the difference, and one of the primary ways human grandmasters use to defeat computers. Analyzing game trees leads to the "horizon effect", where there is no guarantee that what seems like a good path of 10 moves into the future doesn't turn bad suddenly on the 11th or 12th. Grandmasters take advantage of this to try to lead the computer into what seems like a fantastic path, but that turns bad somewhere after the depth search capability of the computer.

  83. Collosus by RobertBurrowes · · Score: 1


    So the top eschelons of chess will be played by machine...Deep Blue vs. Fritz.

    Armed, unmanned drones will fight wars in the sky and people will settle up afterwards.

    Pass the popcorn.

  84. Re:Chess programs demonstrate we don't know anythi by qubit64 · · Score: 1

    I don't think anyone is denying we know next to nothing about human intelligence. Also, your analogy of humans to computers and runners to locomotives is misleading at best. Propulsion systems (commonly used ones today at least) are far simpler to understand than computational systems. (maybe that's saying something about intelligence right there) There's also the question of whether or not the brain is a quantum computer (or whatever the natural version of that is), and though I admittedly don't know enough to argue either side of that, there are people who argue it is. (Not sure if there are many who argue it isn't)

    --
    "Save me jebus!" - Homer Simpson (btw, I'm probably talkin out of me arse)
  85. Advertiview by digitaltraveller · · Score: 1

    This "interview" is pretty self serving for ChessBase GmBh and Frederick Friedel, it's principal. It basically is structured around the theme of legitmizing Fritz as the leading chess engine (over Deep Blue - which has since been disassembled) with a bit of fluff on chess politics thrown in. Sigh - well, I guess it sells more copies of Fritz v7

    Check out chess interfaces eboard for gnome and knights for KDE. And don't forget to play on FICS

  86. I played Kramnik by Anonymous Coward · · Score: 0

    I played him 12 games and won all of them. The truth is, Kramnik only learned how to play chess last year and still gets confused as to how knights move.

    We're talking about Boris Kramnik, my 9-yr old cousin, right?

  87. Re:Grandmasters can tell computers and humans apar by Anonymous Coward · · Score: 0
    "My own belief is that the ability to play chess well, let alone the ability to play chess in the style of a particular grandmaster, is not an accurate or even adequate measure of intelligence"

    I am very bad at chess, so I guess it must be true!
  88. there is a point to that... by muchandr · · Score: 1

    You are indeed correct in that every two player zero-sum game has a 'solution' and a 'perfect strategy'. Theoretically. Solving chess as a matrix game is, however, not possible in practice due to its extreme size. If you had infinite processing power and memory, it'd be trivial though :)

  89. Next season finale of Lexx Plot revealed... by kesuki · · Score: 1

    As all the Lexx fanatics are aware, this seasons final episode involved the complete destruction of an alien vessel 2/3 the size of the earth into a piece of matter the size of a pea. This was done by calculating the exact mass of a higgs-boson particle using a 'portable' super colider.
    So perhaps the next finale for lexx should involve building a 1 KG device to 'solve' chess in half a second.

  90. Tic Tac Toe is like nuclear war... by Anonymous Coward · · Score: 0

    It is an unwinable game.
    This is why it is possible to create a computer that can't be beaten.
    Shame on you for not remembering "War Games".
    While it may possibly be determined at some point if Chess is an 'unwinable' game, at present time, it is beyond the scope of any programmer to design a chess program (to beat a chess master) that isn't (at least partially) based on known human strategies, that another human can develop a counter strategy to given enough time and assuming they are good enough.

  91. Heres an example of flow control in chess by HanzoSan · · Score: 2



    Say I want to put your peices on "BAD" squares. So I check your king early on, to force you to block check with a pawn, then i set up an exchange which puts two more pawns in the way or your bishop. I've just blocked your bishop from attacking giving me a peice advantage. Lets say i move more pawns forward and slowly take away spots your knight can move to.

    What you have here is no good moves to choose from, you've lost control of the game, all my peices are on the best squares while all your peices are trapped behind pawns and have poor angles, by using checks, timely exchanges, and etc, if planned right you can easily TRICK a computer into giving you control of the board.

    Let a simple exchange of peices can have the end result with my peice on a better square, a simple check can put your pawn on a square i want it to be on, a simple THREAT via my improved position can force you to move your peices to defend against it, i've effectively taken control of the board and you'll spend the entire game reacting to my every move struggling to fight your way out of checkmate, threats of checkmate, and trying to get your peices on decent squares.

    What good is your knight if its in the corner of the board because i put your knight there via some exchange which forced your knight to go there.
    What good is a bishop if its behind a pawn because i PUT the pawn there when I checked you.

    Seems like a wasted move, but that pawn blocking your king was your BEST and ONLY move, and it happened to give me control of the board.

    --
    If you use Linux, please help development of Autopac