Slashdot Mirror


Man Vs Machine In Chess - Who Is Winning?

FFriedel writes "In a few weeks, the world's strongest player Garry Kasparov will take on X3D Fritz in a high-profile man-machine chess match. Who is the statistical favourite? Since computers have been steadily improving and are now holding their own against the very strongest human players, one would think it may be Fritz. Not necessarily, says statistician Jeff Sonas, who doesn't believe computers will inevitably surpass the top humans, and presents empirical evidence to support his claim as part of a series of articles for ChessBase."

534 comments

  1. required reading by jbellis · · Score: 4, Interesting

    If you think you know something about computer chess but haven't read Behind Deep Blue by the man largely responsible for creating it, you need to correct your error asap. Did you know, for instance, that in 1997 Deep Blue had 480 chips running its chess program _in silicon_ with 30 rs/6000 nodes controlling them? Moore's law isn't going to let a 2 (4?) cpu PC catch up THAT fast, let alone when it's pure software.

    BTW, the Fritz people make a big deal about beating deep blue in 1995. That would have been a big deal, but the program they beat was Deep Thought II ("Deep Blue Prototype"), not deep blue, a weaker program running on weaker hardware. The match was in Hong Kong where DT2 had persistent problems with their data line to the USA where DT2 was physically located.

    1. Re:required reading by Anonymous Coward · · Score: 1, Insightful

      Its easy to claim that Deep Blue is superiour, because it was dismantled, and we will never see it face off against another computer. IBM ran away scared after thier single (lucky) victory. Speed alone does not a chess god make. Fritz has far superiour positional analysis capabilities when compared to Deep Blue.

    2. Re:required reading by God!+Awful+2 · · Score: 3, Interesting


      BTW, the Fritz people make a big deal about beating deep blue in 1995. That would have been a big deal, but the program they beat was Deep Thought II ("Deep Blue Prototype"), not deep blue, a weaker program running on weaker hardware. The match was in Hong Kong where DT2 had persistent problems with their data line to the USA where DT2 was physically located.

      What's the big deal about the data line? Isn't the computer choosing the moves? If that's the case you can just have someone tell you the moves it chooses over the phone!

      Anyway, I think this article is dumb. The guy raises the possibility that computers will never be better at chess than humans. That should set off immediate alarm bells that the author doesn't know what he's talking about.

      Then he states that if it does happen, it won't happen in the near future. That, in itself, would be a defensible position (if the guy hadn't already proved that he doesn't know what he's talking about). But he doesn't back up this assertion with any compelling logic. If, as has often been speculated, chess is turning into a giant game of memorization, it stands to reason that computers are going to gain the upper hand.

      -a

    3. Re:required reading by FooAtWFU · · Score: 1

      Amazing. That's a lot of nodes.

      Imagine a Beowulf cluster of chess pieces...

      --
      The World Wide Web is dying. Soon, we shall have only the Internet.
    4. Re:required reading by Sivaram_Velauthapill · · Score: 2, Interesting

      The guy raises the possibility that computers will never be better at chess than humans. That should set off immediate alarm bells that the author doesn't know what he's talking about.

      Why? Is it not conceivable that computers may perhaps be weaker in some THING than humans?

      But he doesn't back up this assertion with any compelling logic.

      I think you need to wait for part III lol no joke :) The first part had absolutely nothing. It seemed like an intro...he claims to support his position with empirical evidence but that was lacking in part I

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    5. Re:required reading by wxyze · · Score: 1

      The author of Behind Deep Blue makes an interesting point about the term "Man vs. Machine" (the subject of a few comments posted below) -- he says when he looked around at his fellow programmers, he saw human faces. He preferred to think of the contest as "Performer vs. Toolmaker".

      BTW, the book is indeed a great read.

    6. Re:required reading by pkhuong · · Score: 1

      "Why? Is it not conceivable that computers may perhaps be weaker in some THING than humans?"

      No. I believe the universe to be definable as cellular automata. If not the universe, it is nearly certain that it is possible to do so at an atomic level. Therefore, a computer can plausibly be at least equivalent to a brain.

      Moreover, it can easily be argued that the difference between computer and humans' brain is artificial.

      In any case, from just about any non-mystical PoV, no, it is not plausible(conceivable?) that computers in general will always be less powerful than humans.

      --
      Try Corewar @ www.koth.org - rec.games.corewar
    7. Re:required reading by Dun+Malg · · Score: 1
      Why? Is it not conceivable that computers may perhaps be weaker in some THING than humans?

      Yeah, but chess ain't it. Chess is purely mathematical. The limitation is in the human programmers crafting a complete algorithm that will analyze a chess game properly. For a while guys like Kasparov will be able to beat machines by noticing weaknesses in the alogorith-- blind spots, if you will. But at some point all of the human-findable weak points in the program will be found and freakishly talented weirdos like Kasparov will no longer rule.

      --
      If a job's not worth doing, it's not worth doing right.
    8. Re:required reading by fupeg · · Score: 1

      You exhibit a frightening lack of knowledge of both chess and algorithms. If chess was "purely mathematical" then there would exhist an optimal solution(s). However, the way that chess computing works is not by solving for this optimal solution, but by constantly examining all possibilities (or some well crafted subset) as far ahead as possible and picking the optimal solution over that set. Why is this? Simple, chess is an increasingly complex game, i.e. the number of possible outcomes does not always decrease after each move. This may seem counter-intuitive, certainly a player making a move should eliminate some possible outcomes that relied on the player making a different move, but it is sort of an infinity minus something less than infinity is still infinity. That is why there is no solution to be solved for and instead computers must solve for partial solutions. These partial solutions get better and better as computers can examine more scenarios, but there are definitely diminishing returns.

    9. Re:required reading by Sivaram_Velauthapill · · Score: 1

      I don't know if I understand what you mean by cellular automata. Is that the same idea that everything in the universe is deterministic? If yes, you are wrong. The universe can be shown to be non-deterministic. Modern day science is heading in the direction that everything is probabilistic. What this means is that humans are NOT automatons.

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    10. Re:required reading by Dun+Malg · · Score: 1
      You exhibit a frightening lack of knowledge of both chess and algorithms. If chess was "purely mathematical" then there would exhist an optimal solution(s).

      Whoa, I didn't say it was a simple mathematical problem. Besides, something being "purely mathematical" does not mean it must have an "optimal" solution. I'm just saying that there's no mystical thaumaturgic aspects to chess that require you to be human to master it. At some point someone will develop a chess playing computer that can outplay any human player. Not one that can win all the time, by any means, but one that can play better than any human. From a cellular automata standpoint, there's nothing in the universe* that can't be simulated exactly, including the brain of a chess master.

      * except, of course, the universe itself

      --
      If a job's not worth doing, it's not worth doing right.
    11. Re:required reading by Flamerule · · Score: 1
      You exhibit a frightening lack of knowledge of both chess and algorithms.
      You need to support this assertion better.
      If chess was "purely mathematical" then there would exhist an optimal solution(s).
      It is, and there is. The game tree for chess, however, is simply so large that finding the optimal solution probably exceeds the computational power of the universe, or something like that.
      That is why there is no solution to be solved for and instead computers must solve for partial solutions. These partial solutions get better and better as computers can examine more scenarios, but there are definitely diminishing returns.
      Did you look at the chart of computer chess scores in the article? If you do so, you'll note that it's roughly linear with time. Not asymptotal. You need to provide evidence to support your assertion that there are diminishing returns -- there well may be, but all that matters is whether chess computers stop at this maximum before they surpass all human chess players. This surpassing looks like it will happen fairly soon; reaching the theoretical maximum, not so soon.
    12. Re:required reading by druhol · · Score: 1

      Read up on your quantum mechanics. Most physisists nowadays will tell you that in the most minute forms, matter/energy is almost completely unpredictable. (Heizenberg Uncertenty Principal, anyone?) Newtonian physics have been out of fashion for decades now, dude.

      --
      WWD4D?
    13. Re:required reading by Madcapjack · · Score: 1

      ummm. not so sure dude. Tell me what you mean by the world being non-deterministic. What could that possibly mean? Really? And don't tell me any silly repeat of the Indeterminancy Theory of Quantum Mechanics.

    14. Re:required reading by Sivaram_Velauthapill · · Score: 2, Interesting

      Actually quantum mechanics is exactly what I have in mind. Why do you say it is silly? That is the theory that scientists believe in nowadays.

      If you go with quantum theory, what happens is that you can't know the outcome state of an action. The outcome spans a probability distribution. Not a great example but I'll use it anyway: When you flip a coin, deterministic view would say that the coin can only be heads or tails. But if you go with a probabilistic framework, the coin can stand on its edge, it can blow up and disintegrate, etc. That's how the universe is.

      According to this view, two IDENTICAL brains will end up doing different things simply because the end state has a probability attached with it. This essentially means that humans are not automatons.

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    15. Re:required reading by God!+Awful+2 · · Score: 1


      I don't know if I understand what you mean by cellular automata. Is that the same idea that everything in the universe is deterministic? If yes, you are wrong. The universe can be shown to be non-deterministic. Modern day science is heading in the direction that everything is probabilistic. What this means is that humans are NOT automatons.

      I agree with the OP. Even if the universe is not deterministic (which in my opinion has yet to be proven -- think hidden variables), it should be possible to build a computer that follows the same statistical laws as the human brain. Just because our brains are probabilistic doesn't mean we have "true" free will. What it implies is merely that we are non-deterministic cellular automata.

      -a

    16. Re:required reading by God!+Awful+2 · · Score: 1

      Certainly, you are right and the OP is wrong, except maybe for the law of diminishing returns. The best computers will pass the best humans very, very soon (assuming that they haven't already), and the ratings still seem to be going up fairly linearly.

      But if chess turns out to be a theoretical draw (as most people expect it to be) then the returns will be diminishing in the sense that the best computers may never be able to consistently beat the best human players (they will never lose, usually draw, and occasionally win). In fact, humans will very likely give up on trying to beat the computer and they will concentrate on earning the easiest draw with the fewest complications.

      -a

    17. Re:required reading by kasperd · · Score: 1

      It is, and there is. The game tree for chess, however, is simply so large that finding the optimal solution probably exceeds the computational power of the universe, or something like that.

      With dynamic programming it can be solved in 10^57 bytes of memory. Possibly a lot less if you are clever.

      --

      Do you care about the security of your wireless mouse?
    18. Re:required reading by Madcapjack · · Score: 1
      Actually quantum mechanics is exactly what I have in mind. Why do you say it is silly? That is the theory that scientists believe in nowadays.

      I understood you originally to mean quantum mechanics. And no, I do not think quantum mechanics is silly. I understand probability distributions, but having probability distribution does not necessarily imply physical indeterminism. What I asked was, what does it truly mean to be indeterminate?

      I could be wrong, but as I understand it indeterminancy in quantum mechanics is not about fundamental indeterminancy, but to be about limits of observation of subatomic particles. I am not well read on physics though.

      in any case, I'm still not sure what it truly means to be not deterministic.

    19. Re:required reading by dvdeug · · Score: 1

      Why? Is it not conceivable that computers may perhaps be weaker in some THING than humans?

      Computers suck at a lot of things, like translation. But they don't suck at brute-force in-depth analysis of mathematical problems, which happens to work fairly well with chess. Deep Blue was good enough to outplay the best chess player in the world a few years ago, While none of the competitions between computers and people in the past few years have been with such strong hardware, they have managed to pull draws against the best players in the world. Throw a supercomputer against the problem, and odds are any human could be beat today at chess; in a few years, given Moore's law, off the shelf hardware could do it. Humans don't have Moore's law working for them; at best, they improve over generations, not months.

    20. Re:required reading by Anonymous Coward · · Score: 0

      10^57 bytes

      That isn't that much -- we'll have that much soon, if the sun doesn't pass into nova first :)

    21. Re:required reading by Paradise+Pete · · Score: 1
      Why? Is it not conceivable that computers may perhaps be weaker in some THING than humans?

      Oh please. In say, a thousand years, do you really think that computers, despite being inconceivably more powerful than they are today, will still be incapable of producing better chess moves than humans?
      Of course not. The only question is how long it will take. Less than 1,000, surely, and probably a hell of a lot less.

    22. Re:required reading by Anonymous Coward · · Score: 0

      Who has suggested that chess is turning into a giant game of memorization?

      On the contrary, it's easy for someone versed in the game to see that chess is getting more and more imaginative, creative and dynamic for each year. Yes, standard opening variations are getting longer, but that has nothing to do with how the rest of the game is being played.

    23. Re:required reading by Zan+Zu+from+Eridu · · Score: 1
      I could be wrong, but as I understand it indeterminancy in quantum mechanics is not about fundamental indeterminancy, but to be about limits of observation of subatomic particles. I am not well read on physics though.

      Nope, the nondeterminism is a fundamental property. If you don't accept this, you'll have to introduce hidden variables to QM. The problem with hidden vars is that you can't measure their effects directly nor indirectly, which sort of violates the definition of what is physics.

      Simply put, if you can't accept randomness as a fundamental property of the universe, you'll have to intoduce physical laws you'll not be able to prove nor disprove. You're not far off from introducing some kind of God (with a hidden masterplan) into physics.

    24. Re:required reading by rcs1000 · · Score: 1

      PC aren't going to catch up that fast...

      So, 480 chips in '97. Assume silicon power/density doubles every 18-months, a la Moore's law.

      By 2000, it would be 110. And this year it would be 27.

      Now, I don't know about you - but PCs seems to be catching up pretty fast ;-)

      --
      --- My dad's political betting
    25. Re:required reading by Sivaram_Velauthapill · · Score: 1

      ...it should be possible to build a computer that follows the same statistical laws as the human brain.

      But if the states are RANDOM, you will never be able to simulate the brain, or anything else for that matter. What you are sayin is akin to trying to predict the EXACT position of an electron in a nucleus. It just cannot be done. However, you can give the probability of the electron at a certain position.

      Even if you can model the system reasonably well, you won't know the exact outcome because of "randomness".

      Just because our brains are probabilistic doesn't mean we have "true" free will.

      It is not just the probabilistic view that matters; the notion of randomness goes hand in hand. If things in the universe happen randomly (say the chemical reaction in your brain is random) then humans indeed have free will, IN THE SENSE THAT you cannot predict what humans--or any process for that matter--will do.

      On top of all this, can computers (a deterministic finite system) ever generate random numbers? I'm not too knowledgeable in this matter but my feeling was that computers only generate pseudo-random numbers and other questionable numbers passed off as "random".

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    26. Re:required reading by Anonymous Coward · · Score: 0

      Actually, it's much easier to make these predictions on anything other than simple chemical reactions. If humans were actualy as random as you state, we would'vd died off long ago.

      Our organization, which overall depends on the removal of randomness, is what keeps us going. In fact, just the replication (read "reproduction" for more complex lifeforms) of large molecules, like DNA, is an affront to randomness. If our whole existence didn't continuously fend off this randomness, life never would have arisen to begin with.

      I would say that because of our safeguards against the inherent randomness of the universe make us predictable.

    27. Re:required reading by Anonymous Coward · · Score: 0

      Fritz is way stronger than Deep Blue ever was -
      Just look at the quality of the games! This is
      widely accepted in the chess community.

    28. Re:required reading by Anonymous Coward · · Score: 0

      At the scale of the brain, I doubt there is any indeterminancy. You could also argue that since computers are built of quantum objects, that computer programs are also indeterministic, which is wrong. Two IDENTICAL CPUs do end up doing the same thing. Probably two IDENTICAL brains also end up doing the same thing as well. Indeterminancy at the particle level does not impliy indeterminancy in the function of the brain. It's a moot point anyway since we will never have two identical brains.

    29. Re:required reading by Sivaram_Velauthapill · · Score: 1

      I don't understand your logic. Why do you say that we would have died off, and the DNA wouldn't have existed if randomness did exist?

      In fact, I would argue that life exists PRECISELY because of the randomness. The probability of life is so slim that the chances of finding another lifeform in the millions of other planets is very small. The only reason we--and all organisms--exist is because of some random result.

      As far as DNA and complex molecules are concerned, I don't see a problem. Yes, randomness will try to alter it but inheritence (such as theory of natural selection and evolution) mean that there is no problem here.

      I think the key point that you are overlooking is that randomness does not mean that the probability of an outcome is very high. The probability distributions are skewed in favour of certain outcomes. For instance, the probability of a coin ending up as head or tail is very high but the probability of it ending up on its side (which it can) is tiny.

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    30. Re:required reading by Overly+Critical+Guy · · Score: 1

      If chess was "purely mathematical" then there would exhist an optimal solution(s).

      It's called fuzzy logic.

      --
      "Sufferin' succotash."
    31. Re:required reading by Anonymous Coward · · Score: 0

      If the states of the brain were RANDOM you could not walk. The brain doesn't care about "the exact position of an electron". One electron cannot trigger an axon to fire. Significantly, signalling in the brain is due to the interaction of neurotransmitters (which are molecules) with relatively enormous proteins. The location of a molecule can be measured to within necessary precision. Propagation of a stimulus along an axon is due to voltage dependent movement of ions (K,Ca,Na). The location of a K, Ca, or Na ion in space is probably not significantly indeterministic. Furthermore, the brain is designed to overcome randomization on an even larger scale. For example, the precise number and position of ion-pores and channels in axon membranes.

      PS: Can humans generate "random" numbers?

    32. Re:required reading by Xerithane · · Score: 1

      I agree with you, and it just has to be brute force. If you compiled a game library of every possibility of every perfect game, the game of chess would be ruined. I think, for the sake of sportsmanship, chess computers should be isolated outside of books and into algorithmic strategies. That will yield a computer that can beat humans most of the time, but not all.

      I still have trouble beating gnuchess, so I'm not that worried.

      --
      Dacels Jewelers can't be trusted.
    33. Re:required reading by God!+Awful+2 · · Score: 1


      Who has suggested that chess is turning into a giant game of memorization?

      I believe it was Kasparov, although I'm not completely sure. I think this was his justification for wanting to consult reference materials during the opening.

      -a

    34. Re:required reading by God!+Awful+2 · · Score: 1


      But if the states are RANDOM, you will never be able to simulate the brain, or anything else for that matter. What you are sayin is akin to trying to predict the EXACT position of an electron in a nucleus. It just cannot be done.

      If the uncertainty principle affects the brain (which it certainly does, but perhaps not as much as you think), then we won't be able to predict the exact output of *a particular* human brain. But that's not what I'm talking about; it should be possible to build a computer that thinks like a human without copying one particular human.

      humans indeed have free will, IN THE SENSE THAT you cannot predict what humans--or any process for that matter--will do.

      I don't call that "free will". I call that "the illusion of free will".

      On top of all this, can computers (a deterministic finite system) ever generate random numbers? I'm not too knowledgeable in this matter but my feeling was that computers only generate pseudo-random numbers and other questionable numbers passed off as "random".

      Computers generally have some non-deterministic components that can be used to seed a random number generator.

      BTW, you might consider that humans aren't that great at choosing a random number either. Ask someone to pick a number between 1 and 10 and the first thing that pops into their head is usually 7.

      -a

    35. Re:required reading by ccp · · Score: 1

      >
      Then he states that if it does happen, it won't happen in the near future.

      What does this mean?
      It has already happened!

      Cheers,

    36. Re:required reading by ccp · · Score: 1

      Chess is purely mathematical

      I didn't say it was a simple mathematical problem. Besides, something being "purely mathematical" does not mean it must have an "optimal" solution.

      Dun, you contradict yourself.

      The other guy is right, you know neither chess nor algorithms.
      Fudging the issue won't make you look better.

      Cheers,

    37. Re:required reading by ccp · · Score: 1

      And yours is the best post of the thread. The answer is very simple:

      Moore's law works for computers, against humans.
      Humans are toast.

      Get over it.

      Cheers

    38. Re:required reading by ccp · · Score: 1

      It is, and there is. The game tree for chess, however, is simply so large that finding the optimal solution probably exceeds the computational power of the universe, or something like that.

      But the ONLY thing you need is to be better than a human player.
      Who cares about the teorethical maximum?

      Cheers,

    39. Re:required reading by Anonymous Coward · · Score: 0

      *A* computer, perhaps, but probably not a digital one. Digital computers are incapable of parsing enough languages and solving enough problems. When you look at the Turing machine, it's clear that they have many limits which humans do not. A digital computer with as much capacity and power as is imaginable is still more limited than an analog brain.

    40. Re:required reading by ed1park · · Score: 1

      You need to correct your error asap. :)

      There are two ways to design a chess engine. One is to use brute force with hardware like Deep Blue. The other is to use a heuristic approach relying on advanced/intelligent algorithms.

      The right algorithms can achieve a performance many orders of magnitude greater than that achievable with hardware even with Moore's law.

      And the wrong algorithm can bring any computer to a slow and hugely inefficient crawl.

    41. Re:required reading by Bombcar · · Score: 1

      Once a computer can beat any human easily, then we will have competitions between different computers. Then it will be important how far they can go.

    42. Re:required reading by Anonymous Coward · · Score: 0
      The guy raises the possibility that computers will never be better at chess than humans. That should set off immediate alarm bells that the author doesn't know what he's talking about.

      That you assume the opposite raise an alarm with me. Could you show us that you know what you're talking about by giving us some reasons for your position? Here's what I know:

      a) The guy you're slamming has a published article on the subject.
      b) You're posting on Slashdot.

    43. Re:required reading by vpetersen · · Score: 1

      10^57 bytes, in what time, and how fast a computer should be?

    44. Re:required reading by God!+Awful+2 · · Score: 1

      Hence my comment that he doesn't know what he's talking about.

      -a

    45. Re:required reading by God!+Awful+2 · · Score: 1


      That you assume the opposite raise an alarm with me. Could you show us that you know what you're talking about by giving us some reasons for your position? Here's what I know:

      a) The guy you're slamming has a published article on the subject.
      b) You're posting on Slashdot.

      Touche. I can't argue with that.

      I think this guy probably knows more about chess than I do, but I doubt he knows much about AI. (BTW, I have written some published articles on AI, since you seem to care.) For some more in depth reasons why this guy is wrong, see the rest of this thread.

      -a

    46. Re:required reading by kasperd · · Score: 1

      10^57 bytes, in what time, and how fast a computer should be?

      It is a dynamic algorithm, so the time spent is not going to be much more than the time it takes to fill up the memory with partial results. In this particular case I guess the time usage would be about 10^60 clockcycles. The interesting question, which I will not try to answer is: Can the algorithm be parallelized?

      --

      Do you care about the security of your wireless mouse?
    47. Re:required reading by Sivaram_Velauthapill · · Score: 1

      ...it should be possible to build a computer that thinks like a human without copying one particular human.

      Doing so would be nothing more than creating a human! For instance, if a automaton behaved, thought, and acted exactly like humans, they are humans in my eyes--are they not?

      I don't call that "free will". I call that "the illusion of free will".

      There is no illusion here at all. I think we are arguing semantics. If a human--or any other being--is non-deterministic, it has free will. That's pretty much the definition...

      BTW, you might consider that humans aren't that great at choosing a random number either. Ask someone to pick a number between 1 and 10 and the first thing that pops into their head is usually 7.

      lol not in mine ;) Anyway, we are fairly random. By the way, by random I do not mean that the outcomes have equal probability. For instance, if humans random numbers are skewed towards '7', it can still be random.

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    48. Re:required reading by mehulgohil · · Score: 1

      This is a very interesting argument! Especially for a chess player like my self.

      On the surface, it does seem that computers are playing slightly better then the humans. What with Deep Blue II having beaten a genius (or Freak as some are calling him here!) like Kasparov, and the fact that over the last few years top humans like Bareev and Kramnik haven't managed to beat a computer. It has been only draws. And it seems logical to say that "technology is improving every day, so why the hell wont computers be dominating humans in a few years to come?'. That's a pretty logical view. The computers will only become more powerful technologically. Fritz 8 (the program which held World Champion Vladimir Kramnik to a draw in a recent match). running on todays 2000Mhz, 256 RAM, PIV computers can only be challenged by the top 5-6 players in the world. So I am imaging when two yeras down the road we have a Pentium IX how powerful a fritz program will be.

      But that is viewing thing purely from the point of a person who doesn't play chess at a club level and above. A person who is probably interested in computers, but not that much in chess. It is very easy for sucha person to say Comps are better then Humans.

      I am a chess player with an ELO 2350, and when I look at these computer-human encounters from a CHESS viewpoint, I am inclined to say that the computers have still got a lot to learn. Here are the point I base my idea on:

      1. There is a misconception amongst the general Public that Deep Blue Humiliated Kasparov. When you take a look at the games and the quality of play you begint o realise that Deep Blue was actuall Lucky. Kasparov was playing opening usually seen only AT THE BEGGINER LEVEL! His idea was to get deep blue out of the openings book, and it comes as a source of astonishment to serious chess players that kasparov could actually create serious winning chances with these weak opening systems. If he employed tham against ANY strong grandmaster he would be in serious trouble. In fact, Kasparov would have won the last Match against Deep BLue by a considerable margin if his his attention hadn't slacked towards the end of some of those games. Go look at the games yourself...the truth is there...and very accesible! Deep blue was simply lucky that Kasparov resigned in a DRAWN position in game 2, and made a stupid mistake in the last game which even a strong club player would have avoided!. Plus he came very close to winning games 3,4 & 5.

      2. Deep Blue is weaker than the current crop of top chess programs. Take your fritz 8 and have it analyse kasparov-Deep Blue games. On many occasion it suggest better moves, and it has to be remembered that Kasparov was playing very much below his strength.

      3. In the recent matches, especially Kasparov-Dee Juniour & Kramnik-Deep Fritz, which both ended in draws, the computer in no way showed it was on par with the humans. In the Kasparov match , deep juniour could have been losing 3-0 after three games if kasparov had nailed in the second game (where he chose a weaker move when deep juniours position was critical) and won a beautiful game three had he not blundered after having created a superb and brilliant attack. True in game 5 deep Junior created a sensation with a stunning bishop sacrifice in game 5, and everyone was going gaga about it. But what is not mentioned is the intuition Kasparov demonstrated in steering things to a draw and not deciding to test Deep Juniour in the murky tactical waers. Later, after many man and computer hours of analysis, it was discovered that Kasparov's judgment was correct in assuming the position was dangerous for him.

      And in the Kramnik Match, the humans should have won once again. Kramnik also resigned in a drawn position (which he assumed was lost but overnight analysis proved the draw was there...a draw that is hard for the computer to understand, but within human understanding. He also blundered in another game which was drawn.

      In both these matches humans should have won, and the co

    49. Re:required reading by God!+Awful+2 · · Score: 1


      Doing so would be nothing more than creating a human! For instance, if a automaton behaved, thought, and acted exactly like humans, they are humans in my eyes--are they not?

      I can't speak for what is human "in your eyes", but I would say no. "Human" refers to the species. So if you're not flesh and blood, you're not human.

      If a human--or any other being--is non-deterministic, it has free will. That's pretty much the definition...

      No way. An electron is non-deterministic. Does that mean it has free will? What about a computer that takes input from a random number generator?

      By the way, by random I do not mean that the outcomes have equal probability. For instance, if humans random numbers are skewed towards '7', it can still be random

      I agree, but that's pretty tangential to my point. Atheists like me believe that there is nothing special that separates man from machines. It seems to me that we hold machines to high standards in some areas where we don't expect them of humans. (E.g. random number generation.)

      -a

  2. What will they do when we're gone? by SeanTobin · · Score: 3, Funny

    Anyone else think that once machines take over the Earth, all they will do is play chess against eachother?

    --
    Karma: SELECT `karma` FROM `users` WHERE `userid`=138474;
    1. Re:What will they do when we're gone? by ePhil_One · · Score: 1

      I was thinking they might play real-life RISK :)

      --
      You are in a maze of twisted little posts, all alike.
    2. Re:What will they do when we're gone? by Anonymous Coward · · Score: 0

      No, the game they'll play is Global Thermonuclear War. Sure, Joshua suggested a good game of chess first, but once you start playing GTW, you just can't stop. I hope they come out with GTW: Vice City soon.

    3. Re:What will they do when we're gone? by AntiOrganic · · Score: 3, Funny

      Of course not! Even in jest, that's a ridiculous suggestion.

      The computers will engineer humans to play chess with.

    4. Re:What will they do when we're gone? by Anonymous Coward · · Score: 0

      Actually, they will probably be playing Go.

    5. Re:What will they do when we're gone? by Anonymous Coward · · Score: 0

      Machines will not take over the Earth.
      Just don't worry about that.

      Your's Sincerely,

      Skynet

    6. Re:What will they do when we're gone? by Drantin · · Score: 1

      So long as they try a few games of Tic-Tac-Toe so we can take it back... Wargames reference ;)

      --
      Actio personalis moritur cum persona. (Dead men don't sue)
    7. Re:What will they do when we're gone? by Anonymous Coward · · Score: 0

      I, for one, welcome our new chess-playing overlords! Even if they're Beowulf clusters in Soviet Russia...

    8. Re:What will they do when we're gone? by Anonymous Coward · · Score: 0

      No, they will play Global Thermal Nuclear War.

    9. Re:What will they do when we're gone? by Anonymous Coward · · Score: 0

      I for one, welcome our new chess playing computer overlords.

      You asked for it. :P

    10. Re:What will they do when we're gone? by Evil+Adrian · · Score: 1

      Nope. They'll create dummy robots to run around factory mazes shooting each other and tagging flags...

      and they will call this RoboRally!!!!

      (Huge dork. Me.)

      --
      evil adrian
    11. Re:What will they do when we're gone? by hdparm · · Score: 0, Offtopic

      You may want to ask new California Governor this question. Takeover seems to have started - I'm sure A.S. will be able to clarify the issue for us all.

    12. Re:What will they do when we're gone? by nizo · · Score: 1
      Anyone else think that once machines take over the Earth, all they will do is play chess against each other?

      It would be rather ironic if they have already won and turned us into batteries, in which case we are just part of a computer simulation in which we think we are creating smart computers (yes I am impatiently waiting for the 3rd matrix movie dammit).

    13. Re:What will they do when we're gone? by _Sexy_Pants_ · · Score: 1

      Aw man I LOLed. Mod this sucker up. Me too while you're at it!

      --
      Look it's a joke about my sig IN MY SIG! LOL!
    14. Re:What will they do when we're gone? by Sivaram_Velauthapill · · Score: 0, Flamebait

      You mean US imperialism will be replaced with XReR-74 imperialism?

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    15. Re:What will they do when we're gone? by Sivaram_Velauthapill · · Score: 1

      If computers rule earth (let's hope not :) ), the computers will carry out what they perceive to be the highest goal, or highest challenge.

      If Chess is the highest challenge for them, they will spend all their time trying to master that...

      If war is the highest challenge, they will spend centuries warring each other...

      If peace is the highest, they will attempt to initiate and maintain peace...

      If trying to explore the whole galaxy is the most challenging, they will spend billions of light-years doing that...

      Having said all that, I personally don't think none of those will be challenging to a computer. What will be challenging to a computer is art. I suspect computers will attempt to master art and never succeed (since it is subjective and can't be quantified)...

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    16. Re:What will they do when we're gone? by simcop2387 · · Score: 0

      Mod parent up

    17. Re:What will they do when we're gone? by Anonymous Coward · · Score: 0

      Walking. That will be their biggest challenge, especially if most of them feel bloated by their OS...

    18. Re:What will they do when we're gone? by Canadian_Daemon · · Score: 1

      November 5th

      --
      This sig is definitive. Reality is frequently inaccurate.
    19. Re:What will they do when we're gone? by BorgCopyeditor · · Score: 2, Funny
      The computers will engineer humans to play chess with.

      And then speculate baselessly about whether it would ever be possible to create a human that could beat the best machine players.

      --
      Shop as usual. And avoid panic buying.
    20. Re:What will they do when we're gone? by -brazil- · · Score: 1
      the computers will carry out what they perceive to be the highest goal, or highest challenge.


      Why should they? Even among humans, challenge comes last in the hierarchy of needs (Maslow), after bodily needs are satisfied and secured and social acceptance is achieved. And there's no compelling reason to assume that once machines achieve intelligence, they will operate on the same basic motivations as humans.

      --

      The illegal we do immediately. The unconstitutional takes a little longer.
      --Henry Kissinger

    21. Re:What will they do when we're gone? by Sivaram_Velauthapill · · Score: 1

      Yes, you are right: we don't know what the motivations of the machines will be. My view was based on the assumption that the computers will behave like us.

      If computers DO behave like us, what I said is correct. Challenge does come in at the top of the Maslow's hierarchy (I guess it would fit in self-actualization or something). But it would be the ultimate goal. The lower level stuff (like need for shelter, food, etc) are more important but they will be readily satisfied--hopefully. Therefore, the machines will end up with the highest one and they will attempt to tackle that for their whole lives. That is what happens in humans. Most people are always climbing up and many actually end up at the top spot. Once we reach that point, we spend our whole lives trying to make sense of what we perceive to be the highest challenge for us. For instance, there are billions of people seeking the meaning of life. There are others attempting to solve some mystery in the universe (and hence take on a scientist-like vigour).

      I DO think that humans spend most of their lives trying to satisfy their highest challenge. Most people who are past 40 years of age usually take on these challenges. When you are younger, your needs are more immediate (and lower on the hierarchy)

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    22. Re:What will they do when we're gone? by abhinavnath · · Score: 1

      Given that they've just started (in sunny California), my guess is they'll be pumping iron and groping each other. And marrying into the Kennedy family.

      --
      My other sig is also a .Porsche
    23. Re:What will they do when we're gone? by xRelisH · · Score: 1

      Well, the next step is obvious. They will engineer a superior human that will beat them at chess, humans will reign again and the cycle continues.

    24. Re:What will they do when we're gone? by Deadstick · · Score: 1

      There was an SF short story many years ago about the ultimate computer chess game, played when the machines had achieved the ability to play a perfect game. The moves:

      White: P-K4
      Black: Resigns

      rj

    25. Re:What will they do when we're gone? by GlassHeart · · Score: 1
      The computers will engineer humans to play chess with.

      Rats, a world ruled by Machines will be just like Soviet Russia?

    26. Re:What will they do when we're gone? by cylcyl · · Score: 1

      Ack! You just discovered the true purpose of the Matrix! You must be eliminated!

    27. Re:What will they do when we're gone? by Anonymous Coward · · Score: 0

      >If trying to explore the whole galaxy is the most challenging, they will spend billions of light-years doing that...

      I don't get it...they will spend a very long distance doing that...?

    28. Re:What will they do when we're gone? by Anonymous Coward · · Score: 0

      The late Paul Anderson's book Genesis is a cool book with pretty much the same hypothesis.

      http://www.betterhumans.com/Errors/index.aspx?as px errorpath=/searchEngineLink.article.2002-06-02-3.a spx

  3. Angry Chess Players by spudthepotatofreak · · Score: 1

    I feel sorry for the computer that kicks his ass at chess, with his temper he's likely to smash it to pieces with a hammer... Didn't he get pissed off and gave up against deep blue2?

    1. Re:Angry Chess Players by uncoveror · · Score: 0, Troll

      Man vs. Machine chess is a hoax. Read more.

      --
      The Uncoveror: It's the real news.
    2. Re:Angry Chess Players by Anonymous Coward · · Score: 0

      It was interesting up until the verbal diahrea "quote" near the end. The quote sounds a little, how shall we say, fake?

    3. Re:Angry Chess Players by Anonymous Coward · · Score: 0

      What do you expect from a fake article?

  4. slashdot == sexist by larry+bagina · · Score: 0, Troll
    I notice that the question is "Man vs. Machine". You completely ignore the hundreds of grandmaster chess players that happen to be female.

    Have you ever heard of Deep Blue (or it's brethren) defeating a female chess player? Of course not.

    --
    Do you even lift?

    These aren't the 'roids you're looking for.

    1. Re:slashdot == sexist by dreadnougat · · Score: 3, Insightful

      "brethren," eh?

      Hypocrite :)

    2. Re:slashdot == sexist by achacha · · Score: 1

      If it wasn't a reference to IBM, they should have called it Deep Pink and been done with it.

    3. Re:slashdot == sexist by jpsowin · · Score: 1

      I do believe the "man" they were speaking of was not male, but just a synonym for "mankind."

    4. Re:slashdot == sexist by Squinky86 · · Score: 0

      I agree with you completely. I'm second place for my age in the state of Alabama (not saying much, eh?), and I was beaten in a tournament- by a girl. At first I felt bad, but hey, she's good! I came back and drew her the next tourney, and neither of us have been able to completely stomp the other since.

      As for man vs. machine, where's the fun? I like playing chess, but against an opponent that does make a mistake every once in a while!

      "Now, opponents, shake hands....er...capacitors...bah!"

    5. Re:slashdot == sexist by Anonymous Coward · · Score: 0

      I believe so too. Thank you brother, OR sister.

    6. Re:slashdot == sexist by GoofyBoy · · Score: 1

      With the tone of SCO/M$/Linux/OpenSource articles, you are just now realizing that the editors are biased?

      --
      The surprise isn't how often we make bad choices; the surprise is how seldom they defeat us.
    7. Re:slashdot == sexist by Waffle+Iron · · Score: 1, Troll

      Centuries ago English had a more sensible set of words for human beings: 'woman' for a female, 'wereman' for a male, and 'man' for the general case covering both. We would have avoided a lot of confusion and controversy if the term 'wereman' hadn't been dropped. (A vestige of the word does still survive as part of 'werewolf', but given the scarcity of these creatures, that's not really very useful.)

    8. Re:slashdot == sexist by be-fan · · Score: 1

      There are two different words, "man" and "man." One refers to male humans, while the other refers to humans in general. Just like "lie" can mean to be dishonest or to lay down on the ground.

      --
      A deep unwavering belief is a sure sign you're missing something...
    9. Re:slashdot == sexist by gnoblins · · Score: 2, Informative

      Of the Top 50 female chess players, only six have reached the male grandmaster level, and only Judit Polgar has reached super GM level (>2700) which would be sufficient to challenge one of these machines.

    10. Re:slashdot == sexist by thelenm · · Score: 1

      I notice that you refer to other computers as Deep Blue's "brethren". You completely ignore the thousands of chess playing computers that happen to be female.

      --
      Use Ctrl-C instead of ESC in Vim!
    11. Re:slashdot == sexist by Anonymous Coward · · Score: 0

      Hey, and she's not a bad piece either. She can Queen my Pawn any day.

    12. Re:slashdot == sexist by LoztInSpace · · Score: 1
      Thank you. http://dictionary.reference.com/search?q=man
      1. An adult male human.
      2. A human regardless of sex or age; a person.
      3. A human or an adult male human belonging to a specific occupation, group, nationality, or other category. Often used in combination: a milkman; a congressman; a freeman.
      4. The human race; mankind: man's quest for peace.


      Good enough for me, but I've never been that PC anyway.
    13. Re:slashdot == sexist by DrakkenFire · · Score: 1

      Man is being used as an archetype. It is the same as if discussing themes of literary work such as Man vs. Nature, or Man vs. Himself.

      The "Man" is used to represent humanity rather than a specific gender.

    14. Re:slashdot == sexist by Anonymous Coward · · Score: 0

      2nd place in Alabama... so that would put your IQ at what... about 85?

    15. Re:slashdot == sexist by Anonymous Coward · · Score: 0

      Drunk slashdoting are we? Dude, take the beer goggles off...

    16. Re:slashdot == sexist by Anonymous Coward · · Score: 0

      Gee, that was clever.

    17. Re:slashdot == sexist by Anonymous Coward · · Score: 0

      Gee, that was clever.

      Accurate, too!

    18. Re:slashdot == sexist by Anonymous Coward · · Score: 0

      I think she's OK. The jaw's a little square, but with the right lighting, definitely manageable. It might just be a bad picture.

    19. Re:slashdot == sexist by Viol8 · · Score: 1

      "Man" is a generic term for people and you know it. Get a life you politically correct sad moron.

    20. Re:slashdot == sexist by flamingmoose · · Score: 1

      Reminds me of two columns by the late dutch master (or grandmaster, I can't remember) Jan Hein Donner. In the first one he wrote about women not being able to play chess. Obviously that generated a lot of reactions, to which he devoted a second column. One woman wrote to him: "Next you're going to write that negroes can't play chess!". Donners reply: "Negroes can play chess. It's the female negroes that can't play chess." It sounds better in dutch, but you get the idea.

      --

      .sigs - is there anything they can't do?
    21. Re:slashdot == sexist by StressGuy · · Score: 1

      This is actually a quirk of the english language. When gender is ambiguous, the convention is to use the masculine. I've read a few articles where gender neutral pronouns where proposed ("hir" for example), but they seem to be less popular than Esparanto. I've also read a few military handbooks where there was a disclaimer on the opening page saying something to the effect that, "where gender is unspecified, they will use the masculine by convention and this is not intended to be sexist"

      On the other point, I would imagine that there has got to be a few grandmaster females out there. I don't really follow the sport enough to know that for certain though.

      --
      A goal is a dream with a deadline
    22. Re:slashdot == sexist by Anonymous Coward · · Score: 0

      How 'bout Alexandra Kosteniuk? She may not be rated >2700, but I rate her a 9, if you know what I mean...

    23. Re:slashdot == sexist by be-fan · · Score: 1

      Its good enough for me, and I'm a bigger feminist than most women I know!

      --
      A deep unwavering belief is a sure sign you're missing something...
    24. Re:slashdot == sexist by Anonymous Coward · · Score: 0

      Hardly. Let's not resort to prejudice here just because someone is from a state you've never been to.

    25. Re:slashdot == sexist by blackp · · Score: 1

      So that makes a female werewolf a wowolf. cool.

  5. subject by Anonymous Coward · · Score: 0

    I think it'd be more intresting to see the top two chess computers play a speed match against each other.

    1. Re:subject by nate+nice · · Score: 1

      Hell yeah! Although, it wouldn't be that fast as they would need plenty of time to calculate moves I'm sure. What would happen if 2 identical programs were to compete? Draw?

      On the other hand it might be about as interesting as watching a video game play itself in the arcade.

      --
      "If you are a dreamer, a wisher, a liar, A hope-er, a pray-er, a magic bean buyer ..."
  6. interesting by Dorothy+86 · · Score: 1

    This is very interesting. I've often wondered how Computers could ever top man, since they run on programs made by man, are they not? It just seems like humans couldn't make chess software that was better than a human itself. Anyone care to shed some more light on this subject?

    1. Re:interesting by dreadnougat · · Score: 1

      Not many people would dispute that computers can add faster and better (fewer errors) than humans...

    2. Re:interesting by Gherald · · Score: 2, Insightful

      It just seems like humans couldn't make chess software that was better than a human itself

      And it just seems to me that humans couldn't make motor vehicles that run faster than a human itself...

    3. Re:interesting by tlayne · · Score: 1

      Very astute. I guess that explains why humans are not able to design a computer that does arithmetic better than humans. Or balance a checkbook better than humans. Or lookup book titles in a library better than humans. Yeah, that must be right.

      --
      Terry Layne
      Portland, OR
    4. Re:interesting by Pr0xY · · Score: 1

      well it is probably true that we could never devise a programm which has a better playing strategy (algorithm) than humans do, we can certainly make a computer which can implement the best strategy more effectivly than humans.

      Humans suffer from indecision, distraction, loss of train of thought, limited time to contemplate future moves and much more limited ability to process future moves effectivly.

      Computers don't really suffer from these so given the same exact stratgey they most certainly can come out on top. It really boils down to unique thought vs brute force number crunching. Unfortunately for us, given enough time, brute force always works, just a matter of time.

      proxy

    5. Re: interesting by Black+Parrot · · Score: 1

      This is very interesting. I've often wondered how Computers could ever top man, since they run on programs made by man, are they not? It just seems like humans couldn't make chess software that was better than a human itself. Anyone care to shed some more light on this subject?
      All you need for a winning chess-playing program is a board-position evaluator that's "good enough" and a virtual player that can simulate game continuations "far enough" ahead of the current game state. Within reason, limits on one of those can be made up by improvements in the other. And though the amount of work required to play out continuations deeper grows exponentially (due to the "parallel universes" branching factor), computational power is growing exponentially too, so we can actually make progress at the depth of look-aheads.

      Ergo, it's a foregone conclusion that computers will someday be able to stomp any human who cares to play. The interesting question is whether anyone will use any interesting AI to do it, or whether it will be almost completely a matter of game crunching.

      --
      Sheesh, evil *and* a jerk. -- Jade
    6. Re:interesting by MillionthMonkey · · Score: 1

      A car, or a human, goes at a certain speed. It's clear that however fast a human or a car moves, it's always possible to go 10 mph faster.

      Chess is all about not screwing up and giving the other guy an advantage. You want to develop your pieces, get through the middlegame, and reach a predictable endgame with no deficit in material and position. If you can do that, you're all set! It isn't clear that it's always going to be possible to do better than that. There may be a fundamental limit on how well it is possible to play chess.

      Computer play might reach a point where pushing the horizon further away by 10 ply doesn't make an appreciable difference in the moves it makes. Once your play is perfect, you can't get any better. To take your analogy further, it might be that both the human and the car have reached some sort of fundamental limit like the speed of light, where the variation in outcome is dependent on minor deviations in human play during the game.

      If you look at the chart in the article, it appears that the quality of human and computer play converged in 1999. The matches have all been resulting in draws since then, as if the winners were reduced to random variables. So it looks like some humans have been effectively playing perfect games, and now we have computers that play perfect games too.

    7. Re:interesting by nacturation · · Score: 1

      I've often wondered how Computers could ever top man, since they run on programs made by man, are they not? It just seems like humans couldn't make chess software that was better than a human itself. Anyone care to shed some more light on this subject?

      Given an unlimited amount of time, it's always possible that computers won't fare any better than humans, since humans can use the same algorithms. However, chess is played in a finite amount of time. It's like having a contest to multiply two large numbers together. A human can always come up with the correct answer, as will the computer. However, the computer will always do it faster. Now put a time limit on the multiplication exercise and a human won't be able to find the correct solution in the time allotted, which is that we're starting to see now with computers beating humans in chess.

      It's inevitable that the trend in computer chess advances will only continue. Previously, humans trounced computers, both due to overall weakness and by taking advantage of a computer's flaws. Now, humans can only manage a draw against computers because they're having to play more and more defensively. In the future, computers will be fast enough and the algorithms will be sufficiently "intelligent" that humans will lose against computers. If a top-level human player can beat another top-level human player, it only stands to reason that a sufficiently advanced chess computer can do the same.

      --
      Want to improve your Karma? Instead of "Post Anonymously", try the "Post Humously" option.
    8. Re:interesting by Anonymous Coward · · Score: 0

      If you assume that it is possible to be a better player than any human, and given infinite amount of time, then a computer will become better. All you need to do is implement a genetic algorithm to find the best evaluation function and run a mini/max search on the game tree (and since it is an infinite amount of time it can do the entire tree), the computer will win everytime (assuming that people are not able to generate the optimal path of course).

    9. Re:interesting by caluml · · Score: 1
      A car, or a human, goes at a certain speed. It's clear that however fast a human or a car moves, it's always possible to go 10 mph faster.

      299,792,458.8 metres/sec ?

    10. Re:interesting by Gherald · · Score: 1

      It's clear that however fast a human or a car moves, it's always possible to go 10 mph faster.

      It's also clear that however "deep" or "far ahead" a human or computer thinks about chess moves, it's allways possible to think 1 more move ahead.

      There may be a fundamental limit on how well it is possible to play chess.

      Well, yes and no. There is a finite amount of possible moves on an 8x8 chessboard with 16 pieces. With current computers it would take millions of years to find a list of the best solutions to the "problem" of chess, but the important thing to realize is that computers will eventually beat grandmasters easily, because the human mind will never be able to think that deep unaided.

  7. Moxy Fruvous on Chess Computers by kevinatilusa · · Score: 4, Interesting

    Moxy Fruvous did an amusing take on the topic a few years ago at MIT on their U.S. tour. The discussion made it on their "Live Noise" album as "Kasparov vs. Deep Blue", and a transcript is available at http://www.fruvous.com/ln-lyr.html about 2/3 of the way down the page. (Warning, there are a few instances of adult language in the discussion)

    1. Re:Moxy Fruvous on Chess Computers by CokeBear · · Score: 1

      Or you could just link directly to the blurb http://www.fruvous.com/ln-lyr.html#kasparov

      --
      Reality has a liberal bias
    2. Re:Moxy Fruvous on Chess Computers by darkov · · Score: 1

      Warning, there are a few instances of adult language in the discussion

      Wow. You're warning readers of Slashdot of bad language? You are obviously new around here. Your average reader has survived enough goatse.cx links and wayward postings to make them inpervious to almost any form of degengenrate behaviour, dehumanising abuse, sexual perversion and SCO legal claim.

    3. Re:Moxy Fruvous on Chess Computers by Anonymous Coward · · Score: 0

      Maybe you'd like to explain who the fuck "Moxy Fruvous" is before submitting. And USE THE FUCKING HREF TAG!

      Hundreds of thousand readers are going to read your stupid comment, and ALL of the are going to figure out who "Moxy Fruvous" is and then copying and pasting that link into their browsers. It would have taken you less than a minute to do us all that service. What's your problem?

  8. Sonas believes that watershed is not inevitable by Anonymous Coward · · Score: 0

    Please note the subtle difference between the theses: i) machines will not overtake mankind; ii) machines will not inevitably overtake mankind. Sonas asserts (ii), not (i).

  9. computer-aded chess? by myowntrueself · · Score: 1

    As long as its not another round of computer aided chess vs man... as I recall the last few times a 'computer' beat this guy, they had a team of programmers modifying the engine as the game was in progress.

    Its not cheating; its computer *aided* chess.
    Ahem.

    --
    In the free world the media isn't government run; the government is media run.
  10. still by toddhunter · · Score: 5, Insightful

    I consider it's still humans competing with other humans playing chess. On one hand we have a chess-master using all the power of his brain, on the other some computer people using a high-powered computer.
    When a computer can learn to play chess by itself and then beat the top players, then we have something to look at.

    1. Re:still by thelenm · · Score: 2

      What exactly is meant by "by itself"? Computers were invented by humans and are programmed by humans, and as such you can always see everything a computer does as (indirectly, anyway) the product of a human mind. Are you saying that you won't be interested in computer chess until such time as a computer springs into existence without human intervention and then somehow learns on its own how to play chess?

      I don't think we're ever going to see that happen, but if you're just interested in computers automatically (without intervention) learning how to play better chess from experience and study, well... those techniques have been around for decades.

      --
      Use Ctrl-C instead of ESC in Vim!
    2. Re:still by eric_ste · · Score: 1

      I think that there was a program called Knightcap that was araound a few years ago. It was a system that needed to be trained before getting any good.

      When you download it, it comes virgin and grows as you play against it.

    3. Re:still by Rubyflame · · Score: 2

      Someone makes this argument every time slashdot posts an article about chess. That it's really a contest between a programmer and a chess player.

      Quite frankly, this is bullshit. Or at least the programmer has a massive advantage. It's like saying that a race between an olympic runner and a car is really a test of skill between the runner and the driver. Well, it isn't. I doesn't take nearly as much skill and dedication to drive a car as it does to run a mile in four minutes. Writing a chess program isn't all that hard either.

      Yeah, yeah, I know, developing a grandmaster-level chess program is no piece of cake. But it takes a lot less time than it takes to become a grandmaster.

      Maybe this is gonna come off as trolling, but honestly, programmers just aren't that special. There are millions of programmers in the world. There are only a few thousand professional chess players, and they have to study constantly if they are to have any hope to compete.

      On the other hand, all you coders can feel good about yourselves: Your job is actually useful, as opposed to chess ;-)

      --

      All it takes is nukes and nerves.
    4. Re:still by Anonymous Coward · · Score: 0

      You obviously have never tried to write a world-class chess program. The amount of knowledge, experience, and thought that goes into a truly good chess program is mind-boggling.

    5. Re:still by Sivaram_Velauthapill · · Score: 1

      I think what he/she is asking for is a sentient being. Until a computer that can THINK for ITSELF (i.e. sentient), he says it is not worthy. Right now, the computer simply COMPUTES some pre-coded PROGRAM.

      In other words, he is asking for something that can EVOLVE by ITSELF. Right now, computers don't evolve--they die.

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    6. Re:still by stratjakt · · Score: 1

      It's a human vs human. One human has his skill and experience/talent, the other has a very complex tool.

      Machines dont "compete". They perform a function.

      --
      I don't need no instructions to know how to rock!!!!
    7. Re:still by Prune · · Score: 1

      This nonsense comes up almost every time computational intelligence is discussed on Slashdot.

      Saying that since humans created the computer, the chessplayer is not really competing against machine intelligence but human intelligence instead, is no different than saying saying, for example, that in a game between two humans, since evolution created the human brain the chessplayer is not really competing against human intelligence but against natural selection!

      Whether the chess playing algorithms are programmed in or learned is irrelevant. It's problem-specific intelligence whatever the source is. It only matters from a practical viewpoint: it's more efficient to program some stuff in, whereas other stuff is better learned. As for the human brain, the vast majority of the information processing algorithms in the brain is hard-wired by evolution, and learning is akin to fine-tuning (for introduction to evolutionary psychology see the stuff by Pinker, etc.)

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

      You were born without a hint of knowledge of chess, or even board games. Yet (I'm assuming) you can play chess. I think the original poster was talking about a computer that would learn and play chess the same way a person would. Not simply a program designed to play chess and learn from experience and study.

    9. Re:still by Dun+Malg · · Score: 1
      When a computer can learn to play chess by itself and then beat the top players, then we have something to look at.

      Indeed we will, because not even humans learn to play chess by themselves-- we learn it from other people. In the case of chess-playing computers, I see no real distinction between a man taught how to play chess by a master and a computer taught by a programmer. In terms of AI issues, yes, there's a difference; but this is just chess, not a Turing test.

      --
      If a job's not worth doing, it's not worth doing right.
    10. Re:still by BiteMeFanboy · · Score: 1

      Ok, until a human can THINK for ITSELF, it's not worthy. Right now, humans simply COMPUTE some pre-coded program. Furthermore, no human in the history of the world has taught himself chess. Except for the guy that invented it. Bad argument.

    11. Re:still by jvkjvk · · Score: 1

      I see no real distinction between a man taught how to play chess by a master and a computer taught by a programmer.

      Ok then, what about this modification of the statement:

      "when a computer learns chess from a master, as opposed to being programmed to play chess, with lookup tables, predictive branching specialized to chess, etc., then we have something to look at."

    12. Re:still by Sivaram_Velauthapill · · Score: 1

      I think you are wrong. Humans DO think for themselves--except when brainwashed by entites such as the governments :( People do NOT have anything pre-coded, except for some basic stuff like breathing, etc. Humans actually LEARN. Throw a human into a new environment, and he/she will adjust and learn things. We are definitely not REACTING to already known knowledge.

      Your idea seems to be along the line of Aristotle (I think it was him??), who claimed that humans already know everything there is to know, and they are simply re-learning what they have forgetten. I claim that is completely wrong and hence your reasoning is wrong too. We pre-compute almost nothing.

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    13. Re:still by Anonymous Coward · · Score: 0

      Fuckin' Paki.

    14. Re:still by BiteMeFanboy · · Score: 1
      Bullshit. I said nothign about allready knowing everythign there is to know. Human intelligence is a program like any other. It's nothing more than a tremendous amount of if-then-else's.

      Computers actually LEARN too. Most modern chess software, and many AI paradigms are based around learning. You might want to read up on the subject before spouting off.

    15. Re:still by Anonymous Coward · · Score: 0

      Actually, humans have a lot of precoded pseudo-behaviors. Most of these are very low level, but they are there. Think all behaviors that babies have and our autonomous nervous systems. There are also a ton of predispositions for certain behaviors, like what we like to eat, our ability to see (much of which is "hardware" dependent), etc.

      In fact, we also have a predisposition for speech, which is why we have such complex vocal apparatus. Certain types of thought, etc.

      No, none of these behaviors are generally complex, but they are all there, factory installed. It's why humans are observably human.

    16. Re:still by Sivaram_Velauthapill · · Score: 1

      Yes those things exist but it still doesn't change anything I said about learning. Consider your comment "...we also have a predisposition for speech, which is why we have such complex vocal apparatus." Note that there was a time when speech was very rudimentary. I doubt if we even spoke any "complicated" language 10000 years ago. We evolved, learned, and developed NEW speech. Similarly, humans didn't even write 5000 years ago. There are probably 500 written languages now but very few of them even existed 2000 years ago. What does this say? We LEARN NEW things--something automatons, like computers, haven't shown that they can do...

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    17. Re:still by Sivaram_Velauthapill · · Score: 1

      I still disagree with you. Human intelligence is NOT a program of if's and else's. You may end up modelling it at such, but the fact of the matter is that you will never duplicate the brain that way. This is mostly because of randomness.

      The modern computers that learn are very primitive and I don't think anyone seriously considers them to be learning.

      BTW, were you the guy who posted that racist remark above?

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    18. Re:still by BiteMeFanboy · · Score: 1

      What randomness? There's no more randomness in a human brain than there is in a computer. Just because you can't map it doesn't mean it's random. And no, I didn't post that. I may be abrasive, but I'm not a complete dick.

    19. Re:still by jjhlk · · Score: 1

      They compete in some tournaments, against humans and other machines. It's not the programmer versus the grandmaster, it's the product of a fleet of high-ranking programmers versus the grandmaster! It's a complex tool that needs to work on its own, which is certainly different from a person using a tool (unless we're talking advanced chess which I don't think is true in this case).

      I'm know I'm equivocating... as machines get better they'll make better analysis for humans, which I would consider their true function. Competition among humans and computers is just for fun.

    20. Re:still by Anonymous Coward · · Score: 0

      How is a lookup table or better search algorithms so much different from memorizing patterns? When chess machines are huge neural networks running on specialized hardware, will that be so much more interesting (well, sure, but just an evolution of chess programs as hardware and stuff becomes available)?

    21. Re:still by ccp · · Score: 1


      On the other hand, once there were thousands of blacksmiths.

      And your point was?

      Cheers,

    22. Re:still by TheLink · · Score: 1

      It's actually a contest between a top chess player + chess coaches + Fritz vs a bunch of decent chess players + programmers + a supercomputer.

      When you design a chess program, you'd definitely get the input of a bunch of decent chess players. And they definitely do.

      In between games, the bunch of decent chess players + programmers may spot why the computer isn't winning against the chess player and tweak things accordingly. That's why Kasparov was smart to say "no tweaks" in the recent game - that way he's playing against just the computer.

      Hey if I'm allowed to play computer aided quake, I bet I can put up a good fight against the top quake players too - I'd do the tactics and strategy, and the computer does the aiming, bunny hopping, auto dodging etc.

      Same goes for chess. Which is why I believe computers+humans will eventually beat the top human chess player. Seems inevitable to me.

      --
    23. Re:still by karnowski · · Score: 1

      When a computer can walk into the room, sit down at the chess board, make small talk, discuss current events, learn, sustain it's own existence, and then beat Kasparov in chess I'll be impressed.

      Computer chess programs are nothing more than glorified calculators.

  11. poor humans! by seringen · · Score: 2, Interesting

    chess is a finite problem, and although it's a very large finite problem, it's one that some day can be solved. I don't know why people care all that much about computers being able to beat humans, maybe they will just have to start playing each other. I'm only going to be worried when computers start writing more interesting stories than the top writers

    1. Re:poor humans! by AntiOrganic · · Score: 1

      There's mad lib generators that already do, if this is a top writer.

      Of course, he probably isn't.

    2. Re:poor humans! by sonoluminescence · · Score: 0

      I totally agree, computers beat humans everyday in specific situations.

      To tests this get a 368 and a list of 500 random of semi-random integers and see if you can sort them by hand low to high faster than the computer.

      Even a badly written sorting algorithm would obviously totally kick you're ass.

      It all comes down to the question of whether the problem (Chess) is more suited to a human mind or a machine.

      --
      Karma: Bad. Calmer, good.
    3. Re:poor humans! by Evil+Adrian · · Score: 1

      This is absolutely true, and likewise, humans beat computers in everyday specific situations.

      If you look at your mom's face, you instantly recognize her as your mom. If a computer "looks" at your mom's face and tries to recognize her, too late, you won.

      --
      evil adrian
    4. Re:poor humans! by Anonymous Coward · · Score: 0

      totally kick you are ass?

    5. Re:poor humans! by Anonymous Coward · · Score: 0

      You need the context and a little leeway:

      Even a badly written sorting algorithm would obviously totally kick you're ass

      the badly written sorting algorithm would kick. You are ass.

      Just a case of bad punctuation.

    6. Re:poor humans! by Anonymous Coward · · Score: 0

      >I don't know why people care all that much about computers being able to beat humans,

      I think the interest is the spectrium in which chess is played. If my chess program can analyze 1million positions a second, and I can beat it, do I analyze 1million positions a second also? The fundamental difference is computers can brute force more than any human, but the human can plan logically and stragitically.

      The question than remains, which is more efficient at playing chess, brute force analysis or an understanding of the position.

      For every position (question), there exists a perfect answer. When a checkmate is found, it doesn't get much better than that. However, without a definitive answer to the question, good guesses are proposed.

      Computers can guess good at the answer, for it can analyze the imballances in the position from every possible move in, say, 5 moves. Humans can rather see the differences in motives and ideas in both sides to produce an outcome that looks more appealing to the player.

      Computers can become better at chess than humans if humans can understand chess better. Combining brute force with understanding will show the difference.

      Chess programs are starting to learn, so I doubt we'll be having this conversation in 10 years.

  12. Man vs. Machine is really Man vs. Himself? by Anonymous Coward · · Score: 0

    Are humans really competing with machines, or with other humans (albeit not directly)? Is the computer simply bridging the gap between minds of different tastes?

    Didn't humans program everything the computer has as far as logic is concerned? Isn't the computer just running through the programmer's/designer's logic?

  13. Kasparov is a bad choice by Theatetus · · Score: 4, Interesting

    Part of the problem is that Kasparov is this generation's GM. Kasparov plays very emotional games. He's not just looking to beat you in his first match; he's looking to utterly destroy, smash and humiliate you with a dramatic and embarrassing win.

    This is a great strategy against people, but it's not so effective against computers. Kasparov is probably the worst chess master to pit against a machine since Ruy Lopez (I think he's won with the Ruy Lopez opening a few times, case in point: it's a brutal and humiliating play for the losing opponent).

    Kasparov knows that the computer can "think through" future moves better than he can. Computers, in fact, do the opposite of human chess players: we set goals and try to find ways to get there while computers search through various ways to find a satisfactory goal they can achieve. So, Kasparov plays it very conservative and keeps himself out of any situations that give the computer too much range of foresight, which is why the Kasparov/computer matches tend to look like Verdun (though he's been surprised a few times).

    Personally I'd like to see some of the younger generation take on the big programs. They tend to play more technically and less passionately than Kasparov and his generation.

    --
    All's true that is mistrusted
    1. Re:Kasparov is a bad choice by Anonymous Coward · · Score: 0

      Like Kramnik? He succumbed in the same way all these grandmasters do now. They win the first few games, then get tired and loose the last few games. The last bug matches have all been draws, but the human has always won the early games. This in my opinion is proof that humans are better than computers...we just get tired.

    2. Re:Kasparov is a bad choice by Theatetus · · Score: 1

      You know, I was precisely thinking of Kramnik. Give Vlad a few years to build up some endurance (Christ, he's only 28) and I think he might do really well.

      Mad props to your final sentence, though: computers can only beat good chess players after they get tired. I'm an extremely mediocre chess player who happens to enjoy studying the theory of the game. I can beat GNUChess readily in the first game, with difficulty in the second game, and almost never in the third and later games without a break of a few days. You have a great point.

      --
      All's true that is mistrusted
    3. Re:Kasparov is a bad choice by plierhead · · Score: 2, Funny

      You know, when I hear you say (re Kaparov):...."He's not just looking to beat you in his first match; he's looking to utterly destroy, smash and humiliate you with a dramatic and embarrassing win."...then I realise that we inhabit utterly different worlds. I could certainly be destroyed, smashed and humiliated if a drunken Hell's Angel knocked me out with a pool cue and strung me up from a streetlight by my underpants, but just because some other guy moved a few wooden pieces to better places than I did ? Naaaah.

      --

      [x] auto-moderate all posts by this user as insightful

    4. Re:Kasparov is a bad choice by Theatetus · · Score: 1

      Oddly enough, I've had my ass kicked by a Hell's Angel in Oceanside, CA (I figured since I was a Marine the other Marines in the bar would leap to my aid... ah, to be young and naive again).

      It was painful, but not terribly embarassing (though explaining to the MP's as I crawled back onto Camp Pendleton the next morning why I had 2 black eyes and shredded clothing was a little humiliating; I said I picked up a stripper and her pimp rolled me, it seemed less pathetic).

      I personally am not humiliated when I get my ass kicked in chess, because I suck at chess even though I enjoy studying it. But if my job were to play chess, I could definitely see getting humiliated by the sort of wins Kasparov gets against people (if you've never looked at his games, they're fascinating. He'll avoid a sure win in order to get the most cruel win possible.) Just my own thoughts on his style....

      --
      All's true that is mistrusted
    5. Re:Kasparov is a bad choice by asolipsist · · Score: 3, Insightful

      . Kasparov plays very emotional games

      I'm not sure what an 'emotional' chess move looks like. I can say this, kasparov's ELO has been over 2800 for quite some time (the highest rating in history). Younger players like rajdbov et all do not play more 'technically' than kasparov. He is the single greatest chess tactician ever, period (and an unmitigated jerk, meh) tactical brilliance.

      The really interesting thing is that a GM combined with a computer is MUCH stronger than a GM or computer by themselves. I think some rule alteration to put a human more on 'par' with a computer could help the man vs. machine idea.
      If they allowed kasparov to touch the pieces and move them on another board (like the computer can do perfectly in its memory) before making a move on the 'real' board, it might make the match more interesting. Also, as others have pointed out, humans get tired, this is the single biggest reason kasparov as faired somewhat poorly in the past.

      The reason machines are strong at chess at all is because a positional advantage can usually be translated into a material advantage within 7 moves or so (14 ply) as opposted to games like Go, so brute force tends to work. The trouble with computers is they will never blunder, never, so every move the human makes must be optimal.

    6. Re:Kasparov is a bad choice by semanticgap · · Score: 1

      Kramnik is the man right now, I agree. :-)

    7. Re:Kasparov is a bad choice by Scarblac · · Score: 2, Interesting

      Chess is boxing with the mind. Also, if you make no mistakes, it's a draw. As if that ever happens...

      If you lose, you truly have no-one to blame but yourself. No excuses. There is no random factor, you have full information, the game is initially equal. Losing without a chance after a lifetime of study hurts.

      --
      I believe posters are recognized by their sig. So I made one.
    8. Re:Kasparov is a bad choice by SashaM · · Score: 1

      kasparov. He is the single greatest chess tactician ever, period

      Funny, I always thought this was attributed to Alekhine.

    9. Re:Kasparov is a bad choice by Anonymous Coward · · Score: 0

      Huh? Mikhail Tal is the greatest tactician ever. Chess has moved on, like all human activities, and modern top grandmasters wouldnt have much trouble crushing the guys from the past. Kasparov actually wins most of his games from a superior strategic understanding, particularly of the transition from the opening into the middle-game.

    10. Re:Kasparov is a bad choice by msheppard · · Score: 1

      You have to choose Kasparaov. He's the best (not getting into the rating politics), and anyone else will have the HUMAN side screaming.

      Go Computer! Go Computer! Go Sox too.

      --
      Krispy Cream is people
    11. Re:Kasparov is a bad choice by Rich0 · · Score: 1

      I find it interesting that several chess matches were resigned by a human operator because the computer program didn't recognize it was beaten.

      One might argue that the program should be allowed to play out the position fully. It could require several hundred moves to force the computer to a loss or draw depending on the position, and it might be argued that the computer might still be able to win because it has the advantages of:

      1. Never blundering - easily a factor in a LONG but boring set of moves.

      2. Making its moves in a microsecond each when you're down to a few pieces. The human would take a second or two at least to avoid a blunder and could run down his time more.

      3. If losing, it can notice that a position only two moves away was repeated 75 and 183 moves ago. The human might not realize that he is about to give the computer a draw by threefold repitition.

      4. If drawn out long enough, the human will eventually need to go to the bathroom...

    12. Re:Kasparov is a bad choice by aurelian · · Score: 2, Informative
      Chess is boxing with the mind. Also, if you make no mistakes, it's a draw. As if that ever happens...

      Not necessarily; as far as I'm aware it's not yet known whether chess is a draw, a white win or a black win.

    13. Re:Kasparov is a bad choice by jjhlk · · Score: 1

      I find it interesting that several chess matches were resigned by a human operator because the computer program didn't recognize it was beaten.

      I've drawn Fritz in the endgame, when it was lost for me. Sure it was playing friendly, but I don't know why programs are so retarded in the endgame. Not so surprising to me.

    14. Re:Kasparov is a bad choice by TheLink · · Score: 2, Insightful

      If a match is an even number of games then if both play optimally it'll be draw.

      --
    15. Re:Kasparov is a bad choice by GlassHeart · · Score: 2, Informative
      the game is initially equal.

      No, somebody gets the first move. I don't believe it has been proven whether this is necessarily an advantage, disadvantage, or absolutely not a factor.

    16. Re:Kasparov is a bad choice by Rich0 · · Score: 1

      But playing Kasparov it certainly wouldn't be playing friendly!

      Usually easy modes on software just tell it not to use as much time searching. Could Fritz actually introduce blunders?

      You would think that once you get down to only a few pieces a database of solved positions could be employed. Once you're down to moderately few pieces a good computer can actually search the entire move tree.

      I'd expect the opening and the endgame to be the strongest from a computer's perspective. With the opening you have opening books which the computer has prefectly memorized. With the endgame you have few pieces and so it can search MUCH deeper than any human. The middlegame is where you get into murky tactics and logic-over-brute-force.

    17. Re:Kasparov is a bad choice by Cooker · · Score: 1

      The sides of the game are not equal: white, making the first move has a slight statistical and tactical advantage whereby he is first to propose the layout; inherently, in the beginning, white acts and black reacts. Of course, as soon as white makes an unnecessary or throwaway move, the odds even up.

      A large part of the strategy of playing black is devising a trap where white gets to feel overconfident, throws away moves, and hopefully loses pieces.

    18. Re:Kasparov is a bad choice by Anonymous Coward · · Score: 0

      >Chess is boxing with the mind. Also, if you make no mistakes, it's a draw. As if that ever happens...

      Actually, there have been a couple games played where you can analyze that the loser did not make any mistakes, and yet still lost. Very rarely does that happen, but if I can find a game, I'll post the score.

      >Not necessarily; as far as I'm aware it's not yet known whether chess is a draw, a white win or a black win.

      Actually, it should be a win for white. You can't dismiss the initiative that quickly. There is a few varients that show how to take advantage of the ititiative. Like, 3pawns vs 3pawns. White wins, but with proper tringulation and best play, black can win if white errors.

    19. Re:Kasparov is a bad choice by Anonymous Coward · · Score: 0

      >I'm not sure what an 'emotional' chess move looks like. I can say this, kasparov's ELO has been over 2800 for quite some time (the highest rating in history). Younger players like rajdbov et all do not play more 'technically' than kasparov. He is the single greatest chess tactician ever, period (and an unmitigated jerk, meh)

      Actually chess ratings are highly inflated, so just because his elo is so great, doesn't mean anything. He plays against the same handful of people that he prepares against well. Its easy to gain points that way.

      Also, emotional chess is chess that you don't make the best moves on purpose. Case in point. Lets say you know pawn takes pawn is the best move on the board. Nothing better. You know there is nothing better. But, you choose to move your bishop instead. You knows its not as strong...that its inferior. But, you know your opponent so well, that will be the best move against him. You know that moving that bishop will cause him distress, and unnecessary time trying to play against it.

      Sure, it doesn't lose. But, its psychological damaging. Its like if Kasparov was actually very nice to Shirov before a game, and actually said a word to him...but, I don't think Kasparov would actually go that low.

    20. Re:Kasparov is a bad choice by jjhlk · · Score: 1

      I don't think it would purposely blunder if it had an obvious mating pattern in the endgame (I don't play so badly it would scale itself like that!). But maybe it couldn't search quick enough with how it was setup.

      I think generally engines still aren't great in the endgame, except - you're right - if they find the pattern in their tablebase. The version of Fritz I had came with a tablebase generator. It can generate 30 gigs of endgames! And that was only with 5 or 6 pieces max.

    21. Re:Kasparov is a bad choice by Anonymous Coward · · Score: 0

      Actually, if you do not have tablebases, computers can't play endgames. heres why.

      If you take Rook and Pawn Vs Rook, humans can solve that no problem, if they understand the basics of KRP v KR. Sure, they might not be able to spit out the upwards of 100 moves it will take to claim the win, but they know how to play it.

      A computer will calculate the 9 legal moves for the king. The 15 legal moves per rook, and the pawn moves.

      So, looking at the position 5 moves later will take like 22^10. Thats a large number. And, 25^9 moves will probably have the same analysis as +1 for the RP.

      Now, in this position with 100 moves to win, after 5 moves, and all that calculating, the human will be 5 moves closer to winning, or closer to drawing if in the inferior side, and the computer will be at the same point.

      Introduce tablebases. All legal moves with 3, 4, 5, and some 6 piece endgames will show how many moves to win, and what the moves are. Like an opening book in the endgame. If the computer has that, no chance for the human. However, it was made by a human, so there are still instances in tablebases where it is flawed.

      As for openings - they are designed by humans. Opening theory is constantly changing. So, for us mortals, its good enough for us. But players like Kasparov who is constantly adding to opening theory, computers aren't that good.

  14. does the computer do a dance? by blah1019 · · Score: 5, Funny

    Like when a player scores a touchdown? Or do the programmers wheel it around in circle chanting it's name? You gotta let them have a little fun. Better then making them mad and having them go Terminator on us.

    1. Re:does the computer do a dance? by Anonymous Coward · · Score: 0

      I, for one, welcome our new Chess/Terminator overlords!

    2. Re:does the computer do a dance? by KrispyKringle · · Score: 1
      I think it was Kasporov who claimed--and this appears to be a very Kasporovian thing to do, from what I've heard--that the IBM technicians administering Deep Blue cheated by having speakers attached to the machine (why would it have speakers, anyway?) play speech-synthesized clips from Shakespear to insult him, distracting him during his turns.

      I honestly can't remember where I read this, and whether it was parody or real. But the thought is pretty funny.

    3. Re:does the computer do a dance? by magores · · Score: 1

      I dunno if Arnold Shwaren-whatever plays chess, but as a resident of California, I REALLY DO have a Terminator overlord.

      (BTW.. Fuck him and George Bush too.)

    4. Re:does the computer do a dance? by pommiekiwifruit · · Score: 1

      I seem to remember that one computer chess program tried to electrocute its opponent when the computer was losing. Sore loser!

    5. Re:does the computer do a dance? by kylecito · · Score: 0

      maybe it become self-awa... I mean, becomes the next monkey guy...

      DEVELOPERS !!!
      DEVELOPERS !!!
      DEVELOPERS !!!
      DEVELOPERS !!!

      --

      --
      Backup not found: (A)bort, (R)etry, (S)uicide

  15. Answer: neither will win. by Anonymous Coward · · Score: 0

    Once the aliens spend perhaps an hour covering the rules of chess, they'll slap us and our machines silly.

  16. Go (slightly OT) by Llywelyn · · Score: 4, Interesting

    Not to get too off-topic, but there are also now several (increasing) prizes for beating top ranked players (well, rather, any professional player and occasionally there's a prize for beating a dan ranked amateur) in Go.

    For those of you who are unfamiliar, there is an excellent, if somewhat dated, article that discusses some of the difficulties for getting a computer to play Go well. It also talks about Janice Kim, a 1 dan (professional) at the time (now a 3 dan), beating the then-best program when the computer had a 25 stone handicap. To give an idea, a 9 stone handicap in an experimental games between evenly matched professionals generates about 140 point advantage.

    As I said, it is a bit dated (5 years old) and computers have improved, but we are still nowhere close to beating a professional.

    --
    Integrate Keynote and LaTeX
    1. Re:Go (slightly OT) by Theatetus · · Score: 1

      Not OT at all, IMO. Compare how easy it is to beat whatever version of Go comes with your Linux distro with how hard it is to beat a COTS chess program on "hard" setting.

      Chess relies to a large extent on intuition and imagination, but Go relies almost solely on it. I think it might have something to do with the more strict rules of chess. Show a grandmaster a chess board that was achieved by legal moves and (s)he can usually memorize it; show him/her a "random" board and (s)he cannot. Go is not so simple; almost any configuration can be the result of legal moves. I might say it's an East/West thing but that sounds trite.

      --
      All's true that is mistrusted
  17. Infinite Chess by c0dedude · · Score: 2, Interesting

    I was wondering a while ago if chess could be set out into a possibility tree with work such as seti@home where one players actions will always be counterable. Theoretically it's possible, but i haven't done the preliminary calcs to determine processing power necessary/time/etc. Your thoughts?

    --
    Since when has this country used intellectual elite as a pejorative term?
    1. Re:Infinite Chess by jbellis · · Score: 4, Informative

      read rec.games.chess.computer. the search space is WAY the hell too big.

    2. Re:Infinite Chess by mikeg22 · · Score: 1, Insightful

      If you are talking about solving a chess position using a distributed network of computers (like seti@home), this would not work incredibly well. The problem would be communication between the nodes of the network. Chess is not a problem that can be solved completely in parallel, the different parts of the problem tree are dependent on other parts...they would need to communicate very efficiently for a system like this to work. On the internet, the response time between nodes is just too high for the system to work efficiently past one or two ply into the tree.

    3. Re:Infinite Chess by c0dedude · · Score: 1

      Not only that, perhaps a more interesting question: If a player could always win in chess, would it be the one who goes first or second?

      --
      Since when has this country used intellectual elite as a pejorative term?
    4. Re:Infinite Chess by thelenm · · Score: 4, Interesting

      Although the entire search space of moves obviously hasn't been explored, it's generally considered an advantage to be White (White moves first). With the first move, you automatically get the initiative, and at the highest levels of chess this can be a great advantage. My guess would be that if the entire search space could be enumerated, chess would either be a draw (more likely) or a win for White. I really doubt it would be a win for Black.

      --
      Use Ctrl-C instead of ESC in Vim!
    5. Re:Infinite Chess by r00zky · · Score: 1

      how big?
      (in libraries of congress if possible, please)

      --
      I'm a chainsmokin' alcoholic sociopath, so-ci-o-path
    6. Re:Infinite Chess by void* · · Score: 1

      Chess engines are basically alpha-beta searches - generate the move list, search a ply deeper, etc. Often with tricks to generate the move in a 'likely best' order.

      It wouldn't work well for a seti@home type setup, but you could probably build a good cluster solution. Gen your move list, farm calculating the value of each move off to a different node, telling it how man plies to look. That node report the score of that line back to the main node, and perhaps gets a new move to look at in the meantime. the sub nodes could probably go through the same process, but you'd need a good resource allocation system - eventually you'd get to the point where one processor is doing some subset of the search on it's own (as if it were a one processor box starting from some position), but you'd gain the ability to searcgh subtrees in parallel.

      Deep Blue was a multi-proc machine (with specialized processors), it's not something that can't be parallelized.

      --


      Code or be coded.
    7. Re:Infinite Chess by Nucleon500 · · Score: 1
    8. Re:Infinite Chess by etyam · · Score: 1

      I am not sure what you mean with search space. But the number of legal chess positions has been proven to be larger than the number of atoms in the Universe.

    9. Re:Infinite Chess by mikeg22 · · Score: 1

      There are many positions in chess where having the initiative is a bad thing, and inevitably lead to a loss. This is called "zugzwang." The opening position may be a zugzwang position for white...My gut tells me that there are more positions where having the initiative is advantageous, but I don't know if there is any statistical data to back this up.

    10. Re:Infinite Chess by DaneelGiskard · · Score: 1

      So when we are there, they would just flip a coin at the start of the match and the one who wins also automatically wins the game?

    11. Re:Infinite Chess by Rich0 · · Score: 1

      Honestly, I think this is completely up in the air, and unlikely to be solved in the near future.

      Sure, white may tend to win because of human initiative, but that is only because of how we play chess. It could easily turn out that black has a winning response to any white opening move.

      There is a game based on starting with a set of pieces and removing 1, 2, or 3 at a time. The person taking the last piece wins. With certain starting conditions it can be proven that the second player to move always wins. Chess could be like this in the end.

      It would seem strange if it were, but playing a game using strategy and playing a game knowing the solution to the game are two entirely different beasts.

    12. Re:Infinite Chess by jjhlk · · Score: 1

      I think Kasparov once said that white can guarantee a draw, but black cannot. I don't know what he was basing that on, though.

    13. Re:Infinite Chess by Bizaff · · Score: 1

      I believe the advantage is to White. There are some positions where having the move is bad (zugzwang), but these are few and far between.

      The books I've read generally state that one of White's main goals is to push the initiative with the first move, and one of Black's main goals is to equalize as quickly as possible. As openings have been explored more and more in depth, it generally takes Black longer and longer to equalize. Soooo, I'm guessing that Black being favored to win is highly unlikely.

      If I had to choose, I'd guess with perfect play, games are draws. The funny thing is, a lot of the innovation in chess games comes by introducing an uncommon or unforeseen move into a well known opening.. if your opponent doesn't know how to respond, you have an advantage, because theoretically you've worked up some followup strategery to continue. But, if there is so called "perfect play", that would lead me to believe there's one and only one game path to follow - anything else isn't perfect. So it comes down to following the one simple game path to an inevitable draw, or choosing a slightly inferior move with the hopes your opponent can't find the correct move to take advantage. If this is the case, the computer simply (ha) needs to have the perfect game as the default path, and the responses to take advantage of inferior moves that stray from the path.

      I spose if this were an easy problem, it would already be solved.

      I'd guess the same problem exists for Go, and any other strategy game with full information available to both players - as opposed to say, poker, where you know what cards you have and no one else does. The only difference is the problem space.

  18. Hundreds of female grandmasters? by Anonymous Coward · · Score: 0

    A hundred, perhaps.

  19. Can the human preview the computer this time? by wrinkledshirt · · Score: 1
    I did a very quick reading of TFA, and wasn't able to figure out if a gripe from past man-v-machine matches (that the man wasn't allowed to review the machine's playing tendencies, whereas the machine had a database full of the man's matches) was going to be true again for this matchup.

    Anybody know?

    --

    --------
    Bleah! Heh heh heh... BLEAH BLEAH!!! Ha ha ha ha...

  20. Distributed client by LePrince · · Score: 1

    Why don't they create a distributed client that could be ran by thousands of people at the same time to compute results? Like Distributed.net... I certainly would run such a client on my PC for the time of the tournament... I know the Fritz machine is REALLY fast, but heck, it can't be faster than 25 000 computers all running at the same time to compute the moves...

    1. Re:Distributed client by Anonymous Coward · · Score: 0

      Unfortunately, the A* search algorithm only scales linearly as a function of the number of processors, so 25,000 computers won't search 625,000,000 times as fast as one would hope, but only 25,000 times as fast. That's the reason people give for not doing it.

    2. Re:Distributed client by damiam · · Score: 1

      It'd be very difficult to make sure the returned data was legitimate: someone could poison the results and give Fritz bad moves. That's not really a problem for d.net: they can always just verify the results on another computer. For Fritz, time is critical, and the network overhead would already be eating a lot of it.

      --
      It's hard to be religious when certain people are never incinerated by bolts of lightning.
    3. Re:Distributed client by An+Onerous+Coward · · Score: 1

      I don't think it would be that big a problem. The main problem is the vastness of the search space. Verifying that the path that returns the highest score really should return that score is trivial in comparison. And if it turns out that the highest score is bogus, go to the runner up and check that one.

      --

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

    4. Re:Distributed client by LiquidCoooled · · Score: 1

      Couldn't we just use something like google's PageRank system - have millions of little chess playing pigeons poking away?

      --
      liqbase :: faster than paper
    5. Re:Distributed client by An+Onerous+Coward · · Score: 1

      I know I'd pay good money to see it.

      --

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

  21. it would be interesting by OwlofCreamCheese · · Score: 1

    I think the real interesting test would be to require the computer to run at a clock speed comparable to a human. Then this would be a true test of AI. Deep blue's wires are so much quicker than a brain's connections that it is getting maybe a year's worth of thinking time compared to the human. it would be interesting if a computer could play chess without the huge advantage of speed.

    --
    -You're wasting your time. Alfador only likes me.
    1. Re:it would be interesting by damiam · · Score: 1

      No, it would just be a blowout by the human, if it were even possible to arrange such a thing (which it's not, the human brain has no clockspeed and works so differently from any computer that their speeds cannot be compared).

      --
      It's hard to be religious when certain people are never incinerated by bolts of lightning.
    2. Re:it would be interesting by OwlofCreamCheese · · Score: 1

      of course its not a 1 to 1 thing. but from an AI stand point its not really that the computer is doing anything inteligent...its just doing things quick (search trees). even a computer that can beat every single person on earth is 'less efficent' if it does so just because its running at the speed of light. whatever complex algorithm humans use to play chess is being run on a ball of meat at the monsterously slow speed of nerves (which are not just wires) ... its scary that it is almost as good as one run on processors that can push information at nearly the speed of light.

      --
      -You're wasting your time. Alfador only likes me.
  22. do, you, want, to, play, a, game? by sonoluminescence · · Score: 0

    Are chess computers improving faster than grandmasters?

    Sooner or later both the computers and the top players will be able to work out every move from both ends of the game (i.e. the start and the end)

    When this happens they'll realize it's all pointless and start nuclear war instead.

    --
    Karma: Bad. Calmer, good.
  23. slashdot != sexist by pla · · Score: 3, Insightful

    I notice that the question is "Man vs. Machine". You completely ignore the hundreds of grandmaster chess players that happen to be female.

    Name a few.

    Any in the top ten?

    Didn't think so.


    More importantly, the article mentions a match against Kasparov, most certainly a male. Thus, although we can philosophically ponder the bigger question of "human vs machine", the title has no sexism involved, without even resorting to a discussion on the use of the masculine neutral in English.

    1. Re:slashdot != sexist by Anonymous Coward · · Score: 0

      She's 11th.

    2. Re:slashdot != sexist by pla · · Score: 1

      She's 11th.

      Good, at least someone caught my intention in asking about the top-10. ;-)

    3. Re:slashdot != sexist by Anonymous Coward · · Score: 1, Funny

      You know what makes men better than women? They can count to 21 by using their penis.

    4. Re:slashdot != sexist by Anonymous Coward · · Score: 0

      nothing was ignored, the current top players is irrelevant. if it was talking about the specific people around now, then it should be 'A man vs Machine', or '10 men (and one women if none of them turn up) vs Machine'.

      'man vs machine' is sexist, unless resorting to a discussion on the use of the masculine neutral in English.

    5. Re:slashdot != sexist by blitz77 · · Score: 1

      She's actually equal 10th based on ratings. Just check good old www.fide.com

    6. Re:slashdot != sexist by jwysocki · · Score: 1

      Grand Master Judit Polgar ranks number 11 on the latest FIDE list but she is the only female in the top 100. http://www.fide.com/ratings/download/oct03top.txt

    7. Re:slashdot != sexist by Anonymous Coward · · Score: 0
      Bollocks.
      Go and learn English.
      if it was talking about the specific people around now, then it should be 'A man vs Machine'
      Then why not 'A man vs A Machine'?

      Just because you believe it to be sexist does not make it so. I believe you to be an ignorant troll, but my belief does not make it so either.

    8. Re:slashdot != sexist by Anonymous Coward · · Score: 0

      Don't be ridiculous. "Man" does mean "human" and nothing else. It has never referred to men, that is, human beings of the male sex.

      How many grandmasters are male is of course completely relevant. Do you think that if all grandmasters were female the title would have been "Woman Vs Machine"? Didn't think so.

    9. Re:slashdot != sexist by Anonymous Coward · · Score: 0

      Yeah, well, if she's so great, how come she can't spell 'Judith' properly.

  24. Humans will improve with machines for a while by scruffy · · Score: 1

    I think human play will improve as machines improve until humans can't keep up with the machine anymore. It's hard to say when that happens because chess is an exponential problem. 10-20 years, I think.

  25. Philosophical reason why.. by the+uNF+cola · · Score: 0

    I think humans may always surpass due to those things you can't imitate, like creativity, or emotion. It's those little things that make us humans, that make us so much better at things. It's those things that don't make us basic animals.

    --

    --
    "I'm not bright. Big words confuse me. But Wanda loves me and that should be enough for you." - Cosmo

    1. Re:Philosophical reason why.. by momerath2003 · · Score: 3, Funny

      Oh, yes indeed. Because emotion is such an important part of playing chess.

      --
      I had but a simple dream, to destroy all humans.
    2. Re:Philosophical reason why.. by cynicalman · · Score: 1
      I know you're trying to be funny, but emotion is a big part of chess...

      Ruy Lopez (the man behind the opening) suggested placing the chessboard in such a way that the sun would reflect into the opponent's eyes.

      It's not uncommon for a player to make a bold sacrifice, even if it creates a slight disadvantage tactically, for the sole purpose of creating uncertainty across the board.

      Sometimes you can trick your opponent into moving too fast if you start moving fast.

      Or, if you're just a jerk you might smack the clock or bang your pieces down for a little intimidation action.

      Each of these tactics are primarily aimed at triggering an emotion (generally fear, but sometimes anger) in an opponent so that they will not play at their highest level.

      Chess is emotion.

      On a side note, remember the old SNL sketch "High School Chess Coach"?

      Pawn to Rook 4, Pawn to Rook 4!!! You call that castling?!? Why don't you just give him the king, give it to him?

      --
      the cynicalman - http://blog.geeksmithology.com
    3. Re:Philosophical reason why.. by Anonymous Coward · · Score: 0

      Yes, but this is humans simply playing to the weaknesses of other humans. A computer won't be intimidated / angered, etc... so in fact the emotion is a weakness for the human, not an advantage.

      Why are people so arrogant to think they are the perfect creation? Humans are just machines, but without the advantage of designed, modular software. People are hard to upgrade, and hence will eventually become obsolete.

    4. Re:Philosophical reason why.. by Anonymous Coward · · Score: 0

      Hard to upgrade?! They upgrade themselves! (after 15 million years)

  26. What about Go? by Anonymous Coward · · Score: 2, Interesting

    Computers are only good at chess for two reasons:

    1) They can brute force the game. On the 8x8 board there is a very limited number of permissible moves at any given moment, and an even lower number of desirable ones.

    2) They can easily tell if a move benefits them. Chess is a game where its very easy to look at the board and say who's winning. Board position, captured pieces, influence are all key points that anyone can spot at a glance.

    In my eyes, this just isn't a challenge, but straightforward application of raw computing. If the programmers want to impress me, they'll create a program that can play Go. As of this post, there still isn't a program in existance that can consistantly defeat a shodan (beginning level pro). Why? The 19x19 board and the ability to play just about ANYWHERE on it makes the game much more difficult to brute force. Also, strategy is much more complicated and board positions take a very experienced player to accurately analyze (at least in games involving professional-level players).

    No, Chess may become the dominion of the machines, but I won't consider it a statement of supremacy until they can beat us here. That should be the programmers' next challenge.

    1. Re:What about Go? by centralizati0n · · Score: 1

      The thing with chess is that now a days, most program for computers just have records for games with Masters / Grand Masters. They analyze those games to find out what to do. Unless you want to wait a loooonnnnggg time, computers still don't completely brute force a game. Go can be done... its just that you would need a REALLY powerful chip to brute force all those combos in less than say... a few years...

    2. Re:What about Go? by Llywelyn · · Score: 1

      >They analyze those games to find out what to do.

      There is no reason why you couldn't do the same thing with Go. We have game records for thousands of games by professionals, because there are so many possibilities its much more difficult to deal with.

      Remember that, if anything, Go is a much older game than chess is.

      >Go can be done... its just that you would need a REALLY
      >powerful chip to brute force all those combos in less than
      >say... a few years...

      I'm not sure you emphasized "REALLY" enough.

      Lets put it like this, blatantly ripping Mechner's analysis: Providing that, out of the 200-some-odd number legal moves (average) at any given point in a Go game can be narrowed down to 15 or so "good moves" and that this program could evaluate 200 million moves a second, it would still take 70 years to do what Deep Blue did in *three minutes*.

      To top that off, we still don't have a program that can accurately evaluate a *single* position of Go (though they are getting somewhat better), much less 200 million of them.

      There really is far far more to this than just a "really powerful chip." Even with enormous computational power, we still couldn't brute force our way through it simply because of how big the problem really is.

      --
      Integrate Keynote and LaTeX
    3. Re:What about Go? by SlipJig · · Score: 1

      This is a common (and I think valid) comment from Go players, and it's often mentioned to support the idea that Go is a "better" game. One highly-ranked Go player I knew was very snobby in this regard.

      I think it's true that the search space for Go is much larger than for chess, but I suspect it's not so great as the Go players sometimes make it out to be. There are two factors in chess that provide variability that aren't really present in Go: first, in chess, the pieces are different. A knight on a given square is not the same as a rook on that square, whereas in Go a stone is a stone. Second, in chess the pieces can move repeatedly, and each move has multiple effects - it removes a piece from one location and adds it somewhere else. In Go, once you place a stone it stays there until it's captured.

      Personally, for me the whole thing is moot, since I don't play either chess OR Go very well ;) They're both sufficiently beyond my ability to master that to me they're equal in terms of difficulty. But I'd be curious to see a comparative study that takes the factors above into account.

      --
      Read my keyboard review.
  27. naivity by mOoZik · · Score: 4, Insightful

    It is simply naive to say computers will never be able to outdo human thought, such as that required for chess or other logic/pattern-recognition based tasks. This is analogous to 19th century Royal Society scientists claiming one could never escape the Earth's gravity into space and beyond (and providing "proof," mind you). But I digress. Chess is not so much about logic and thought (in the normal sense) as it is for pattern recognition and "looking ahead." The best chess players in the world have nearly memorized all the possible combinations in all the possible scenarios, contrary to popular belief that their abilities are innate. I don't know if software has evolved enough to beat him this time around, but if the second math was any indication, my money's on the machine.

    1. Re:naivity by civilengineer · · Score: 1

      computers have already surpassed humans. The matches that are being played these days are not against against the strongest computers. If you pit the strongest computer(the japanese supercomputer) against the strongest human(kasparov), the human has near zero chance of drawing , forget winning.

      --

      New year Resolution: Don't change sig this year
    2. Re:naivity by Evil+Adrian · · Score: 1

      the human has near zero chance of drawing , forget winning

      I don't think any paths in chess that guarantee wins have been discovered. You'd have to assume that the computer can see a guaranteed path to victory close to the start of the match, but I don't think that's possible (too many possibilities, too much branching.)

      --
      evil adrian
    3. Re:naivity by barawn · · Score: 1

      You're wrong.

      None of the modern computers even considers brute-forcing the move tree - it's impossible. The search space is far too big, and considering some moves/board configurations can loop back on themselves, it's nearly infinite. Brute-forcing the move tree is simply useless.

      That being said, all the major chess programs nowadays are not limited by hardware, but by software. Throw better hardware at them, and they will not play better chess.

    4. Re:naivity by mOoZik · · Score: 1

      No, I am not wrong. Look at the game where the human lost. It's all about probability, risk, and previous plays. Taking all those into consideration and making a partial tree of the "foreseeable future" will almost guarantee the computer a victory.

    5. Re:naivity by civilengineer · · Score: 1

      You don't see a path to end. You have a set of openings lines that are analysed to a particular depth. If you play out the opening 10-20 moves right, you will get an equal position or slight advantage. (these openings are pusblished in books like modern chess openings). They are thoroughly analysed everyday and you have to be up to date to be a GM. If you make a mistake in the opening 10-20 moves, you already lost. This position is denoted as +- if its white who is winning and -+ if its black who is winning. The rest of the game from there is a formality. Most GMs resign if they are there. If you play out the opening right, you will get an equal position or a slight advantage, and most GM games proceed from here, after which there is manuevering to create a weakeness or exploit the already available advantage. Any weak move that is not positionally correct will result immediately in +- or -+. Nobody plays games till checkmate, atleast not GM level. Once +- or -+ os reached the game is over.
      The power of computer comes in the openings. GMs do a lot of preparation and based on current theory memorize the first 10-20 moves assuming they are right. But, many times, there are 'novelties' played between 10th and 20th move and this comes as a surprise to your opponent. You have to find the correct response from there. Your memorized lines will be of no use now.
      A powerful computer can come up with well analyzed novelties in dozens for each opening. They are already doing so. GMs prepare for their games using computer analyzed lines and novelties. So, there are not "Too many possibilities and too much branching".

      --

      New year Resolution: Don't change sig this year
    6. Re:naivity by Saeger · · Score: 1
      Sometimes it's not just naivity that makes a person think we'll forever be at the top of the intellectual food chain -- sometimes it's just plain old fear (conscious or not).

      Once a person has been introduced to the inevitability of the evolution of smarter-than-human intelligence, they can no longer claim ignorance, and either accept it or go into denial like most people because the future shock is too much for old belief systems to handle, or too fantastic for bitter cynics who didn't get their promised flying cars.

      --

      --
      Power to the Peaceful
    7. Re:naivity by civilengineer · · Score: 1

      Sorry, but I don't think I'm wrong. You don't have to brute force a move tree to win. For a given opening you have to ananlyze all the previously playes games and come up with a couple of novelties. That will give you an advantage. From, there you can manuever to increase your advantage. If you come well prepared, you will put your opponent in time trouble as he will have to come up with right response for the moves on the fly. Today's computers are limited by software, yes, but the limitation is that the software is not parallel processing software. They run on dinky single processor or dual proessor machines. If you build a cluster of say 10 strongmachines, that's engough to crack any human. You don't have to calculate the whole tree from beginning to end. But, to calculate the limited number of moves, you need mroe processor power.

      Throw better hardware at them, and they will not play better chess.
      Why do you think Kasparov lost to deep blue? Because they used more powerful hardware!! That was in last decade. If you spend the same amount of money today, you will get a computer so powerful that humans can dream of a draw againt that machine.

      --

      New year Resolution: Don't change sig this year
    8. Re:naivity by donnz · · Score: 1

      and if the boffins are successful at designing nano circuits then the power of future processors is literally unthinkable. God know how we would program them...

      --
      -- Free software on every PC on every desk
    9. Re:naivity by barawn · · Score: 1

      Why do you think Kasparov lost to deep blue? Because they used more powerful hardware!! That was in last decade. If you spend the same amount of money today, you will get a computer so powerful that humans can dream of a draw againt that machine.

      I'm guessing you didn't hear about any of the contraversy regarding Deep Blue vs. Kasparov. Deep Blue seemed like a computer built and programmed to beat Kasparov, not a general purpose chess program. There are other concerns (they didn't open up the source, etc.) - it's a longstanding controversy in chess programming.

      and come up with a couple of novelties.

      If you can have a computer do that, you've just solved the hard AI problem. The only known way for computers to play "good chess" is to brute force the move tree. If you want them to do better than that, you prune the tree, and program in a bit of logic. Logic doesn't improve with processor speed. Only brute forcing the move tree improves with processor speed, and we've already established that brute forcing the move tree is futile.

      Look, the simple counterargument is that if computing power led to chess playing power, then the computing power of computers should be growing as processing speed, and it's not - computers haven't won a match vs a Grandmaster since Deep Blue, and see above regarding the controversy regarding Deep Blue, which is definitely well-founded. In fact, they've tied every match since what, 2000? And computing power has increased by how much since then?

      It's not the hardware, it's the software. No one's repeated Deep Blue yet, so you can't "definitively" say that hardware wins.

      Who knows, Deep Junior could've beaten Deep Blue. The controversy is that we'll never know, so your argument is all speculation that Deep Blue was super-ultra-mega-computer.

    10. Re:naivity by barawn · · Score: 1

      No, I am not wrong. Look at the game where the human lost. It's all about probability, risk, and previous plays. Taking all those into consideration and making a partial tree of the "foreseeable future" will almost guarantee the computer a victory.


      Will almost guarantee. The problem is that the computer can't think - it can just run what it was programmed to do. When a human sees that the computer is reacting to something, he changes his/her strategy - something the computer cannot do, if the human stepped outside the bounds of the programmed "forseeable future". That turns your almost guarantee into the episode of Star Trek where Data plays a strategy game perfectly against a human, and loses. When the human realizes the program's boundaries, the human has an advantage.

      Your solution will only work when computers can reprogram themselves.

      Look at the games where the human won. It wasn't because the computer ran out of time, or was under time pressure. It was because the human outplayed the computer - the human pushed the computer outside where it had pruned the move tree.

      In several games the human operator had to offer to resign for the program, because the program hadn't realized that it had lost. Apparently its program didn't look down the portion of the move tree that was obvious to a human watching.

      What we're comparing are two different methods to solving a problem: pattern recognition, and trial and error. Trial and error is impossible, because the state space is too large, as has been established, so programmers use tricks to trim the state space. The problem is if their tricks aren't perfect, pattern recognition can always win, because there exists a winning solution outside of the trimmed state space.

      The original parent said that faster hardware => a guaranteed computer victory. This is plainly false: faster hardware will not eliminate the flaws in trimming the state space, and a good enough human player will be able to find the flaws.

      Maybe someone will eventually write the "perfect chess program", which trims the state space perfectly into something manageable. But we're not there yet - no way.

    11. Re:naivity by civilengineer · · Score: 1

      i heard all of Kasparov's rant. he is well known in chess circles for a big mouth. The point is that he lost. He will lose again today. Period.
      He lost 3.5-2.5 mind you. So, even you say that computer was tailor made for him, and won by luck in the last game you have to realize that a computer made with same amount of money today would beat him easily.

      It's not the hardware, it's the software. No one's repeated Deep Blue yet, so you can't "definitively" say that hardware wins.
      That was in 1996! That's 7 years ago! I'm sure you know how much computers changed since then. Yes Deep Junior might beat Deep blue. But, if you run Deep Junior strength program on a cluster, there is no doubt that kasparov, kramnik and anand sitting togehter can draw against it.

      --

      New year Resolution: Don't change sig this year
    12. Re:naivity by civilengineer · · Score: 1

      Err.. correction that was in 1997. So only 6 years ago not 7, but far enough in past.

      --

      New year Resolution: Don't change sig this year
    13. Re:naivity by HuguesT · · Score: 1

      We'll see about the inevitability of what Ray Kurtzweil writes. Exponential growth are the stuff of pyramid schemes and bubbles. They all end up collapsing and deflating respectively.

      Indefinite exponential growth in computing power also assume that human effort is infinitely dividable, infinite energy resources (cool those CPUs, man) and that all finite processes can easily be solved by standard computing solutions.

      All of those assumptions are false. Even the last one isn't, NP-complete problems, anyone?

      If/when quantum computation becomes feasible I'll reconsider that judgment.

    14. Re:naivity by Rich0 · · Score: 1

      The original parent said that faster hardware => a guaranteed computer victory. This is plainly false: faster hardware will not eliminate the flaws in trimming the state space, and a good enough human player will be able to find the flaws.

      However, faster hardware does eliminate the need to eliminate as much of the state space, thus removing some of the human advantage.

      Consider the ultimate extreme - a computer capable of analyzing the full search space of chess in 1 second (probably not possible to engineer using all the matter in the universe). This computer simply cannot lose against any player who isn't capable of doing the same. The program doesn't need to recognize patterns, it just picks the best route to victory under the current conditions, and adjusts it after each human move.

      Obviously this will never happen, but suppose you have a computer capable of fully searching 30 moves. I'd argue that no human could beat that either - while not a full game ahead it is close enough. Now consider 20 moves - we're still probably unbeatable. At this point we're just arguing degree - eventually a computer will come out capable of searching deep enough to beat a human.

      Remember, the computers playing chess these days rely more on smarter software than brute force. They don't represent the state of the art in CPU power or storage. I'd argue that the best computers today running the best software would do even better than what we presently see, and eventually Moore's law will win out on humans.

    15. Re:naivity by Rich0 · · Score: 1

      Simple - you write a program capable of parsing a requirements spec written in plain english and churning out an application and the necessary hardware specs... They'll program themselves. Then we'll write the program capable of writing its own requirements specs and we won't need people at all...

    16. Re:naivity by Anonymous Coward · · Score: 0

      is not so much about logic and thought (in the normal sense) as it is for pattern recognition and "looking ahead."

      Eh? What is "the normal sense" of logic and thought?

      The best chess players in the world have nearly memorized all the possible combinations in all the possible scenarios, contrary to popular belief that their abilities are innate.

      Eh again? First of all, this is just plain false. Memorizing "all the possible combinations in all the possible scenarious" is more of a feat than memorizing the exact position and velocity of all particles in the known universe. No, really - do the calculations yourself.

      They have memorized a lot of opening sequences and some endgame sequences, and practically nothing inbetween, which is arguably where the actual chess playing takes place. And not all of them do that either. Capablanca never read a chess book in his life, and he was the world champion. But even if it were true, this directly contradicts your previous assertion. Unless you consider looking up positions in a database pattern recognition, that is, but who the fuck would.

    17. Re:naivity by barawn · · Score: 1

      i heard all of Kasparov's rant. he is well known in chess circles for a big mouth. The point is that he lost. He will lose again today. Period.

      Kasparov? Kasparov wasn't the main one "ranting" - the main people "ranting" were the people who created OTHER chess programs, because when they competed, they were actually contributing to the field, whereas Deep Blue was simply a media event.

      Think whatever you want about Kasparov, but the Deep Blue vs. Kasparov match will always have a mark next to it. You couldn't see the output of the program, you couldn't see the operators, you couldn't inspect the hardware or the software, and the hardware gets dismantled right afterwards.

      But, if you run Deep Junior strength program on a cluster, there is no doubt that kasparov, kramnik and anand sitting togehter can draw against it.

      What the heck? Why do you keep making the assumption that increased processing power = better chess program. Increasing the processing speed of a computer only improves traversing the move tree, and that part isn't the part that needs to be strengthened most significantly - it's the tree pruning logic and the "intangibles". Processing power won't make a brute-force approach computer realize "oh, wait, I really DO want to have control over the center of the board early in the game" until you're able to brute force a significant portion of the move tree.

      Deep Junior will NOT get magically "super-better" when run on better hardware. It's the software, not the hardware. The authors themselves have already stated this.

    18. Re:naivity by barawn · · Score: 1

      Consider the ultimate extreme - a computer capable of analyzing the full search space of chess in 1 second (probably not possible to engineer using all the matter in the universe). This computer simply cannot lose against any player who isn't capable of doing the same. The program doesn't need to recognize patterns, it just picks the best route to victory under the current conditions, and adjusts it after each human move.

      This is known as "solving chess". The important thing to realize is that a computer isn't the only way to do it. There's no reason a "perfect human" couldn't do it too, exactly the same way that humans do it now - by memorizing all significant patterns that could occur.

      The problem with that method is that the concept of "significant patterns" requires intelligence (or better mathematics than simply 'I win') to determine whether or not a state is 'better' than another one. With the hypothetical "perfect computer", the route for solving is already known - it's "I win." vs "I lose." So, it's easier to get close to the "perfect computer" than a "perfect human".

      This is exactly analogous to computers vs. humans in modern mathematics. Sure, a computer can calculate the next prime number by brute force and can do it much faster than a human. However, if a human develops a new algorithm to calculate the next prime number in a sequence, he'll arrive at some prime number much faster than a brute force method. The only question is does the algorithm exist, and how long does it take to find it?


      Obviously this will never happen, but suppose you have a computer capable of fully searching 30 moves. I'd argue that no human could beat that either - while not a full game ahead it is close enough. Now consider 20 moves - we're still probably unbeatable. At this point we're just arguing degree - eventually a computer will come out capable of searching deep enough to beat a human.


      C'mon, you're talking about memorization here. Humans now might not be able to beat the computer, but humans 20 years from now, after playing against these chess programs for 20 years, will easily be able to see just as far as the programs do, because it's all a matter of patterns, and the computers will value the same patterns (because that's what they're programmed to do), unless you believe that computer programs today are perfect, and there is no method of beating them (i.e. "chess is solved"), which I don't agree with. No computer has ever shut out a human, and remember, regardless of what some people might say, a human can't beat a computer "by luck", because the computer doesn't make mistakes. The fact that humans still draw computer programs tells me that the programmers are very smart, but there are still some portions of the game they (and probably the Grandmasters as well) don't understand.


      Remember, the computers playing chess these days rely more on smarter software than brute force. They don't represent the state of the art in CPU power or storage. I'd argue that the best computers today running the best software would do even better than what we presently see, and eventually Moore's law will win out on humans.


      They rely on smart software because it's the only way to solve the problem. Brute forcing it simply won't work, because you can't brute force to the only "tangible" solution: "I win" vs "I lose", so you have to make up a bunch of "intangibles" like king safety, piece mobility, and position. By valuing those intangibles, you're eliminating portions of the move tree, and opening yourself up to a pattern-recognizing human who may see a portion of the move tree you've eliminated as "bad".

      Honestly, you're contradicting yourself here: the best software would not run tremendously better on better hardware, because it's still constrained by its own limitations - the "smarter software" part. No one in their right mind starts with the "brute force" method - they start with an opening playbook, and so long as they start with that, they've limited themselves.

  28. Is it just me........ Somebody answer by LostboyTNT · · Score: 1

    ok.. I realize that chess is a very complex game. I realize that for decades they've been been trying to create a chess computer that can consistantly beat the best human players. but my 1 question is.. even with the googleplex, or how ever many possible game combinations there are, why is it impossibile with todays computing and storage power, to create a computer that has every possibile game, in it's memory/storage. and barring all else, choose the appropriate path to checkmate, based on the other players moves? (Isn't that somewhat what the chessmasters do, themselves, based on experience, and insight, choose the best patterns of moves to win?) I realize that isn't really 'computing' and it's just following a set path, based on input variables, but comeon.. you're telling me, we can trace a molecule's path back to the big bang, and we can't figure out every possibile chess game? will someone who knows more about chess than me, answer, and set my mind at ease?

    --
    LostboyTNT MercyHosting.Com

    Server-Status.Com

    50Bux.Com

    TLDR.Com

    1. Re:Is it just me........ Somebody answer by mikeg22 · · Score: 1

      Ok, assume that the chess tree goes 200 ply (100 moves per player max). Now assume the branching factor, which is the average number of possible moves at any given position, without optimizations like alpha-beta is 20. So for each move in the longest possible game of 200 moves, there are an average of 20 possible moves. The number of moves in the chess tree therefore would be on the scale of 20^200. For a sense of how big this number is, consider that the number of atoms in the universe is about 10^80.

    2. Re:Is it just me........ Somebody answer by kobukson · · Score: 1

      uh, perhaps because the sheer total number of ALL POSSIBLE MOVES that are possible in a game of chess is indeed a number that is a close cousin of the google-plex and to store that much information using hard drives/memory with today's latest information-to-storage-area density would require an amount of material that would rival the amount of matter present in the known universe??

      --
      -- I hereby announce, on behalf of my great ancester Oog, a retroactive patent on THE WHEEL.
    3. Re:Is it just me........ Somebody answer by farquharsoncraig · · Score: 1

      You let me know when you can trace EVERY particle back to the Big-Bang (even if it is just the life of some randomly pickable particle X). If you can do that, then you already have a TOE, and I want to know what it is.

  29. That term is sexist too by Anonymous Coward · · Score: 0

    It should be humankind, or humanity.

    1. Re:That term is sexist too by Anonymous Coward · · Score: 0

      Oh, give it a rest. You'd have to be trying, in order to be offended by that.

  30. this has to be one of the dumberest post ever by Anonymous Coward · · Score: 0

    on slash dot. I assume you're a Mac user.

  31. Who will win? by Anonymous Coward · · Score: 0

    Man vs. Machine: Who will win?

    Simple. The one who can disable his opponent by pulling the plug.

  32. Human advantage by rpj1288 · · Score: 2, Interesting

    One thing that will keep people on top for a while is our inconsistancies. A computer works on logic, and can usually be predicted to do something. People, on the other hand, are spontanious, and use a different kind of logic. We also take risks that do not make sense. But if something is crazy enough, it could trick a computers. Because computers do not lie. They cannot lay traps and they cannot bluff.

    --
    Marvin knew: "Think of a number, any number..."
    1. Re:Human advantage by mOoZik · · Score: 1

      You can't win at chess by making moves that don't make sense. The computer would play ahead and find out what you're up to and make appropriate moves then. That is more likely to confuse the human.

    2. Re:Human advantage by ComputerSlicer23 · · Score: 1
      Computers don't need to lie, or bluff. This isn't a game of chance. It's a deterministic game, that involves no chance. If you make a foolish move, you won't confuse the computer. The computer will make the best counter it can find, and proceed to crush you.

      Intimidation, and bluffing work against other humans, but it'd never work against a computer. That's like saying you'll trick an omnicient being by doing something they won't expect you to. If they are omnicient, they KNOW what you are doing. Computers a pretty close to being omnisient at the game of chess.

      This isn't about playing poker where you know something your opposing player doesn't. It's a full knowledge, deterministic two player game. Game trees, alpha/beta pruning, and configuration ranking are what it's all about.

      The only reason a computer can't just crush a human every single time they play, is that humans teach the computer how to rank configuration of the board. There is known single "perfect" algorithm to do that (it's not like doing sorting strings). The greatest of the grandmasters are better then the best programs can currently do. It might be that tweaking the configuration ranking will always expose a different weakness of the computer, and the humans just have to find it. It might be at some point, the computers ability to figure out which of two similiar board configuration has a larger advantage will exceed any humans ability to intuitiely see it.

      In theory, there is nothing to stop computer from just pre-computing every possibility of every single game, and do the perfect move every single time. Nothing, except that it's estimated that there are more board configurations then there are atoms in the Universe. If you want to see what I mean, play a computer at Tic-Tac-Toe. I can easily write a program you'll never, ever beat no matter how much you bluff, or do something unexpected. The only difference between Tic-Tac-Toe and chess is that Chess is a much harder game to rank the various positions, and it's a much larger search space.

      Finally, your assertion that computers cannot lie, and cannot bluff is absolutely blantantly wrong. Computers can do anything you can program them to do. I could easily write a program that estimates it has a very good chance of losing, and teach it to bet in exactly the same way it would if it had a Royal Flush in poker. If I thought that would intimidate you into folding. However, that is then taking into consideration things outside of the statistically predictable. I'd have to model the specific player I was playing, and how well they understood the program to correctly setup the game theory matrix to maximize my chances of winning. It'd be very difficult to do, but it could be done.

      Kirby

    3. Re:Human advantage by stanmann · · Score: 1

      Odd, that is how the GMs win, by examining the move trees and coming up with a move that apparently doesn't make sense. ANd then exploring where the play can go from there...

      --
      Food not Bombs is a nice platitude but it breaks down when you notice that the Bombees are usually well fed
  33. Let's not let computers get too smart by El · · Score: 1

    What happens when an AI figures out the optimal strategy is to simply kill its opponent, thus guaranteeing a "win"? Let's be careful how you specify those goal conditions, guys!

    --

    "Freedom means freedom for everybody" -- Dick Cheney

    1. Re:Let's not let computers get too smart by rpj1288 · · Score: 1

      But see, in chess, you cannot simply "kill" an opponent. Furthermore, I doubt a machine designed to analize positions and movements of units that are directly math related could make the jump to wanting to "kill" its opponent.

      --
      Marvin knew: "Think of a number, any number..."
    2. Re:Let's not let computers get too smart by Qwell · · Score: 1

      He meant kill. You know, like death, murder, etc?

      --
      As of 10/06/03, I hate COBOL developers.
    3. Re:Let's not let computers get too smart by Brandybuck · · Score: 1

      Fred Saberhagen's "Octagon"...

      In summary, some kid hacks into a Los Alamos supercomputer to help him figure out moves in a PBM game. The opponents start dying in real life.

      --
      Don't blame me, I didn't vote for either of them!
    4. Re:Let's not let computers get too smart by El · · Score: 1

      Ok, you got me... yes, I've read "Octagon", and my comment was not an original idea!

      --

      "Freedom means freedom for everybody" -- Dick Cheney

  34. Re:Face reality by Henry+V+.009 · · Score: 0

    Completely right. I read an interesting book on that some time back where the anthropologist author explains why no civilization in history has ever been "matriarchal" as it is commonly conceived. He debunks several of supposed exceptions, and then goes on to describe why the male drive causes a disproportionate number of males to attain the highest socially regarded positions in any society. For the same reason that a disproportionate number of males attain the least favored positions - criminals and so on.

    But besides all that, I think that chess may be more like professional football than cooking. Some women are very good at it, but the top few hundred players are all male. Some of the difference is probably not due to competitive drive.

  35. a contradiction? by X_Bones · · Score: 4, Insightful

    from the article:

    "The red line is Garry Kasparov's rating over time, and the blue line is the rating of the top computers on the SSDF list. The blue line is creeping closer and closer to the red line. It seems just on the verge of crossing over. "

    But then, further, down, he writes:

    "Although computers obviously must be improving in recent years, the strongest humans seem to also be improving at about the same rate."

    These two statements contradict each other, don't they? Either computers are improving faster than grand-masters, meaning the graph and its extraploations are true; or, computers and grand-masters are improving at the same rate, which would mean the percentage of human wins and draws would be generally the same as in previous years (something not indicated by the second graphic in the article)?

    1. Re:a contradiction? by rakeswell · · Score: 2, Informative

      No, it's not necessarily a contradiction. Simplest example: Players A and B have the same rating and win, lose and draw an equal number of games. Let's also say that both of their games (technique) is improving at an equal rate. Therefore, their ratings do not change, even though their play has improved. That's the tough thing about chess. You can play a very deep game and still lose. You don't get credit for having played well -- it all comes down to mate or a draw.

      --
      All one has to do is hit the right keys at the right time and the instrument plays itself. - Johann Sebastian Bach
    2. Re:a contradiction? by void* · · Score: 2, Interesting

      The bigger problem is that the computers aregetting their rankings solely by playing other computers (if I'm reading the article right). The ratings are dependant on who's in the pool of players.

      Say the best computer in the set of computers always beats or draws the other computers. lets say it wins more than it draws. In that pool of players, it's rating will tend to creep up.

      So the ratings aren't necessarily comparable. Take a 1700 player, throw him in a pool of only 1000 players - when his rating breaks 2200(after quite a few games), that doesn't mean he'll be able to consistently beat a 2000 player, because there's no one above him in the pool he gained the 2200 rating, to lose games against and keep his rating down where it belongs.

      I've no doubt computer ratings are increasing, but if there's no humans in the pool they play with there is quite concievably an effect such as this, although it's probably not as extreme.

      --


      Code or be coded.
    3. Re:a contradiction? by Anonymous Coward · · Score: 1, Insightful

      Not really; the FIDE rating is against other humans while top players of today also study computer opponents, and learn. Basicly Kasparov is harder to beat today then in 1995, if you are a computer...

  36. Re:Face reality by Anonymous Coward · · Score: 0

    Posting anonymously since it's offtopic..

    I feel like I'm biting a troll here, but let's address what you say. Many great inventions of the past were by women who then let a man release their invention because a woman simply wouldn't be taken seriously and it wouldn't be socially acceptable for them to do so.

    It's more out of tradition than any true reason that men are dominant. It is not sexist to say "man" instead of "human" in writing, in my opinion. It's a little silly to make a fuss about it.

    Biologically speaking, men are physically stronger than women. But as for their mental ability, there's no conclusive evidence that one gender is better than the other. If you still believe that women are superior, feel free to go live in a fundamentalist country like Afghanistan that treats their women like shit. Or build a time machine and go back to the middle ages. :)

  37. Re:The real chess masters by Gwala · · Score: 1

    You know, this is a reasonably 'on-topic' post to make a Beowulf cluster joke. Especially considering the time's taken to compute each move. By moving to a distrobuted network (each node calculating a certain set of moves, and rating them on appropriateness) It could help with the time's (the last match, it took about a day for the computer to analyse through all combinations, and select the best one)

    -Gwala

    --
    #!/bin/csh cat $0
  38. Summary by thelandp · · Score: 0
    I think the article (for those two lazy to RTF) boils down to the ideas:

    Yes, computers are quickly improving their chess ratings, and this will probably continue

    Yes, overall, humans aren't improving chess playing skill as quickly, HOWEVER

    ... this won't mean computers will be able to consistently beat humans, because humans are basically understanding the ways that computers are playing better, and can counteract.

    For example, the only time a computer ever beat the world champion was 1997 Deep Blue vs Kasparov. Every other time has been either human win or a draw, and htere have several more attempts since then.

    Maybe computers are playing faster, or thinking more moves ahead. But maybe there is not really any "substance" in their style of play?

    --

    -- the only thing we have to fear is really scary things
  39. There are some things machines will never do by Anonymous Coward · · Score: 0

    ... like suck my dick. We all have your mom for that. While she may not live forever, I wouldn't find sticking it in her corpse. She'll probably smell a little better once she starts decaying anyway.

  40. From all the times I've played gnu chess by skank · · Score: 1

    I think the longest I have ever lasted was maybe 4 or 5 moves, and it beat me. Go figure...

  41. How complicated is Chess? by use_compress · · Score: 3, Insightful

    According to p. 45 of Russel & Norvig's AI book, a look up table for the game of chess (i.e. if you mapped every achievable permutation of chess pieces on a board) you would have 10^150 entries. Unfortunately, there are only 10^80 atoms in the observable universe. Even with excellent heuristics, I think these numbers show that a computer that capable of playing perfect chess will not be built in the foreseeable future.

    1. Re:How complicated is Chess? by Bert690 · · Score: 1
      Those are very conservative numbers. Even the most naive of heuristics elminate a huge fraction of those possible "states". Another huge fraction are simply not realizable given the constraints on how peices are allowed to move.

      A naive calculation of the state space size has little to do with computational difficulty.

    2. Re:How complicated is Chess? by Bert690 · · Score: 1
      .... but yes I agree that a machine capable of playing "perfect" chess is a long way off!

      Sorry, I thought you were arguing in favor of the author's unfounded claims that humans are unlikely to be beaten consistently by machines any time soon...

    3. Re:How complicated is Chess? by bm_luethke · · Score: 1

      Well, usually in cases such as this you do not need the whole map (or tree I would actually assume), you only need to calculate the relevent parts. The first few moves *dramiatically* reduce the search space - though it is still very very large. Nor should you have to know the entire tree as many of the moves are stupid, once it is realised that a particular branch is stupid no more traversing it. The problem is still quite large and computationally difficult though, just not so hard that you need more storage than there are atoms in the universe.

      --
      ------- Sorry about the spelling, I suffer from two problems. Dyslexia makes it difficult to spell well, lazy makes it
    4. Re:How complicated is Chess? by RayBender · · Score: 1
      Just a random question; has anyone thought how a quantum computer might be applied to the Chess problem? Given its ability to calculate many possible states at once, perhaps the lookup table approach (combined with some simple heuristics) might be doable? While a lookup table would have more entries than atoms in the Universe, there might be enough quantum states....

      Just curious.

      --
      Human genome = 3 billion base pairs = 6 GBit. Windows + Office = 20 Gbit. Which is more impressive?
    5. Re:How complicated is Chess? by ZorbaTHut · · Score: 1

      Out of curiosity, is there any accepted number for how large the lookup table for the game of Go would be?

      --
      Breaking Into the Industry - A development log about starting a game studio.
    6. Re:How complicated is Chess? by ZorbaTHut · · Score: 1

      Wait, hold on.

      Chess: You have six unique pieces (king, queen, bishop, knight, rook, pawn). Two sides. And the possibility of empty squares. 13 possibilities total (6*2+1). 64 squares total. Two possibilities for whose turn it is. Doesn't that make it 2*13^64 at most? That's about 4*10^71, and a lot of those possibilities are utterly impossible (i.e. not exactly one king per side, entire board filled with queens, that sort of thing.)

      Where on earth is that 10^150 figure coming from? I don't believe it for a second.

      --
      Breaking Into the Industry - A development log about starting a game studio.
    7. Re:How complicated is Chess? by s00p41337h4x0r · · Score: 1
      The exact same argument shows that a person can't play perfect chess which means that we give up on that goal. The relevant question is, "Can the fast evaluation speed of the computer make up for its shoddy evaluation algorithm?"

      This is an open question, which is why people are still writing programs (and articles and slashdot threads) like these.

    8. Re:How complicated is Chess? by evilWurst · · Score: 1

      The "atoms in the observable universe" school of thought holds considerably less merit these days, now that know we'll eventually be able to cheat with quantum computers :)

    9. Re:How complicated is Chess? by tilrman · · Score: 1

      Unfortunately, there are only 10^80 atoms in the observable universe.

      Fortunately, there are a lot more, say, electrons, photons, and/or quantum states.

    10. Re:How complicated is Chess? by kudos200 · · Score: 1

      Others have said it, but I'll say part of it again: many of the possible permutations can't (or won't) happen, so we won't need all 10^150.

      Also, there's the fact that chess _is_ a "solvable" game. There is (though we may never know it) a "perfect" way to play. If the computer starts from the beginning and plays perfectly, there are definitely a LOT of states it could get to, depending on what its opponent does. But, the number of states is only a fraction of the total possible game states.

      That's basically my point: there are more states possible than we can keep track of, but there is still the possibility of playing "perfectly."

      Stop reading now if you don't want a lot of drivel.

      There's a counting game I just thought of. Two players, each turn you can count 1 or 2 numbers. The person who says the number 7 wins. A sequence could be:
      1-23-45-6-7 and Player one wins.
      It turns out that if on the first turn, you just say "1," then after that, you just say the opposite of Player 2 (he says two numbers, you say one, and vice versa). So:
      1-23-4-56-7
      1-2-34-5-67
      and so on. You can always win. Now let's say the game goes up to (3x10^99999999) + 1. That's way more possibilities than we can remember. But, we could still play perfectly, since we know this magic rule.

      Not a perfect analogy, I realize. There is no magic rule in chess that's quite so simple. But, my point still stands: a computer can learn to play perfectly without having a lookup table with 10^150 entries.

      Like usual, I'm probably wrong, so correct anything you want.

    11. Re:How complicated is Chess? by Bazouel · · Score: 1

      This is why we generate moves by looking ahead ...

      By discriminating illegal and blatant stupid moves, the search domain is already constrained to a storable space. Even more so with "intelligent" algorithms that efficiently discriminate search paths.

      And lastly, even if you have every possible moves in a lookup table, a win is not guaranteed : a pat would still be possible.

      --
      Intelligence shared is intelligence squared.
    12. Re:How complicated is Chess? by Anonymous Coward · · Score: 0

      Assuming each point can be empty, black or white, we get approx. 10^172 positions for Go. Of course many of those positions will be illegal, which reduces the count. As for state information not visible on the board, there's only the ko rule which multiplies the state space by some number less than 361. For practical purposes, the state space is thus about the same size as the state space of Chess: the number of atoms in the universe to 80th power or so. That's a lot.

    13. Re:How complicated is Chess? by Anonymous Coward · · Score: 0

      To be able to check for a Draw by Repetition, every past position since the last irreversible move (moving a pawn or making a capture) must be part of the current state of the game (at most 100 past position because of the Fifty-Move Rule). (here's a summary of these rules)

      That gives you (2*13^64)^100 possibilities for one position.

      Of course you can represent those 100 positions more cheaply using the fact that each consecutive position differ only by one move. However I'll leave it to you to find a tight encoding of that, because you're the one claiming that 10^150 is too much.

    14. Re:How complicated is Chess? by fiontan · · Score: 1

      That doesn't make sense... If the board is in a certain state, why does it matter if it reached this state by moving a pawn or by moving a knight, if it is black's turn to move?

      Being able to check for a draw isn't necessary in the state tree... it simply means we need a graph with non-directional cycles to represent play. Note that if we enforce that the graph may not contain any directional cycles, then the construction of the tree will never recurse, so each particular board state only needs to be evaluated once.

      That doesn't get past the fact that no computer (that I've heard of) has sufficient resources to maintain such a tree, though. That's not to say it's not possible to store a sufficient tree to allow perfect play... I don't know enough to guess either way.

    15. Re:How complicated is Chess? by tilrman · · Score: 1

      Maybe I'm missing something (besides that book), but here's what I come up with as a quick, very crude upper bound:

      There are 64 squares on a board. There are 13 possible pieces on a square: white/black pawn, w/b rook, w/b bishop, w/b knight, w/b king, w/b queen, and empty. 13^64 < 10^72.

      Granted, this is still not a small number, but we're back down below the number of atoms in the universe. :-) Plus you get some easy optimizations, like there's exactly one of each king, and the board is always at least half-empty.

    16. Re:How complicated is Chess? by Anonymous Coward · · Score: 0

      Being able to check for a draw *is* part of the state.

      Given position P, what to play next might depend on whether the position Q occured before or not, to avoid a repetition that will be forced 7 moves from now. You won't have perfect play if you only avoid repetitions as you go.

    17. Re:How complicated is Chess? by Anonymous Coward · · Score: 0

      Well that is just the point isn't it? I mean, sure the searchspace can be dramaticly reduced with heuristics, but how do we find a good heuristic for chess? We haveto approximate the benefit of searching a subspace of the tree, and with todays heuristics we cannot be sure that we don't miss very important moves.

      BTW, there is another neat way to reduce the searchspace of a minmax-tree (which is used in chess-ai's and alike) and it truncates subtrees that are proven not to be as good as it's neighbors. I won't get into detail here, but it's quite neat!

    18. Re:How complicated is Chess? by Pentagram · · Score: 1

      There are a few other conditions you have to keep track of - whether pawns have moved or not, whether kings/rooks have moved or castling has occurred, whether the last pawn move allowed en passent, and draw conditions as has been mentioned elsewhere. Hard to work out how much those would push up the possibilities, but it doesn't seem like it would be in the region of 10^150.

      Can't help feeling I'm missing something... have to dig out a R&N later and check the reference.

    19. Re:How complicated is Chess? by BitterOak · · Score: 1
      Right. You'd need only 2 bits per side to keep track of whether or not castling was still allowed. (The bit would be cleared if you move either the king or rook. Two bits are needed because moving one rook doesn't eliminate the possibility of castling on the other side.)

      I don't understand the comment about keeping track of whether or not pawns have moved. If a pawn is still in the player's second rank, it hasn't moved. If it isn't, then it has moved. (Pawns can only move forward.)

      There may be certain states that must be kept track of to determine draws due to the same pattern occurring 3 or more times, and that sort of thing though, but I can't imagine the decision tree allowing such things in a perfect game anyway. Is there any other state information, besides piece positions and who plays next that I'm missing?

      --
      If I can be modded down for being a troll, can I be modded up for being an orc, or a balrog?
    20. Re:How complicated is Chess? by Pentagram · · Score: 1

      I don't understand the comment about keeping track of whether or not pawns have moved. If a pawn is still in the player's second rank, it hasn't moved. If it isn't, then it has moved. (Pawns can only move forward.)

      Mea culpa. Realised it after posting but didn't bother correcting myself.

    21. Re:How complicated is Chess? by Anonymous Coward · · Score: 0

      I and my brother played a game when doing the dishes, where you start at a number and you subtract one, two, or three. The person who can't subtract more loses. It always took us a while to do the dishes, so we solved the game pretty quickly. You just need to know the starting number and the rule.

      Then there is Tik-Tak-Toe, Connect 4... they can all be solved! Solving games is fun. :)

    22. Re:How complicated is Chess? by Ziviyr · · Score: 1

      All you need to do is simulate enough atoms to have a virtual brain. Afterwards, without wasting its abilities on biological functions, it could prolly keep pace without a lookup table that consumes the observable universe. :-)

      Nevermind that every achievable permutation is probaby a lot more than the amount of permutations possible with a lookup table as an opponent.

      --

      Someone set us up the bomb, so shine we are!
    23. Re:How complicated is Chess? by NoOneInParticular · · Score: 1

      Hey dude, you just succeeded in explaining how chess computers work. This has however no bearing on the optimality of the approach. You would probably still need a brain (not mind!) the size of a few universes to store all possibilities. Remember, seemingly hopeless branches might still lead to a forced win.

  42. I beg to differ... by Anonymous Coward · · Score: 0

    I ran the numbers past my statistic calculating supercomputer (DeepStat) which calculated that Kasparov has no chance against X3D Fritz. Furthermore, DeepStat calculated that Jeff Sonas couldn't tell the difference between a Gaussian and Chi-Squared distribution if his TI-95 depended on it, so nanner-nanner-nanner...

  43. What about playing chess with God? by dark-br · · Score: 2, Interesting

    This guy has a very interesting write up about chess and probability. Worth a read.

    1. Re:What about playing chess with God? by Anonymous Coward · · Score: 0

      Chess and probability? Thats just another atheist-Christian bickering troll. You either (1) didn't read the linked article or (2) are trolling yourself.

    2. Re:What about playing chess with God? by kobukson · · Score: 1
      God does not play dice with the Universe

      what makes you think She will play chess with you?

      --
      -- I hereby announce, on behalf of my great ancester Oog, a retroactive patent on THE WHEEL.
    3. Re:What about playing chess with God? by ChaosDiscord · · Score: 1
      This guy has a very interesting write up about chess and probability. Worth a read.


      Actually, it has very little to do with Chess. Instead it's a really iffy argument against an omniscient God. Not worth a read if you're just interested in chess. If you're interested in philosphy, maybe, and then only if you're interested in a study of flawed logic and questionable assumptions.

    4. Re:What about playing chess with God? by woztheproblem · · Score: 1

      How is this interesting? Philosophers have been dealing with questions of Free Will vs. Omnipotence for a LONG time. Some guy applying this discussion to chess isn't interesting at all, given that the discussion has moved far beyond a simple "well, it seems that the two are opposed, therefore God can't be omnipotent." For example, does God's knowledge of what we will do really take away from it being our free choice? What does it mean for God to "know" something? Can we consider God to be subject to constraints of time, or is God "outside" of time altogether?

    5. Re:What about playing chess with God? by dvdeug · · Score: 1

      This guy has a very interesting write up about chess and probability. Worth a read.

      Not really.

      It may even be that chess is a game that can always be won by perfect play, like tic-tac-toe. We wouldn't know that, but let's assume for a moment that chess is a little bit more complex, and does not have a perfect play strategy.

      Tic-tac-toe can't always be won by perfect play; it can either be won or drawn by perfect play. Basic game theory says that in any finite two player game that's zero-sum (if one player wins the other loses) and both players know every move that's been made (i.e. not rock-paper-sissors or Stratego) (a group of games that includes chess), one player has a strategy that guarentees he won't lose. So chess has what he calls a "perfect play strategy."

      This is the first logical mistake. (He also seems to be begging the question about the nature of free will, too, but that all has already been severed from anything having to do with chess.)

  44. computers have already surpassed humans in chess by civilengineer · · Score: 1

    the mathes that are being played by humans against computers these days (expcept for kasparov vs DeepBlue) are all mostly on single processor PCs. But, single processor PCs are not the only computers in this world. It is only on these machines that humans are able to draw against computers, not win. The standard method being used by GMs to draw is to set up a closed position which need deep strategical moves and long term plans to win againt. Since the games are limited to 40 moves in 2 hrs per player, the single processor computers agree for draws in such positions when they are unable to calculate the winning moves in time. Given that processor speed is increasing rapidly, even these single processor PCs will beat humans pretty soon. If a human played against amy of the Top500 supercomputers today, he would get his butt kicked big time, even Kasparov. I think a cluster of less than 10 computers is enough to beat kasparov. Since kasparov already lost to deep blue, nobody is intersted in investing money in writing software for parallel processing chess programs. Its considered a done deal. The statistics the author of the article is using to prove his point are only valid for PCs.

    --

    New year Resolution: Don't change sig this year
  45. if you ask me... by jjeffries · · Score: 1

    "The only way to win, is not to play."

    How about a nice game of gobal thermonuclear war?

  46. i always lose by stevebob2019 · · Score: 0

    After the computer beats me at chess i usually taunt it with my "self-awareness." Gosh... do I really do that? I'm pathetic. Well, at least I know I am, stupid computer...

  47. Stop making me feel like an idiot already by Morgahastu · · Score: 1

    I can't even beat an Apple II at chess. DAMN YOU CHESSMASTER 2000!!

  48. "how" finite is it? by dark-br · · Score: 0

    There are approximately 35^100 legal options for a chess game (that's a 2 with about one hundred and fifty four trailing 0's).

    Assuming you can process... 2 million moves per second, just like Deep Blue, the universe would end by the time you finished (i.e. 4.1477e+137 millenia away!)

    1. Re:"how" finite is it? by Sivaram_Velauthapill · · Score: 1

      There are approximately 35^100 legal options for a chess game (that's a 2 with about one hundred and fifty four trailing 0's).

      How did you get that number? I'll bet it's a lot lower in practice. You can probably eliminate many magnitudes of moves simply by the generally acception notion of 'dumb moves'. For instance, moving a rook pawn on your first move is 'dumb' so you can eliminate that. Similarly, you can probably cut down several zeroes by eliminating dumb moves.

      Assuming you can process... 2 million moves per second, just like Deep Blue, the universe would end by the time you finished (i.e. 4.1477e+137 millenia away!)

      hmm... the universe doesn't END! I'm not sure what you are referring to??? Maybe the computer components will overheat or fail before it finishes playing the game...but the universe will still be around :)

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    2. Re:"how" finite is it? by NonSequor · · Score: 1

      Large or not, it's still finite. In fact, it's rather pitiful as far as large numbers go. You want to see a really large number? Take a look at the best known upper bound on Graham's number.

      --
      My only political goal is to see to it that no political party achieves its goals.
    3. Re:"how" finite is it? by stanmann · · Score: 1

      According to standard practice rook pawn is dumb, however by exploring 'dumb' branches is how some of the more inventive openings have been discovered.

      --
      Food not Bombs is a nice platitude but it breaks down when you notice that the Bombees are usually well fed
    4. Re:"how" finite is it? by Anonymous Coward · · Score: 0

      >For instance, moving a rook pawn on your first move is 'dumb' so you can eliminate that. Similarly, you can probably cut down several zeroes by eliminating dumb moves.

      Starting the game with moving a rooks pawn isn't so stupid. Just not accepted yet. Most rooks pawns usually are moved in the first dozen moves, so why not move it first? Why not make the moves you know your going to make first to see how your opponent responds, than take control of the game?

      >Assuming you can process... 2 million moves per second, just like Deep Blue, the universe would end by the time you finished (i.e. 4.1477e+137 millenia away!)

      >hmm... the universe doesn't END! I'm not sure what you are referring to??? Maybe the computer components will overheat or fail before it finishes playing the game...but the universe will still be around :)

      Actually, with any living entity, the universe is not forever. What is the average lifespan of a sun/star? Is the universe still expanding, or is it contracting yet?

      But, even if you built a computer and put it on a spacecraft to survive the lifespand of the world and the this universe, and can still calculate chess, by the time its built, it will be obsolute.

    5. Re:"how" finite is it? by JuggleGeek · · Score: 1
      According to standard practice rook pawn is dumb, however by exploring 'dumb' branches is how some of the more inventive openings have been discovered.

      Also, making a 'dumb' move means that the computer soon runs out of it's standard library openings, and has to calculate each move instead of playing "by the book". I'm in no position to comment on grandmasters, but most people are not going to know the standard book-line openings nearly as well as the computer does, so making the computer think about a move puts us on a more even keel. If I try to play standard lines, the computer is going to remember them much better than I do.

      I can't help but think that as computers get faster, and better chess software is written, that computers will be able to win most of the time even against gransmasters. They can already beat the vast majority of people hands down. That doesn't bother me. I'd like to see a competition between two grandmasters who are each allowed to use a computer to advise them. To me, computers and software aren't a "Humans vs Computers" thing so much as a "Humans can do more with a computer than without one" thing.

  49. Absolutely wrong by bpb213 · · Score: 1

    (Admitting I didnt read the Chess Base pages)

    Look at the game TicTacToe. There are some finite amount of moves (something like 9!). Therefore it takes very little space to store the entire game tree, consisting of every possible move, in a computer. This means that a computer will always win a game, because it knows the best path at any given move. (TicTacToe might be wierd in the fact it seems that two good players can always tie)

    Then look at Checkers. Sure, its much more complex then TTT. However, we have already completely mapped Checkers as well. Again, this means that the computer will Always beat a human.

    Chess is much more complex then both Checkers and TTT. But the fact remains that it is still a finite set of moves. When a computer reaches the ability to store all those moves (and it will), then the computer will again win any game at all of chess, whether it is against a Grand Master or not.

    The same concept can be applied to any game at all with a finite number of moves. As soon as the computer can hold an entire game tree in memory, then it will always win. (yes, given time, even Go will be completely mapped)

    --

    This .sig looking for creative and witty saying.
    1. Re:Absolutely wrong by SamBeckett · · Score: 1

      Checkers hasn't been solved yet.

  50. Re:Face reality by orthogonal · · Score: 1

    Many great inventions of the past were by women who then let a man release their invention because a woman simply wouldn't be taken seriously and it wouldn't be socially acceptable for them to do so.

    So if these inventive women hid behind the male pawns who released their inventions, how do you know that the women were the inventors??

    I'm not saying women can't or don't invent; I believe they can and do.

    But where's your evidence? Did you go back in time and see the women inventing these great things? Did you perhaps channel their spirits? Or maybe they were reincarnated as you? Was the secret knowledge passed along like the half-remembered rituals of the crypto-Jewish marranos?

  51. Re:Face reality by Anonymous Coward · · Score: 0

    There is a hell of a lot of evidence on mental ability. History for one thing. But also on modern IQ scores. Men and women have the same average as a population. But men are far better represented at the top and bottom tails of the bell curve than women. Women's IQ scores seem to be more bunched up. And IQ quite clearly measures intellectual ability. IQ differences among siblings are well correlated to social standing later in life.

  52. That term is sexist, too by SweetAndSourJesus · · Score: 1

    Humanity? I don't think so, sister!

    It should be personkind, or personity.

    Now if you'll excuse me, I have to write a very long letter to the people who make Manwich.

    --

    --
    the strongest word is still the word "free"
    1. Re:That term is sexist, too by NortWind · · Score: 1
      It should be personkind, or personity.

      perSONkind? perSONity? What kind of a sentient being are you? Try perCHILDkind instead.
    2. Re:That term is sexist, too by Canadian_Daemon · · Score: 1

      while your at it, could you change menopause and menstrual
      Tnanks

      --
      This sig is definitive. Reality is frequently inaccurate.
  53. Hello?? by Dancin_Santa · · Score: 2, Funny

    personkind?

    Oh no you din't!

  54. What is the standard ... by fygment · · Score: 1

    ... being met here?

    a) Top human vs Top computer: computers defending champs;

    b) Elegance of tactics: humans (computers still brute force);

    c) Efficiency (wins/joules): humans for forseeable future; and

    d) Number of Wins: Average Human vs Average Computer: computers rule (sorry but people who beat computers of any level are seriously in the minority).

    Pessimistically, humans take the occasional battle but the war has been lost.

    --
    "Consensus" in science is _always_ a political construct.
  55. I could write a chess computer! by TLouden · · Score: 1

    It would kick my ass. But that's not saying much.

    --
    -Tim Louden
  56. Always have to bring it up by Transcendent · · Score: 1

    ...but if you think Chess is complex, you guys should try playing Go (wei`chi, igo, baduk... many names).

    Basically, there's a million dollar prize out of someone can make a go playing computer program that can beat a weak professional. How are they doing? Well... if you've played Go for a couple months you can probably beat the strongest program to date. (And yes, I can)

    What's go like? Try:
    http://www.usgo.org (many links there)
    http://www.kiseido.com
    http://www.goprobl ems.com

  57. Death of Chess? by ezh · · Score: 1

    If computers start consistently defeating humans in chess, does it mean humans will loose interest and stop playing it? I guess, not many chess grandmasters would want the "big brother in the box" watching over them, analysing their mistakes during the matches to the cheers of the crowd, thus making them some form of puppets in a theater. Would people start playing complicated games (from the computers point of view) as Go & others?

  58. Sonas argument is silly by phr1 · · Score: 4, Insightful
    He says Deep Blue II hasn't been improved on since 1997 and therefore computers have maxed out. That's dumb. Deep Blue II hasn't been improved on because nobody has spent the bucks since then to improve on it. It's simply stronger than its successors, which is not surprising since DB2 used massive amounts of custom VLSI hardware built by PhD researchers with megabucks of IBM Research funding, while everything since then has been programs running on ordinary PC's programmed by small companies and hobbyists. PC's keep advancing but it will be a while before they catch up with what DB2's massive parallelism could do. It's also possible that chess hardware (maybe using FPGA's) will make a comeback.

    Meanwhile, the fastest airplane ever built is still the SR-71A made in the 1960's. That doesn't mean aircraft technology has come to a standstill. It just means outrunning the SR-71A hasn't been a priority of aircraft builders since then. If they wanted to expend the resources to make a faster plane today, they could do it.

    Deep Blue II was the SR-71A of chess computers. What's come afterwards has been a lot more economical and practical, but hasn't tried to match it in pure performance, and hasn't done so.

    1. Re:Sonas argument is silly by rifftide · · Score: 2, Informative
      When Deep Blue beat Kasparov, the computer had an unfair advantage (besides being a computer): it knew all about Kasparov's past games and tendencies, but not vice versa. Kasparov improved his performance in subsequent matches by insisting on having access to the computer in advance to play many test games. Under these more balanced rules the top human players are in rough parity with the computer even though the machines' raw performance has continued to increase according to Moore's law, or better.

      AI researchers originally had high hopes of using chess as a practical test for machine intelligence. But AFAIK the current generation of chess playing machines rely mainly on brute force calculation, along with a substantial repertoire of "book" moves. Since the number of possible chess moves from a given position is subject to combinatorial explosion, improvement based on increasing dosages of brute force will eventually slow to a crawl. Chess masters aren't increasing their endowment of brain cells, but they can think intuitively and spatially and are steadily learning how to play more effectively against the machines. So I think the author's point is that grandmasters are likely to soon gain the upper hand, and will maintain this lead until programmers successfully implement more sophisticated approaches.

  59. empirical THIS by sbwoodside · · Score: 1

    Of course humans will eventually be beat by computers. They have Moore's Law and we don't. End of story.

    simon

    1. Re:empirical THIS by An+Onerous+Coward · · Score: 1

      They have Moore's Law. We have the power cord.

      Any questions?

      --

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

  60. interesting by kittykat2469 · · Score: 1

    how cool

  61. ruh roh by rwven · · Score: 1

    Tron anyone? ;) Or maybe war games :-P

  62. Re:Face reality by veritron · · Score: 0, Flamebait

    The reason for this is that women have two X chromosomes. So they have redundant copies of all their genes - which reduces the frequency of DNA wonkiness. Y-chromosomes are shorter than X-chromosomes, so in all males, there's a whole section of DNA that won't "match up" with the other side. That's why there's a higher incidence of retardation in males.

  63. I for one by Anonymous Coward · · Score: 0

    I for one welcome our chess playing computer overlords.... wait a minute, are chess playing supercomputers any more imposing than chess playing geeks?

  64. man vs machine by MozillaFireBird · · Score: 1

    Chess computers are being developed steadily and yeah, they can kick any GM's ass...that's just because they are machines. Gary Kasparov, after playing with Deep Blue remarked, "It's a machine!!! It doesn't feel pressure". So true...the media goes ga-ga about a champion playing with a machine but almost nobody bothers about the pressure factor...

    --
    Happy Hacking!!!
  65. Although what is a human's clock speed? by CreateWindowEx · · Score: 1
    A human brain has roughly 10 billion neurons, with complex interconnections, IIRC. While it takes a long time for a neuron to react compared to a modern transistor, brains process many things at the same time, and without the computer's clear-cut distinction between memory and processor. A PC might have 10 billion transistors in its RAM, but they mostly just sit there until the CPU has a cache miss, which many of our neurons can be "working" at once. For a neural net computer, it might be possible to come up with some sort of metric to compare neurons to virtual "neurodes", but a method to compare Pentium clock cycles to neuron firing times would be pretty subjective.

    In fact, it is this fundamental difference in how humans and (conventional) computers work that makes the man-vs-machine issue interesting. (E.g., a slow, massively parallel network built for collecting grubs and and having sex, against a fast, serial turing machine built for number crunching)

  66. So it can beat a human at chess. Big F'ing deal. by Unknown+Poltroon · · Score: 1

    Look, you can slap together all the specialized hardware you want, and yes, a room full of top of the line silicon will probably be able to beat a human at any specialized task, especailly one with discrete soloutions.

    Ill be impressed when they have a computer that can beat me at chess, write a sonnet, cook up lunch, play fetch with a dog, ponder a sunset, drive a car, change a diaper, laugh at groucho marx, and wonder if it has a soul. Anything less is nothing but an overgrown calculatior. A nifty goddamned calcualtor, dont get me wrong, but a calculator.

    --
    All Troll + "offtopic" mods are meta moderated as "Unfair", because you abused the system.
  67. Re:Face reality by Anonymous Coward · · Score: 1, Funny

    That's why there's a higher incidence of retardation in males.

    Bordering on 100% upon last observation.

  68. You're absolutely wrong. by rjh · · Score: 5, Interesting

    While the total number of states in Tic Tac Toe is a boringly small finite number, the total number of states in chess is rather amusingly large. And by "amusingly large", I should point out that I'm a large number theorist.

    How large is "amusingly large"? Around 10^150, if I remember my AI class correctly. Discarding entirely the problem of how you'd create a game tree of that size (given the cosmos has about 10^77 particles), let's just address the energy required to compute the table.

    It requires an absolute minimum of kT*ln2, or about 3*10^-26 Joules, of energy to set a bit. Each cell on a chess board requires a minimum of four bits to store its state (it has to store a three-bit enum { PAWN, ROOK, KNIGHT, BISHOP, QUEEN, KING } and a one-bit enum { BLACK, WHITE }). So for a 64-block chess grid, you're looking at 256 bits just to store state.

    256 * 3*10^-26 = 7.7*10^-24

    7.7 * 10^-24 * 10^150 = 7.7 * 10^126

    Do you have any freaking clue how much energy 10^126 Joules is? It's frickin' huge. Like enough to cause a symmetry-breaking event which would propagate through the universe at the speed of light and utterly annihilate everything in its path, including the computer churning out the complete decision tree for chess.

    I can see it now. When Judgment Day comes, it's all going to be because of a Slashdotter who thinks he knows a lot more about what computers can and can't do than he really does, and goes off to solve unsolvable problems without considering the thermodynamic consequences of his actions.

    Typical for Slashdot.

    1. Re:You're absolutely wrong. by kobukson · · Score: 1

      SOOOooo, what you're saying is that before we can even begin to build that game tree, we'd have to become a Type IV civilization first?

      TYPE I civilization: has learned to harness the energy of a planet.

      TYPE II: has learned to harness the energy of a star.

      TYPE III: ditto of an entire galaxy, ie. the Star Trek Federation.

      TYPE IV: ditto of an entire universe, and has started exploring other universes.

      --
      -- I hereby announce, on behalf of my great ancester Oog, a retroactive patent on THE WHEEL.
    2. Re:You're absolutely wrong. by jolyonr · · Score: 1

      Well, you could store each chessboard as the positions of each of the 32 pieces - that's 3 bits for X and 3 bits for Y position, plus another bit to state whether the piece is in play or not. 32 times 7 bits = 224 bits rather than 256.

      Not that it will make a great any difference to the outcome, although if someone did try they would be pleased to know that they had saved about 1x10^126 Joules, which should reduce their electricity bill somewhat.

      Jolyon

      --


      Please read my Canon EOS tech blog at http://www.everyothershot.com
    3. Re:You're absolutely wrong. by jolyonr · · Score: 1

      Reading back my own comment I realise I forgot about the possiblity of pawn promotion. Doh!
      I guess you'll have to calculate it the expensive way after all.
      Jolyon

      --


      Please read my Canon EOS tech blog at http://www.everyothershot.com
    4. Re:You're absolutely wrong. by rjh · · Score: 1

      SOOOooo, what you're saying is that before we can even begin to build that game tree, we'd have to become a Type IV civilization first?

      Not necessarily. I don't want to predict what the future will hold; it's possible we'll see reversible computers take hold, in which case we can compute with infinitesimal energy. A reversible computer could compute the entire decision tree using a nine-volt battery for a power supply, although you'd still have the problem of finding a hard drive larger than the universe on which to write your answers, and you'd have to wait a potentially infinite amount of time to get your answers, since reversible computing isn't exactly snappy.

      Superpositional ("quantum") computing could potentially reduce the size requirements by a large degree, but reducing 10^150 states by a "large degree" still means leaving you with a Godawful number of entries. If you reduce the total number of states by 10^149 (a very large reduction), you still have approximately 10^150 states. Exponential growth is interesting that way.

      I cannot imagine any way--even positing reversible computing and superpositional (i.e., quantum) computing--to reduce it to a solvable problem space. But then again, the universe is weirder than I can imagine, so I'll hedge my bet a little and just say "I cannot imagine it", not "it can't be done".

    5. Re:You're absolutely wrong. by SandSpider · · Score: 1

      I've seen the argument about "more than the number of particles in the universe" stuff before. All over the place. The last time was doing research about WWII cryptography, and how one scheme or another (I believe it was the 4 wheel Enigma) had more possibilities than particles in the universe. And, somehow, we managed to crack it.

      The first mistake is in assuming that you have to store board state in its entierty. We've invented this thing called 'compression.' It's really handy for taking situations which are similar and turning them into something that takes up less space but can algorithmically be turned into the original concept.

      But of course you know abot compression, you just didn't feel like bringing it up, on account of it being contrary to your argument. Or perhaps it just hadn't occurred to you. Entirely possible, I'll admit.

      Now, I would imagine that a clever programmer could probably find lots of patterns in a chess game. Situations in which the same set of moves could be turned into a dictionary entry, for an example of one possible scheme. This would reduce the amount of storage space, and consequently the energy requirements, of the problem.

      Then, let's consider advances in technology that aren't merely software. Let's say...Quantum Computing. Ah, those clever Quanta. You could store multiple bits of information on a single atom, hypothetically. No need for messy atoms when you have subatomic particles and potential states and the like doing your dirty work for you.

      So, just because you couldn't immediately think of a way to do it, despite your Number Theory background, doesn't mean the engineers can't think of a way to make it happen.

      =Brian

      --
      There is nothing so good that someone, somewhere, will not hate it.
    6. Re:You're absolutely wrong. by rjh · · Score: 1

      The first mistake is in assuming that you have to store board state in its entierty. We've invented this thing called 'compression.'

      I'm trying to keep from laughing, but I'm mostly failing. :) It's just funny as hell is all.

      In order to save on thermodynamic costs, you're going to do more processing--i.e., statistical analysis to remove redundancy--to reduce the number of bits required per board. But in the process of doing this, you're going to be setting and flipping orders of magnitude more bits than you would just by a naieve algorithm. So instead of 10^126 joules, now we're looking at (conservatively) 10^130 joules. Sure, you save space in your decision tree, but you do so at a significant thermodynamic cost, and it's the thermodynamic cost which you've got to minimize in the first place.

      Do you see why this is so funny?

      Then, let's consider advances in technology that aren't merely software. Let's say...Quantum Computing. Ah, those clever Quanta. You could store multiple bits of information on a single atom, hypothetically.

      Please, please, please, take a class in algorithmic analysis or formal theories of computation. You are making many errors here, the first of which is you don't understand the computational theory behind quantum computation. You are turning QC into a magical talisman capable of solving anything, when the reality is quite different (and quite well-known to algorithmic researchers and computational theorists).

    7. Re:You're absolutely wrong. by SandSpider · · Score: 1
      In order to save on thermodynamic costs, you're going to do more processing--i.e., statistical analysis to remove redundancy--to reduce the number of bits required per board.

      Granted. I'll also say that the first difficulty in your analysis comes in by stating how much energy it takes to flip a bit. That's a real world contraint that will change over time. How much energy did it take to flip a bit in the 1950's? My guess is that it took a lot more than that. I have no reason to think that it won't go down. Will it go down enough? I suspect it will, because I'm that sort of person.

      You are making many errors here, the first of which is you don't understand the computational theory behind quantum computation.

      Lots of theories, yeah. You know, there aren't really many fully functioning quantum computers, are there? Can you point out some and tell me how they're working right now? Can you guarantee that won't change in the next 10 years. 20? 200?

      Computer theory hasn't been around all that long. These many laws that you have may change. But let's examing what we think right now, shall we?

      I'm going to trust a random source from google, the Universities of Oxford and Cambridge Center for Quantum Computing. According to their site...
      Consider a register composed of three physical bits. Any classical register of that type can store in a given moment of time only one out of eight different numbers i.e the register can be in only one out of eight possible configurations such as 000, 001, 010, ... 111. A quantum register composed of three qubits can store in a given moment of time all eight numbers in a quantum superposition. This is quite remarkable that all eight numbers are physically present in the register but it should be no more surprising than a qubit being both in state 0 and 1 at the same time. If we keep adding qubits to the register we increase its storage capacity exponentially i.e. three qubits can store 8 different numbers at once, four qubits can store 16 different numbers at once, and so on; in general L qubits can store 2^L numbers at once.

      All right, so you have a huge amount of numbers storable on a relatively small amount of space, from what I'm gathering. You know, as a layman. And it goes on to say that operations can be perfomed simultaneously on all these states.

      In fact, isn't that the big benefit of quantum computing? That you can perform parallel computations on the right type of data simulataneously, whereas in our current computing environments you have to perform them linearly (except for various tricks both withing chips and on microprocessors)? Am I to believe that a problem space such as chess wouldn't be the sort of ideal situation to use one of these fancy "quantum processors." Might not some sort of, oh, 256 qubit quantum processor (and you may increase the number of qubits if it makes you feel better) indeed be able to process every chess game, what's the word, simultaneously?

      Of course, that's just theorizing about what we know now, which is the point. You say that, no matter what, there can be no possible situation where we could work out the entire tree. In fact, you ridicule the idea and the people who present it. You may consider doing a little reading into a book by Thomas Kuhn, The Structure of Scientific Revolutions. Your reaction sounds strangely familiar.

      =Brian
      --
      There is nothing so good that someone, somewhere, will not hate it.
    8. Re:You're absolutely wrong. by Anonymous Coward · · Score: 0

      Actually, it is theoretically possible to do computation resulting in balance of no energy being used. (not, of course, using present methods of silicon computation.) Check out Richard Feynman's Lectures on Computation ISBN 0738202967.

    9. Re:You're absolutely wrong. by rjh · · Score: 1

      I'll also say that the first difficulty in your analysis comes in by stating how much energy it takes to flip a bit.

      It's called the Landauer Bound. It's the thermodynamic minimum required to erase one bit of information (or, for any von Neumann computer, the energy required to flip, set or erase a bit). If you can go below this level, then you've just broken the Second Law of Thermodynamics. You suspect that my energy estimate will go down over time? I suspect the Second Law will prevail.

      All right, so you have a huge amount of numbers storable on a relatively small amount of space, from what I'm gathering. You know, as a layman. And it goes on to say that operations can be perfomed simultaneously on all these states.

      Yes. Now sit down and do the math. Figure out how many qubits you need to solve a problem of that magnitude. Figure out the minimum energy required for those qubits. Figure out whether or not the decoherence problem can be resolved for that many qubits (this one is completely unknown). And don't forget to prove that the chess space lends itself to a quantum solution; one of the things we've formally proven about quantum computing is that there are many, many problems which cannot be efficiently solved on quantum hardware.

      All of these are mathematical and/or physical limitations, not technological or engineering limitations.

      You say that, no matter what, there can be no possible situation where we could work out the entire tree.

      Not until computers are made of something other than matter and occupy something other than space and run on something other than energy. Every model we currently have says it's not going to happen. If you want to say "well, it will happen!", then you need to first present a different model.

      It's like saying that I'm "anti-scientific-revolutions" because I believe in the Second Law of Thermodynamics. I'm not anti-revolution. I'm anti-idiocy. Ignoring the Second Law just because "well, someday we'll figure out how to get around it" is a fool's errand.

      For now, for the forseeable future, and very possibly for all time, the entire chess space will be an intractable problem. This is not anti-science. This is not prejudice. This is postjudice; taking a look at the corpus of knowledge and making decisions about what avenues of research are likely to bear fruit and which are likely to be barren.

      If you want to sit there and say "hey, you're a stick-in-the-mud who doesn't believe in scientific progress," go right ahead. As for me, I'm going to take a look down one road and say "as near as I can tell, that's a dead end" and look down another road and say "hey, I don't know what's at the end there, but it looks pretty cool."

      Carl Sagan, himself a great advocate of both skepticism and open-mindedness, once came up with a remark for people like you. "They laughed at Fulton. They laughed at the Wright brothers. They laughed at Einstein. But they also laughed at Bozo the Clown."

    10. Re:You're absolutely wrong. by rjh · · Score: 1

      Please note how I phrased things: it requires the Landauer Bound of energy to set a bit (i.e., to discard the previous state and to give it a new state). This is correct.

      The way Feynman's reversible computers evade the Landauer Bound is that they never discard state. They manage to beat the Landauer Bound, but the Second Law is still upheld.

    11. Re:You're absolutely wrong. by Nept · · Score: 1

      out of curiosity, how big is it for the game of "go" (eg. also called weiqi, igo, baduk). I actually have been getting into go a lot the last couple of months and am finding it fascintating.
      I'd be interested in learning how big the decision tree is for go.

      --
      "Teachers leave us kids alone ..." - Roger Waters, Pink Floyd
    12. Re:You're absolutely wrong. by rjh · · Score: 1

      Not entirely certain, but it's easy enough to come up with some guesstimates.

      A Go board is 19x19 and a game is finished only when the entire board is covered. Each point on the board can, in the endgame state, possess either of two states: black stone or white stone.

      So take 19*19 and you get 361. Since each of the stones can be in two states, we come up with an upper bound of 2^361 (or 4.7 * 10^108) different endgame states. Some of these states will be unreachable and would later be pruned, so this number is best used as an upper bound on the states and not an accurate count.

      Given that there are only 10^35 different states a chess board can be in (as someone corrected me on; the 10^150 number is closer to the amount of different moves, not the number of different states; it's possible to get to the same state by many different paths), we can see the upper bound for the different endgame states of Go just clobbers the upper bound of the different endgame states of chess.

    13. Re:You're absolutely wrong. by chendo · · Score: 1

      If you think the total number of states of chess is large, think about the total sequences Go has.
      Go is played on a 19x19 board, on the intersections. You start with an empty board, where black goes first (This is an even game. In handicapped games, it's a bit different). There is only two restrictions where you can place a stone, 'ko' (a situation where both players can take each other's stone repeatedly) and you cannot place a stone where it would be captured.
      Since I'm not a maths theorist or anything, I'll just calculate the total sequences for the first 10 moves. And it won't be elegant.

      (19 ^ 2) * (19^2 - 1) * (19 ^ 2 - 2) * (19 ^ 2 - 3) * (19 ^ 2 - 4) * (19 ^ 2 - 5) * (19 ^ 2 - 6) * (19 ^ 2 - 7) * (19 ^ 2 - 8) * (19 ^ 2 - 9)

      It may not be correct, but let's just see what number that gives us.

      33147774514824216526540800 (done in bc)

      Pretty large number for only the first ten moves. Now lets try (19 ^ 2) ^ ((19 ^ 2) / 2), just to make it simple. This will only simulate a game where half the board is filled with stones, and no captures are made.

      22454135703741480247312986583970147937178662298077 58933986236005891626399446797707097420467137712625 30248956372964427814806611364222697658052744235366 07216617594180996820205758206078300865047460451496 71279695411300948553716685088048372686299464420447 83716355632768205849612093612903206606491136072744 05859807802611091046588995611364822335164659068180 23960517953048171586213593050675848790270895396181 75910922986480450845192545768285400487510964024764 65994480801

      Going with the analogy above, you would only need one bit to store if the stone is black or white. Then, this board will need 361 bits.

      361 * 3 * 10^-26 = 1.0830 * 10 ^ -23

      1.0830 * 10 ^ -23 * 22454135703741480247312986583970147937178662298077 58933986236005891626399446797707097420467137712625 30248956372964427814806611364222697658052744235366 07216617594180996820205758206078300865047460451496 71279695411300948553716685088048372686299464420447 83716355632768205849612093612903206606491136072744 05859807802611091046588995611364822335164659068180 23960517953048171586213593050675848790270895396181 75910922986480450845192545768285400487510964024764 65994480801 =~ 2.4317 * 10 ^ 436

      If 10 ^ 126 is a frickin' lot of energy, imagine how much energy this would take. Just for a simple game of Go.

      Go programs' strength average around 10-kyu, not much better than an average amateur.

      Chess' complexity simply pales against the likes of Go. So, if there is a program that can beat a professional (more than 8-dan), I will be very, very impressed.

      --
      Founder of Mirror Moon - Tsukihime Game Trans
    14. Re:You're absolutely wrong. by chendo · · Score: 1

      I forgot to mention some things.

      Like Chess, Go has some standard moves called "Joseki" that often appear in the opening or appear where is a conflict between a new piece of territory on the board. So, computers can just analyse the moves that occur the most often, but interesting and possibily advantageous play is often gained from moving away from the Joseki.

      --
      Founder of Mirror Moon - Tsukihime Game Trans
    15. Re:You're absolutely wrong. by chendo · · Score: 1

      I posted a comment on it here. Probably not completely correct, since I'm still doing Year 10 Maths, but here it is.

      --
      Founder of Mirror Moon - Tsukihime Game Trans
    16. Re:You're absolutely wrong. by PrintError · · Score: 1

      I can see it now. When Judgment Day comes, it's all going to be because of a Slashdotter who thinks he knows a lot more about what computers can and can't do than he really does, and goes off to solve unsolvable problems without considering the thermodynamic consequences of his actions. Actually, I'm convinced Judgement Day will be the result of some yahoo using the SAE system instead of the Metric system.
      NASA [nasa.gov]

    17. Re:You're absolutely wrong. by SandSpider · · Score: 1

      or, for any von Neumann computer, the energy required to flip, set or erase a bit)

      Which is more or less why I haven't been focusing on von Neumann computers. I admit that, for our current computing model, the problem space is 'impractical' to solve. And by 'impractical', I mean 'impossible'.

      And don't forget to prove that the chess space lends itself to a quantum solution; one of the things we've formally proven about quantum computing is that there are many, many problems which cannot be efficiently solved on quantum hardware.

      First: no. None of this "an exercise left for the reader" stuff. If I'm going to prove that problems of this complexity are solvable quantumly, I'm going to do it for something slightly better than for the joy of continuing a discussion on slashdot. Thank you for your suggestion, though. Perhaps I would turn the idea into a PhD, or maybe a Huge Sack of Cash.

      Instead, let me point out that there are many sources on the web, physicists included, who think that a chess algorithm is potentially suited to Quantum Computing. The classic examples point Grover's algorithm, which initially wouldn't have worked as it only solved for situations where there is only one correct answer for any given node in a search tree (as I understand it), but later modifications of the algorithm apparently work for multiple correct answers, like in chess.

      I would link to them, but if you think I should do some mathematical proofs just to refute your quick calculations and conjecture, I think you can look up your own references on Google. I suggest using the words "grover", "chess", and "quantum". You can replace "grover" with "computer" if you'd like.

      The quick summary is that there are promising avenues of research, but no conclusion yet. An algorithm has been found for solving the N-Queens problem, but not one of the complexity of chess. Some say yes, some say no, and I believe that's how this argument will go until someone solves the problem or someone else induces the heat-death of the computer by ill-advisedly trying to solve it.

      Personally, I wouldn't bother trying to solve chess this way, except that the solution would be worthwhile for a whole host of other, similar problems. And, as you said, you certainly aren't going to solve this chess problem. But saying that we aren't going to figure a way to solve a basic problem like this if we put our minds to it is foolhardy. No, specific implementations may be doomed to failure, but if it's worth it, we'll figure out a way.

      And no, I'm not going to prove it.

      =Brian

      --
      There is nothing so good that someone, somewhere, will not hate it.
    18. Re:You're absolutely wrong. by kevinadi · · Score: 1

      So if I understand correctly, setting a bit requires some minimal energy requirement according to the 2nd law of thermodynamics. Does this necessarily mean that there's an absolute limit on how big a computer memory can go and there's no way around it without causing a catastrophic event on universal scale?

    19. Re:You're absolutely wrong. by Nept · · Score: 1

      game is finished only when the entire board is covered

      Actually, the game is finished when both players pass and agree to end. It's actually quite rare for the entire board to be filled. Most games I play (with people equal in skill to me) end up with each player using ~150 of the 180 (or 181 for black) total stones available. against advanced players, the game usually ends before even a third of the stones are played.

      --
      "Teachers leave us kids alone ..." - Roger Waters, Pink Floyd
    20. Re:You're absolutely wrong. by danila · · Score: 1

      WIth reversible computers we don't need a large hard drive. We can mostly likely manage with just 1Mb of memory (probably much less - 5Kb is enough for an online chess program). You need to store the current state of the board, some logic and recursion stack. Design a system to enumerate moves from the given position. Design a procedure to determine whether the position is winning for blacks or for whites. Now assume for the sake of simplicity that all games should be no longer than 1000 moves or so (if optimal strategies are longer, my method doesn't work).
      The procedure works as follows. Make a move N1 by whites (or blacks). Now determine if this position is a win for whites (or blacks). If yes, well done, if not, try another move.

      Now just call the procedure from the initial position.

      The only thing that you need to store is the history of moves (If you reduce the total number of states by 10^149 (a very large reduction), you still have approximately 10^150 states.

      Hey, quantum computers doesn't reduce number of states by a few percent (10% on your case), it reduces them by orders of magnitude.

      --
      Future Wiki -- If you don't think about the future, you cannot have one.
  69. Hey! by SunPin · · Score: 1

    I'm a werewolf you insensitive clod!

    --
    Laws are for people with no friends.
    1. Re:Hey! by gl4ss · · Score: 1

      quit bitchin, werewolfs are still human.

      at least in nethack.

      btw, you might NOT want to sacrifice them unless you're chaotic(not that there's much point even then).

      now, you should creata a computer program to play nethack that learnt as it went and see how long it takes for it to get good enough to finish(though, maybe somebody has run some experiment as well on some academic level at least).

      --
      world was created 5 seconds before this post as it is.
  70. do we live in the matrix? by LostboyTNT · · Score: 1

    well sure we can.. 1 at a time :D

    but think of it this way..
    even we could figure it out.. where could we store that information? we'd need a computer the size of the universe, with each particle being able to store the information for 1 particle in it.

    (or is that the way it really is.. and we just live in... the matrix :)

    --
    LostboyTNT MercyHosting.Com

    Server-Status.Com

    50Bux.Com

    TLDR.Com

  71. The simple state of Man vs. Machine by Anonymous Coward · · Score: 0

    I've been playing Japanese Shogi on my PC for a while. It is like a more volatile Chess where there is only a king and 8 pawns. Pawns can move any distance N,S,W,E. The King can more any distance N,S,W,E,NW,NE,SW,SE. The only thing that impedes the distance is a blocking piece.
    I've learned the purpose of the game is to take advantage of your opponent's weaknesses while not exposing any yourself unless you are trying to trap your opponent which you must also pay attention to not let happen to yourself.

    If a computer can be taught these simple rules and have it review all past strategies ever used then it will be on par with any opponent (human or PC). It is a game of beating the borg. You have to come up with newer ever-more clever strategies in the hopes of fooling the computer into thinking that you are employing a different strategy.

    Or just tell it that "everything I say is a lie" and watch smoke bellow from the mainframe. You also might want to plan an escape route in advance. IBM suits would be after you in no time!

  72. It's getting worse! by Anonymous Coward · · Score: 0

    perChIlDKind?

    Couldn't wait to stick your big CIDK into that word, couldn't you!

    Sexist pig!

  73. spookily similar to the plot of this book by Anonymous Coward · · Score: 0

    Pandora's Box by Jim Farris
    http://xaa.tripod.com/PBMain.htm

  74. Chess Players have their opinions... by Valar · · Score: 1

    Chess players tend to think that they will always have an edge on machines, because they like to think that chess is more than just some mathematical system. Often times, they associate chess skill with intelligent thought. If a computer can beat them, then there's nothing magical about the game that makes it a judge of "intelligence." Furthermore, you can hardly say that computers will never beat humans at chess because they havn't been 100% sucessful in doing so thus far. A couple of generations of architecture ago, a computer would not have posed to challenge to a grandmaster. Now, computers and humans look about even. Unfortunatly for the people rooting for humanity, computers "evolve" faster than we do, and in a couple of years, this debate will probably be over.

  75. Why only compete against the pro chess players? by lexus99 · · Score: 1

    Really! Playing chess is just like anything else. There are experts everywhere, but MOST are not famous.

    I think a much more fair competition would be to allow play against this super chess playing computer available registered users via the Internet.

    Registration should require some sort of mini-test to evaluate the basic chess skills of the user (this would prevent non-chess players from wasting precious CPU time.

    Basically, my point is, there are probably high school kids in the chess club that could beat any computer chess game that would otherwise never get the chance. Let's see it!

    1. Re:Why only compete against the pro chess players? by Anonymous Coward · · Score: 0

      You've got to be kidding or trolling, right? There's no way in hell a high school nerd is going to beat this thing, and will have very little chance against a real chess pro. Get real!

      My HS chess team sucks, and so do all our competition. I hate to play chess (but know the rules) and could beat any of those misfits.

      Ba!!!

  76. Re:So it can beat a human at chess. Big F'ing deal by mOoZik · · Score: 1

    The whole point is the evolution of computers. When you take into account how fast computers (processing, software, etc.) are progressing in specialized tasks, it doesn't take an Einstein to see the implications a century or so from today, where they may very well combine all their specialized tasks and kick our inefficient asses. Think about the bigger picture.

  77. Man wins. by dameron · · Score: 1

    Man wins.

    The man who makes the tool that beats the guy without the tool wins.

    Guy with gun beats guy with sword, guy with sword beats man with fist. Man with fist beats armless dude.

    Simple enough for you?

    This isn't a question of man vs. machine. This is man vs. man.

    The "machines" are created by man as a collection of chess knowledge and principle. Essentially they're chess by committee, a very fast, giant, and efficient committee, but a committee nonetheless. Flaws in their understanding of the game will be reflected, and the imperfect compromises intrinsic to such aggregate systems will manifest themselves. (see: every funny Dilbert)

    BTW, the dude actually playing vs. the software engineers and hardware developers ('cause that's who he's really playing against, they, and the chess "experts" who help them) might have a recital to attend, simultaneously he might have an itch, a touch of alcoholic dementia, gas, a football match, shingles, or a really profound comment that should appear here...

    Likely not.

    Show me a computer with shingles and a penchant for "Old Hickory" and I might accept this whole man vs. machine business...

    'til then,

    -dameron

  78. Real AI by t0ny · · Score: 1

    I'll only be impressed if they add in a real trash-talk routine. I want to computer to tell one of these guys something like "your game is weak", or "nice move- does your husband play chess too?"

    --

    Manipulate the moderator system! Mod someone as "overrated" today.

    1. Re:Real AI by phr1 · · Score: 2, Funny

      There was a program called "Chesster" which kibitzed like that. Much more amusingly, back in the 80's, the builders of the Belle chess computer interfaced an industrial robot to it to let the computer move actual pieces on a real chessboard. The robot was something they had around the lab for some other project, and it had very powerful motors (it was designed for automobile assembly or something like that). They had to carefully program the robot to pick up the chess pieces gently and put them down without slamming them through the table. Unfortunately, due to a software bug, the story goes, the robot would sometimes lift a captured piece and crush it into powder. I would imagine that to be a scarier put-down than any silly heckling coming out of a console terminal or speech synthesizer.

    2. Re:Real AI by linuxbikr · · Score: 1
      Unfortunately, due to a software bug, the story goes, the robot would sometimes lift a captured piece and crush it into powder.

      I don't think that endgame was programmed into the computer. :)

      Or maybe it was intended to be human intimidation. Robots crushes chess piece, human holds up taser gun and looks for weak point on robot. I think a robot would back off when threatened with 50,000 volts.

    3. Re:Real AI by t0ny · · Score: 1
      That reminds me of something they said about the game "Battle Bots". One of the only weapons-related rules is no electrical attacks.

      Apparently, having the other bot short out with a slight puff of smoke turned out to be too anti-climactic a way to end the match, and defense against it would raise the bar too high for most competitors (insulation, anti-shock electronics, etc).

      --

      Manipulate the moderator system! Mod someone as "overrated" today.

  79. Comment removed by account_deleted · · Score: 1

    Comment removed based on user account deletion

  80. Yeah, but what about the Matrix? by Anonymous Coward · · Score: 0

    In the Matrix, everyone was actually plugged into the giant energy-creating machine and had their consciousness fed through the machine. If the computer wanted to, at any time it could have pulled the plug on anyone.

    If we all existed in a Matrix-like world where what we see is not really reality, then I would be afraid that at any moment some 'other' could pull my plug.

    Philosophers have long debated the concept of being and have come to no conclusion as to whether this reality is actual reality or simply a complex computer program designed to make us think we exist. It's scary to think that this reality may not actually be our real reality, you know?

    I'll be sure to take the blue pill if anyone ever asks me to make the kind of choice that Neo made.

  81. Re:So it can beat a human at chess. Big F'ing deal by Anonymous Coward · · Score: 0

    ...not to mention that it's a calculator that will probably get laid more than its opponents.

  82. X's and O's by deathcloset · · Score: 1

    I had this discussion with a friend of mine once, is chess just a larger more complex type of tic-tac-toe?

    I mean, it is possible to end in a stalemate after all. Is it at least concievable that the only way to assure not losing is to simply create a cats game?

    would this explain the large amounts of draws we are seeing here? Is it an eventuality that someday computer vs computer and computer vs man games will all end in stalemates?

  83. Comments from a Competitve Chess Player by digitaltraveller · · Score: 4, Interesting

    Something the article doesn't touch on is that although chess grandmasters were caught off guard by the strength of chess computer's in the mid-90's, since then we have learned a tremendous amount about the computer's weak spots. The computer for example is very poor at playing in tight positions like some lines in the Caro-Kann and French defenses. Also many of the so-called hypermodern openings.

    I imagine the new breed of young GM's like Ponmariov, Grischuk and Malakhov probably find the prospect of beating stock Fritz/Junior/Hiarcs rather boring. A few extra CPU's isn't going to make a big difference in terms of playing power. Much more effective is to spend time tuning the engine's opening book and that takes traditional GM's with novelties.

    Kasparov should win this easily, though he did miss a trivial 2 move combination in a tournament recently so you never know...

    1. Re:Comments from a Competitve Chess Player by civilengineer · · Score: 1

      We did not learn "tremendous amounts" about computers weakspots. We just gave up the idea that we can beat them as Kasparov lost to a computer and that is engough to prove that computers have surpassed humands. Since you say you are a competetive chess player, you must have heard about the ranting of Kasparov that the program was tailored made for him and Kramnik or Anand would have beat it easily. Well, if we spend the same amount of money that we did on Deep Blue today, we can get a computer that will beat Kasparov 6-0 in a similar match.
      I imagine the new breed of young GM's like Ponmariov, Grischuk and Malakhov probably find the prospect of beating stock Fritz/Junior/Hiarcs rather boring.
      Its just your imagination.Did you see how Ponamariov won against Ivanchuk in the world championships?? He basically got uber lucky in lost positions as Invanchuk was in time trouble. Any decent computer in place of Ivanchuk would have finished Pono gracefully. A few extra CPUs is all takes it now to beat a human big time. But, you also need to write parallel processing software, and that takes invetment. But, since the point is already proved that computers can beat humans in a match(Kasparov Vs Deep Blue), nobdody wants to invest money again to prove the same point.

      --

      New year Resolution: Don't change sig this year
    2. Re:Comments from a Competitve Chess Player by Anonymous Coward · · Score: 0
      > nobdody wants to invest money again to prove the same point.

      Also the possibility that the "rise of the machines" spectre will generate negative publicity among an ignorant media, even though typical geeks would say "isn't that cool".

  84. Re:Face reality by Anonymous Coward · · Score: 0

    Yeah, yeah.

    You're just mad cause Mia Hamm can kick yer ass.

  85. Man can always win by _Sexy_Pants_ · · Score: 1

    So long as there's a power outlet to pull

    --
    Look it's a joke about my sig IN MY SIG! LOL!
  86. Computer improvement by br00tus · · Score: 1
    Just as in normal chess, we have to break down the computer game into three parts, and then subparts

    Begin with the end, the endgame. The end of the endgame rather. This (the end of the endgame) the computer does play perfectly. It's skill keeps improving as the tables come out - three pieces left on the board, four pieces left on the board, five pieces, six pieces...and I see this continuing. So the computer is increasingly perfect in this respect.

    Opening - the computer can't innovate yet (although it can be used to help in innovation), but it does have an up-to-date opening book, and will play as good an opening as has ever been played by the best players.

    This leaves the middle game (which also expands somewhat to the end of the opening and beginning of the ending). In this the computer plays tactically better than the human.

    So we have (end) endings, which are played perfectly, openings, which, discounting an innovative new opening, it plays as well as the best players up to today have ever played, and it is probably tactically better in the middle game. So where does that leave the chess grandmaster? Well, the old tried and true innovation in an opening can always work - it's helped human top players beat other human top players. Barring an innovative new opening, that leaves strategy, specifically, middle game strategy. There are some things computers have always been bad at such as gauging the importance of passed pawns, playing closed games and so forth. That is the method the computer can be beat with currently. I don't think it will last forever though, in the next few decades I think it will become more and more rare for a human to beat a computer, it being more likely that there will be a draw, or even a loss.

  87. Re:Face reality by rodrigoandrade · · Score: 0

    Been watching the 9-ball championship??

  88. "No true human world champions" by MacGabhain · · Score: 4, Insightful

    This is the constant claim of the meaning of computers outpacing humans at chess, and it's complete BS.
    Machines have been outpacing humans in various endeavours for years. Eventually computers will be powerful enough and well programmed enough that they'll never lose (although they certainly will still draw).
    Big deal. Either show me the sprinter who can beat a formula 1 or show me the movement to claim there are no longer human champions in speed. I don't see either of those, so I don't see why it should matter for a mental game.
    I see no reason why we should care if computers can someday see all possible positions 35 moves out. Chess isn't about that. Chess is a game of reason, of insight, of spacial perception, of memory, of stamina (you try concentrating on one thing for 6 hours), and of emotion. Seeing forcing variations a dozen moves out is rarely part of the game for humans, and plenty of players have risen to the top of the game almost never calculating beyond 2 or 3 moves out. Giving a machine an 800HP engine and wheels takes absolutely nothing away from the human accomplishment of mastering the game.

    1. Re:"No true human world champions" by forgotmypassword · · Score: 1

      I think it all boils down to the fact that no computer created by man will ever be able to calculate all the moves, as the number of permutations are far too large.

      The advantage of the computer is that it can see a few more steps into the possible future - the number of steps increasing with technology; and that it executes it's algorithms perfectly. But the advantage of the human is that he has a much more complicated set of algorithms in his head than the programmers have in the computer. The human's algorithms will probably be much better than the computer's for a very long time, especially because humans can learn new algorithms very easily and the best human players aren't programming the computers.

      Currently if you set a chess master in front of a computer, he may initially lose, but over time he will develop algorithms that will allow him defeat the computer fairly easily.

      The point being, AI just isn't good enough yet.

    2. Re:"No true human world champions" by Illserve · · Score: 2, Insightful

      There's a good reason why people like to think we'll remain smarter than computers: it's the last thing machines haven't beaten us at.

      Machines can fly, move faster, lift more, work faster, and are even quite good in the sack.

      The only thing left in which we humans can claim superiority is "smarts". So naturally people are going to have a strong emotional reaction when challenged in this last domain. Hell it happens every time we're challenged by machines, but this last domain is going to be the worst.

      Progress is inevitable and there will be some crying, but eventually people will be glad for their intelligent computers that help them get more done in the day, the same as they are glad for their car(rocketpack) when they drive(fly) to work.

    3. Re:"No true human world champions" by ojQj · · Score: 1
      I was right with you up until the optimistic upturn at the end of your post.

      Why do you think that a machine smarter than a human would have any interest in working for a human? It might not "help [us] get more done in the day", it would be at least able to do everything we could do.

      I think a future in which machines are smarter than we are is very murky and hard to predict. It might even be a future we can't understand anymore.

    4. Re:"No true human world champions" by GlassHeart · · Score: 1
      The only thing left in which we humans can claim superiority is "smarts". So naturally people are going to have a strong emotional reaction when challenged in this last domain.

      You're right, but it's silly because arbitrary mental puzzles like Chess are horrible indicators of intelligence. They are intentionally hard for humans, because they require talent we haven't necessarily evolved. Open a book of puzzles, and you'll find that just about every problem can be solved by a modern computer in milliseconds, even with brute force algorithms. Yet it takes us minutes and minutes of pencil work to solve.

      Chess is hard partially because we (the general human, not chess grandmasters) have difficulty remembering every step we consider. We really shouldn't feel far more threatened than finding out calculators can add more quickly than we can.

    5. Re:"No true human world champions" by Ziviyr · · Score: 1

      A formula 1 won't get very far on a plate of pasta.

      Of course the human champion might slow down a bit with gasoline in his gut too.

      Why did I say this?

      --

      Someone set us up the bomb, so shine we are!
  89. Discussion board + Deep Blue vs today's micros by migstradamus · · Score: 4, Interesting

    There has been a chess message board discussion where the author of the article mooted his ideas last week. I write for ChessBase and worked on both of the last big man-machine matches (Kramnik-Fritz 2002 and Kasparov-Junior 2003).

    For those here who claiming obvious Deep Blue superiority over current micros because of how many chips it had and how many positions per second it looked at, some chess knowledge would help. Deep Blue only played six games and all have been analyzed to death. We know two things. One is that Deep Blue beat Kasparov and that's the only thing most people care about, the result. The other is that Deep Blue's play was far from perfect.

    Years of human and computer analysis can about as close as you can to the truth in chess. With that knowledge we can compare Deep Blue's moves to those of the current top programs such as Fritz and Junior. And we have, extensively. The bottom line is that they play better in many places, the same in others, and worse only in very few. The overall level of play by the micros in the same positions from the Deep Blue games is better. With Deep Blue in pieces that is the only way to compare the quality of their chess. Positions per second is interesting and not irrelevant, but time marches on and knowledge is important too.

    While the humans in these matches obviously have some interest in saying that the program they are playing is the strongest, hundreds of other analysts don't. And Kasparov and Kramnik aren't going to make fools of themselves by recommending moves that could be easily shown to be inferior.

    Kasparov played some of the most inconsistent and nervous chess of his life in the pressure-cooker match against Deep Blue in 1997. He resigned in a drawn position for the only time in his career and Deep Blue's other win, in the final game, came in a total mental collapse by Kasparov and was the shortest loss of his career in a serious game. All credit to the Deep Blue team, mission accomplished and all that, but it wasn't the greatest chess.

    Meanwhile, humans studied and learned. Kasparov's attempts to baffle Deep Blue by playing intentionally inferior moves was ill-advised. That era was over, he just didn't know it. But computers still have their weaknesses, as Kramnik showed in the first half of the Bahrain match.

    The top programs today running on the fastest micro hardware available play better chess than Deep Blue '97. But the top humans play better, and smarter, against them than Kasparov did in 97.

  90. Re:So it can beat a human at chess. Big F'ing deal by nefele · · Score: 1

    Ill be impressed when they have a computer that can beat me at chess, write a sonnet, cook up lunch, play fetch with a dog, ponder a sunset, drive a car, change a diaper, laugh at groucho marx, and wonder if it has a soul.

    I believe the correct word in this case is 'useless'...

  91. Neurodynamic programming: tree size not crucial by tessaiga · · Score: 4, Interesting
    Just to nitpick a little (since you're a math person, I thought you'd appreciate having your terms right): there are 10^120 different possible sequences of moves. The number of different states is actually quite a bit smaller, only around 10^35 or so. (A rough approximation would be 64!/32!, or the number of different ways you can set up a chessboard.) As a side note, this figure originates from a paper by Claude Shannon, the so-called father of modern communications ("Programming a digital computer for playing chess", Phil. Mag., pp 356-375, 1950). All computer chess programs today are based on the fundamental principles from this paper.

    However, noting that the state-space size is large isn't really a very useful observation, since chess programs these days don't try to map out the entire tree of possible outcomes. Instead, they operate on neurodynamic programming techniques, which basically try to extract which "features" of the game are important and weigh those features to decide which moves to make. This significantly reduces the complexity of the system, but requires that the person writing the program have some intuition about which "features" are important. In chess, for example, these include such things as material balance, piece mobility, king safety, and other positional factors. A period of training is usually required as well, where basically the computer goes over a lot of games that grandmasters have played and tries to "learn" how to weigh the different features in order to choose the optimal move.

    For those who are interested in reading further about this (yeah, yeah, this is Slashdot, if people can't RTFA what are the odds they'll want to pick up a book? :) ) a good place to start would be Chapter 6 of Bertsekas' "Dynamic Programming and Optimal Control".

    --
    The bold print giveth, and the fine print taketh away ...
    1. Re:Neurodynamic programming: tree size not crucial by Shazow · · Score: 1

      Correct me if I'm wrong, but this does not account for repetetive moves, in which case there are infinite number of possible moves.

      Especially when a human is playing. :D

      You never know what kind of wacky stuff one might do.

      *sacrifices his queen entirely out of spite*
      Mwahahhahaa!!! (Heh, I realize this does not hinder the processing algorithm, but it's still fun to do.)

      - shazow

    2. Re:Neurodynamic programming: tree size not crucial by tessaiga · · Score: 1
      Correct me if I'm wrong, but this does not account for repetetive moves, in which case there are infinite number of possible moves.
      In a move tree, repetitive moves are represented by cycles on the 'tree', and don't add any more nodes. In other words, I just return to a node I visited before, so no new node is created; the tree just kind of "doubles back" on itself. The number of nodes in the tree is still finite.

      (I use quotes around 'tree' because technically it then becomes a general graph ... but that's a quibble.)

      --
      The bold print giveth, and the fine print taketh away ...
    3. Re:Neurodynamic programming: tree size not crucial by rjh · · Score: 1

      Just to nitpick a little (since you're a math person, I thought you'd appreciate having your terms right):

      Absolutely. Thank you for this correction; I was going from a recollection of Norvig's number. On the other hand, the 10^120 sequences of moves is also a killer; sure, you only have to store 10^35 boards at 256 bits each (which is still an outrageously large number), but since you're turning it into a decision tree you need to keep track of which moves take you into which other states. Storing 10^120 pointers for the tree leads you into a similar thermodynamic catastrophe.

      I'll happily concede the 10^35 different boards, but I think the tree links themselves are enough to keep my original line of reasoning intact.

      However, noting that the state-space size is large isn't really a very useful observation, since chess programs these days don't try to map out the entire tree of possible outcomes.

      I'm aware of this. My response was meant only as a refutation of the (incorrect, IMO) notion that the game space of chess would eventually be fully mapped.

      I have very little doubt that the ChessBase article is spectacularly wrong. When the author says that so far "both sides are holding their own", he's not exactly on the same planet the rest of us are. In the 1970s, chess programs were trivial toys that children could beat. In thirty years they've ascended to the very top rank. When the gap between man and machine closes that much in just a few years, you don't say "both sides are holding their own"; you say "the machines are really moving up".

    4. Re:Neurodynamic programming: tree size not crucial by tessaiga · · Score: 1
      First off, let me say that I agree that whether we're talking about 10^35 or 10^120 is largely moot; both of those are ridiculously large numbers. I'm only trying to address some of the points you brought up in this post, not to refute your conclusion that mapping the entire decision tree is infeasible.
      On the other hand, the 10^120 sequences of moves is also a killer; sure, you only have to store 10^35 boards at 256 bits each (which is still an outrageously large number), but since you're turning it into a decision tree you need to keep track of which moves take you into which other states.
      It's the actual solution of the problem that requires the tree, not the part about writing a program which implements the solution once it is known. Basically solving this type of an optimization problem involves calculating a "score" for each of the states that tells you the relative value of being in a given state versus another. Suppose the computer is in state #1. When it's the computer's turn, the computer (depending on the board position and pieces) has several choices of moves, which correspond to moving to states #2, 3, 4, ... , N. Basically all it has to do is consult a look-up table to see which state has the highest score, and make the corresponding move. The difficulty is in coming up with the "scores" for each state.

      The point of neurodynamic programming is that instead of having to store scores for each state, you only have to store scores for each "feature". For example, a simplistic program might decide that the only important feature is which pieces are left on the board. Then suppose during the program's turn it has the choice of either taking a pawn, a bishop, or a rook. It would consult its (small) lookup table and see (for example) that a pawn has score 1, a bishop has score 3, and a rook has score 4. It would then conclude that taking a rook leads to the state with the highest subsequent score, and make the corresponding move.

      In the preceding example, you'd only have to have a 6 entry lookup table, corresponding to the 6 different pieces, instead of a 10^32-entry one. In reality, there are plenty of other features which are important (mostly positional), but the final size of your lookup table will still be much smaller than if you hadn't performed feature extraction.

      Of course, the hard part is scoring each feature. As I mentioned in my earlier post, this is where the "training" part comes in. By the way, choosing features intelligently is also a big part of making a program perform well, which is the primary reason why chess programs perform so well while Go programs do not. The understanding of how to quantify which features on a Go board are important is not nearly as well understood; this is evident if you ever listen to skilled Go players watching a game in progress, where they'll be lots of comments about "shape" and "influence" which even the players themselves will find hard to quantify.

      --
      The bold print giveth, and the fine print taketh away ...
    5. Re:Neurodynamic programming: tree size not crucial by Anonymous Coward · · Score: 0

      Actually, no there are not an infinite number of moves.

      If you repeat the same position on the board three times it is a draw. It's a great thing to fall back on if you can't force a win. You may still be able to force a draw by repetition.

      Additionally, you don't really need to store all of the moves getting to a state in the game tree to determine if a given position is a win or a loss. Only which side's turn it is, what the last move was (to determine if you can capture e.p.), and if it is still legal to castle king's side and queen's side (rook or king has moved).

      All possible games resulting in exactly the same state as I defined, have the same conclusions. You can simplify the tree by using the same node in all of these cases.

      Doesn't really make the calculation any more possible, just a little less impossible :)

    6. Re:Neurodynamic programming: tree size not crucial by David+Jao · · Score: 1
      If you repeat the same position on the board three times it is a draw.

      Additionally, you don't really need to store all of the moves getting to a state in the game tree to determine if a given position is a win or a loss.

      The first quote of yours above contradicts the second.

      Without knowledge of the previous positions of a game, you have no idea whether a future position has been repeated before, and therefore no idea whether it would draw or not.

      Maybe, in some hypothetical chess variant that did not require consideration of draws, it would be enough to store only the current position plus a few extra bits. But in real life chess, you do have to keep track of the previous positions, because those previous positions affect whether your future moves will lead to draws or not.

    7. Re:Neurodynamic programming: tree size not crucial by rjh · · Score: 1

      It's the actual solution of the problem that requires the tree, not the part about writing a program which implements the solution once it is known. Basically solving this type of an optimization problem involves calculating a "score" for each of the states that tells you the relative value of being in a given state versus another.

      First, I think neurodynamic programming is very cool; we're covering it right now in one of my algorithmic analysis courses.

      That said, I think we're at loggerheads here; you're talking about sensible and smart ways to approach the chess game computationally, while I'm talking about how the naieve way to approach the chess game (a conventional decision tree and some kind of depth-first or breadth-first algorithm) is totally impractical.

      I don't disagree with anything you've written; I think it's pretty interesting, honestly. I just think I'm trying to say something different. :)

    8. Re:Neurodynamic programming: tree size not crucial by njdj · · Score: 1

      only around 10^35 or so. (A rough approximation would be 64!/32!, or the number of different ways you can set up a chessboard.)

      64!/32! is actually a few times 10^53, not 10^35.

      Also, the number of possible ways to arrange 32 pieces on a chessboard is much less than 64!/32! because some of them are identical. For example, the number of ways of placing 2 white rooks on a chessboard is not 64x63, it's only 32x63.

  92. A Draw by Anonymous Coward · · Score: 1, Insightful

    It will be a draw. It pays better than loosing, and why risy a defeat when you can get a draw. All GMs of the world are doing that and, if the computer is really smart, it will do the same...

  93. Man v. machine? MACHINE. by micromoog · · Score: 1

    Wasn't this pretty much settled when Kasparov got his ass kicked by Deep Blue in '96, then again in '97?

  94. Geeks 1, Machines 0 by strobexii · · Score: 1

    In the age old battle of Man vs. Server, man has crushed his opponent once again.

  95. Who cares? by olrik666 · · Score: 2, Insightful

    I mean, machines have beaten us for a long time.

    We're not complaining about cars going faster than us. That's why it's still exciting to watch the Olympics 100-meters.

    I don't care one bit about man vs. machine in chess.

    All I care is man vs. man.

    1. Re:Who cares? by Anonymous Coward · · Score: 0

      Oh you mean like Man on Man.

  96. Not contradictory by magores · · Score: 2, Interesting

    Your first quote references Kasparov vs Computer

    Your second quote references "strongest humans"

    Basically, what you post states that computers are getting better via one person, but a few/many/some people that are getting better vs the computers. Therefore, no necessary contradiction.

    Nowhere referenced is Kasparov vs the other guys.

    We could take it as a given that Kasparov is better than all the other guys, but I reject that arguement. On the flip side, I also reject an arguement that says the other guys are better than than Kasparov because they are doing progressively doing better against the computers.

    There are a couple of posts above re: pitting a computer against a more "technical player" than Kasparov. I think this could be interesting.

    In short, no. The statements are not contradictory. Kasparov is not plural.

    (BTW... in deference to the people that bitched about people being sexist, I mean "guys" to reference men AND dames. We cool on that?)

  97. Re:Man v. machine? MACHINE. by phr1 · · Score: 2, Informative
    Nah. Kasparov didn't get his ass kicked in '96, he WON that match, 3.5-2.5. He lost the '97 match by the same score. However, the '97 loss wasn't all that convincing. He certainly would have won a longer match, or a rematch against the same hardware and software. On the other hand, if a rematch had happened, it would not have been against an identical Deep Blue 2. The designers would have kept making improvements and speedups and gotten an even stronger machine, that might well have been convincingly stronger than Kasparov.

    I think it will be several years before anyone builds anything as strong as Deep Blue II. At that point, the top grandmasters will have something to worry about. For now, the claims that PC programs like Fritz are as strong as DB2 was are mostly marketing hype.

    For more info, see Deep Blue designer Feng-Hsiung Hsu's book "Building Deep Blue", about the work that went into the machine and how the Kasparov matches went.

  98. The computers' first problem by Anonymous Coward · · Score: 0

    "Thus the top seven in the July 2003 SSDF list were all various versions of Fritz or Shredder, running on the most powerful hardware used by SSDF members (256MB Athlon 1200 MHz)"

  99. Screw Chess by Anonymous Coward · · Score: 0

    I wanna see Matthew Broderick play tic-tac-toe against it.

  100. Re:Face reality by Sivaram_Velauthapill · · Score: 1

    I disagree with you--and your anthropologist friend :)--on this issue.

    There have actually been matriarchial societies. Though they have been few and obscure. I think the reason history was mostly patriarchial is because POWER rules! And regardless of how you look at it, men had more power than women back then. This is especially true since physical power (as opposed to mental) was the only thing that mattered before. Needless to say, women simply were inferior to men when it came to physical power.

    You can see what I mean when you look at econopolitical systems. The past was ruled by elitist systems (this is still true today but not as badly as the past). And elitist systems usually mean that one person, or one family, or one ethnicity, or one region, or one profession, ruled over others. Since men had more physical power (and this is all that mattered back then, before the advent of science and stuff), men ruled women--simple as that.

    As far as women not being good at something like chess, it may have more to do with the environment and discrimination than anything else. One reason could be that women just aren't interested in games like chess (just like how they aren't really into certain computer games). In addition, women in most of the world (I'm talking a massive majority) are treated as inferiors to men. Even Russia/USSR, where a lot of grandmasters come from, did not empower women. So what you get in the world is that only a small percentage of women actually play chess.

    I'm not saying that you will get equal number of men and women at the top. But what you should see is far more women in the top rankings. The present listings have very few. I think this will increase.

    Your football vs cooking analogy is misleading because football is a physical activity. Women will always be worse off than men and hence sports like football will be dominated by men. Chess isn't physical so that restriction isn't presnet...

    Sivaram Velauthapillai

    --
    Sivaram Velauthapillai
    Seeking the meaning of life... @slashdot of all places ;)
  101. +5, Informative? by Anonymous Coward · · Score: 0

    How did so many get trolled off their asses so hard by this post?

    1. Re:+5, Informative? by Anonymous Coward · · Score: 0

      At first glance I thought it saw a +5, funny. I googled for wereman woman and a few matches showed up. Curiously none of the links were from everything2.com.

  102. Necessary Non Sequitur by neoshroom · · Score: 0, Troll

    I, for one, welcome our chess-computer overlords.

    --
    Big apple, new Yorik, undig it, something's unrotting in Edenmark.
  103. Re:Face reality by simcop2387 · · Score: 0

    Hey i am a ... hold on let me check.... Man, and i can swear to you that i am ... hold on let me look up that word... retarded, it only took me 40 minutes to find that page in the dictionary, they should put those words in some kind of order, i mean shouldn't the q's and u's be together what kind of logic doesn't do that?

  104. who modded up this troll? by stroustrup · · Score: 0


    I should point out that I'm a large number theorist
    You are obviously not a chess player. No chess game at GM level gets played to the end. Once someone establishes sufficient material or positional advantage, the opponent resign. You don't have to compute all the possible moves to win at chess. You just have to analyze the current openings which( are already analyzed till move 10 to 20 generally )and find novelties. Then, your opponent will start moving into time trouble because he has to come up with ad hoc responses and his repertoire will be of no use anymore. Since you already know what the best responses to your moves should be, any other move played by the opponent can be exploited to achieve positional or material advantage. Computers are already powerful enough to do this. But, since the world champion has already lost to a compuer nobody is interested in investing big money to prove the point again which was already proved. But, humans don't have to be ashamed of losing to a computer at chess. That's like comparing an athlete with an F-16. Who will win?

    --


    If you lost your job today, don't despair. You may die tomorrow anyway.
  105. only 16 top-level comments by Anonymous Coward · · Score: 0

    it only took 16 top-level comments until somebody injected a go thread in a chess story. why does this always happen and so quickly? we all know that go programs are not comparatively as good as chess programs. this is a chess story. yawn.

    1. Re:only 16 top-level comments by Anonymous Coward · · Score: 0

      No, it is NOT a chess story... -yawn-

      If it were a chess story then why is it posted on slashdot?

      Chess is not dissimilar to tic-tac-toe when compared to the complexity of Go.

      Even though the title of the article (which asks the question who is the better player and get's answered in the first title of the article?) states that it's a chess article, it is more an article about people vs. machines in intuitive games. Which chess only barely qualifies as.

      I may not know much about Go, certainly less than I know about chess, but I know enough to know that it is a RELEVANT issue that people are not aware of and that certainly deserves the majority of posts on this board as (perhaps unlike yourself) very few people are aware of, and would appreciate the information.

      The poster of the previous article has done a lot of people a favour, as Slashdot is unlikely to post an article that is actually interesting and not this boring chess nonsense.

    2. Re:only 16 top-level comments by Megane · · Score: 1

      ...and not too many more comments before someone whined about it. When someone posts about Go in a chess story, why does this whining always happen and so quickly? we all know that go trolls are not comparatively as good as chess trolls. this is a chess troll. yawn.

      --
      #naabhaprzrag, #sverubfr-000, #agi-fcbafberq, negvpyr[pynff*=' negvpyr-ary-'] { qvfcynl: abar !vzcbegnag; }
  106. The world is becoming like what the matrix fortold by Anonymous Coward · · Score: 0

    Doesnt anyone agree with me? The robots are evolving in their own way...

  107. What RMS thinks by RevMike · · Score: 1
    Now you are being silly. Everyone on SlashDot knows that RMS has deprecated man in favor of texinfo!

  108. Humans winning by fishbowl · · Score: 1

    The computers may have more precise tactics and a better endgame, but the humans are having more fun.

    The computer is not capable of playing chess games for the price of beer, getting shitfaced, and having fun at it.

    And that is the bottom, final line on man versus computer in chess.

    --
    -fb Everything not expressly forbidden is now mandatory.
  109. World's Strongest player?!? by Doomdark · · Score: 2, Funny
    In a few weeks, the world's strongest player Garry Kasparov...

    Jeez. And I thought only skinny nerds played chess... but this Kasparov dude is not only ace chess player, but very strong too? What's he doing with the 'puter then? Smashing it to pieces with a well-placed sucker punch? I'd like to see him duke it out with Arnold!

    --
    I like paying taxes. With them I buy civilization -- Oliver Wendell Holmes
    1. Re:World's Strongest player?!? by kolbeinn · · Score: 1

      "I see your point, sir. I suggest a new strategy, R2. Let the Wookiee win."

      --
      End of line
  110. Why "Chess is dead." by rice_burners_suck · · Score: 1
    This may be true... until:

    Bobby Fischer (sp?) once said that, "Chess is dead." I think he meant that because computers can play chess (better than most human players), and with things like chess databases, what's the point anymore?

    Well, this is what I think will happen: One day, someone will build an enormous cluster of computers just to solve this problem. It'll have zillions of terabytes of storage, and computers will be put to the task of computing every possible move that the computer considers relevant. In other words, blatantly stupid moves, or those that lead to situations that a normal computer can figure out quickly "on the fly" will not be included. But otherwise, entire games will be computed to the point that no matter how you start and what moves you play, the computer will always win because it "knows" nearly every possibility by heart and will therefore will "force" you into a pre-specified set (a very LARGE set, but a set nonetheless) of moves. It will do this by simply looking in a huge lookup table. It will serve as a worldwide chess server, and thousands of people could simultaneously play against it. In the course of doing so, the computer will throw away information that is excessive and will store new relevant information that it must compute. Essentially, it would be a learning machine, and it would never forget a mistake or a good move.

    When this happens, all the best chess minds in the world, working together as a team and taking a year to make each move, would not be able to beat a computer.

    1. Re:Why "Chess is dead." by houghi · · Score: 0

      In the course of doing so, the computer will throw away information that is excessive and will store new relevant information that it must compute.

      Reminds me of the time when I build a computer'that could play Tick Tack Toe. It existed of matches in matchboxes and you wouls start to play randomly. When the 'computer' lost, you would take away the previous moves, when the computer' did not loose, the moves would stay.

      After a while you had a cheme on what moves to take and what moves not to take.
      I can imagine a computer doing the same. Naturaly it will need a bit more info, but i does not have to hold all moves and positions. Only those that lead to victory. I am wondering if this would lead to the ideal game' where there is only one way to win when played agains itself.

      --
      Don't fight for your country, if your country does not fight for you.
  111. MOD PARENT UP by Anonymous Coward · · Score: 0

    There are not more chess combinations than atoms in the known universe. There are billions of chess combinations. That's blatantly wrong.

  112. In Search of! by magical22 · · Score: 1

    Where is bobby fischer when you need him?

    1. Re:In Search of! by Anonymous Coward · · Score: 0


      Killin' Jews, babay!!!

      Woot!

  113. Indeed by Anonymous Coward · · Score: 0

    The last human World Champion that died in the middle of the match had never lost to a computer. The guys name was Dr. Marion Tinsly, and he used to say: "Chinook was programmed by Jonathan, but I am programmed by God."

  114. Other required reading: "Blondie24" by Tool+Man · · Score: 1

    It's mainly about a checkers program, but not one with huge amounts of human strategy and catalogued moves programmed in. Rather, it's a program which was given the barest mechanics of the game, and was designed to teach itself. The authors of the program weren't expert checkers players, but their creation learned to play well enough to beat most people.

    Lots of what's in there relates to chess as well, but it's an excellent read either way.

  115. Humans are still on top by mark-t · · Score: 2, Interesting
    A computer, before making a single move, is forced to evaluate literally millions of possible board configurations in order to determine which move gives it the statistically strongest position.

    A human player may, in the same amount of time, only actually evaluate a few dozen board possibilities before making a single move, The human player can somehow eliminate even *considering* 99.9% of the possibilities, and even then the human often doesn't fair too badly, especially considering the odds against him.

    Until computers can pull off this sort of "magic"*, no computer can ever be considered a match for a human player. It's no more astounding that a computer can occasionally (or even usually) beat a human at chess by considering more moves than a human player does than it is astounding that a pocket calculate can show you the value of pi to 8 decimal places with a single keystroke. That's not intelligence, just raw computation. Put another way, it's no more suprising than the fact that a heavyweight wrestler of lesser skill would have a good chance at being able to take down a more skilled featherweight.

    * Clarke's law says any sufficiently advanced technology is indistinguishable from magic (and the corallory which says that magic is always indistinguishable from some sufficiently advanced technology).

    1. Re:Humans are still on top by dvdeug · · Score: 2, Interesting

      That's not intelligence, just raw computation.

      What's the difference? Why is the ability to store large amounts of state in mind and do various forms of complex pattern matching intelligence, whereas the ability to look at many positions and calculate their value not?

    2. Re:Humans are still on top by k8to · · Score: 1

      Oh come now. The difference between computation and intelligence is obvious. The open question is whether you can construct one out of the other.

      --
      -josh
    3. Re:Humans are still on top by dvdeug · · Score: 1

      The difference between computation and intelligence is obvious.

      The difference between computation and coming up with a proof of Fermat's last theorem or a paper on 20th century Japan and their reaction to Shakespeare is obvious. The difference between "computation" on a small, limited, rule-bound problem field and "intelligence" on the same field is arbitrary.

    4. Re:Humans are still on top by k8to · · Score: 1

      Possibly difficult to distinguish? Okay.
      Arbitrary? Hardly.

      --
      -josh
    5. Re:Humans are still on top by dvdeug · · Score: 1

      Arbitrary? Hardly.

      Yes, arbitrary, unless you want to define human behavior as intelligence and computer as computation, which begs the question. Arguably, humans use the exact same algorithms computers do, except for humans have excellent pattern matching code and lousy deep search code, and computers are the other way around.

    6. Re:Humans are still on top by k8to · · Score: 1

      That humans use the exact same algorithms as computers do is not an argument, it is empty supposition with pretty much no basis at all.

      --
      -josh
  116. Doesn't help... by Goonie · · Score: 1
    I'm no expert in the area, but as I understand it quantum computers as currently envisiaged are no help. In fact, quantum computers, if one can ever be built, are not useful for terribly much, except cracking public-key encryption and doing quantum physics simulations.

    There are hypotheses that a quantum computer with still greater abilities might be built one day in the distant future. This machine would have the ability to solve "NP-complete" problems quickly. However, even if such a machine was constructed, this wouldn't help either. Chess (or a generalization of chess to an nxn board), is EXPTIME-complete, which means it provably takes exponential time to find the best chess move. So, essentially, we are screwed as far as brute-forcing chess.

    Maybe some clever mathematician will be able to prove some properties about chess that might reduce the search space enough to make a brute force search feasible, but don't hold your breath.

    --

    Any sufficiently advanced technology is indistinguishable from a rigged demo
    --Andy Finkel (J. Klass?)
  117. very interesting thought by Sivaram_Velauthapill · · Score: 1

    I never thought of it that way. Wow. That's an interesting way of looking at the differences. A slow, parallel computation device (i.e. brain) vs fast, linear computation device (i.e. computer). I never looked at it that way but it makes a lot of sense.

    I guess one result of this view is that IF computers can compute in parallel* they will totally destroy the human brain.

    * note: modern day notion of parallelism is very primitive compared to the brain...so the computers aren't really "parallel" yet...

    Sivaram Velauthapillai

    --
    Sivaram Velauthapillai
    Seeking the meaning of life... @slashdot of all places ;)
    1. Re:very interesting thought by bj8rn · · Score: 1
      Computers will "destroy human brain" only if they learn to think and learn by themselves. I mean, completely by themselves, with no human intervention whatsoever. Even if computers can become as parallel as human brain, they still need a human to write their code, etc (I don't think computers will ever reach the level of sophistication where you tell the computer to write a cool FPS, and it will). They will still remain just number-crunchers.

      But that, of course, is only my very uninformed (I don't really know much about computer architecture or neurology) opinion.

      --
      Hell is not other people; it is yourself. - Ludwig Wittgenstein
  118. You recall wrong by hayne · · Score: 1
    I think that what you "recall" is that Kasparov made outrageous claims about the IBM team cheating during the match. Changing the program while a game was in progress would certainly be considered cheating since the programmers could inject expert chess players' judgement on the specific positions of the game. There was zero evidence of anything like this happening.

    Note that changing the program between games is generally not considered cheating unless it is specifically proscribed, as I believe is the case in the current match.

  119. Not to be morbid . . . by tilrman · · Score: 1

    . . . but did Sonas consider his argument when Kasparov and Kramnik go to that great chessboad in the sky? If both were hit by a bus tomorrow, would the world's best chess computers' ratings immediately drop below the former #3 human?

    How about the "data" he collected:

    Includes all events, where each side had at least 20 minutes total for all their moves, where a computer played at least two games against humans with FIDE ratings of 2700 or more. Does not include any games against humans with FIDE ratings below 2700.

    . . . on Tuesday when the ambient temperature was less than 20C during the transit of Venus. As Mark Twain said, "lies, damn lies, and statistics."

    Seems to me that if you're gonna use SSDF and FIDE ratings at all, just plot the curves of humans vs. machines, fit a couple of nice equations, and extrapolate into the future.

  120. Quantum Computers by Myria · · Score: 1

    I think that Sonas is making a critical mistake here. Quantum computers are not far off. We'll probably see them in universities in 40 years. Once quantum computers exist, chess is over. Nothing can beat a quantum chess player, not even itself, for the simple reason that it's mathematically impossible. The question of which is a better chess player will become irrelevant.

    Melissa <3

    --
    "Screw Sun, cross-platform will never work. Let's move on and steal the Java language." - Visual J++ Product Manager
    1. Re:Quantum Computers by Anonymous Coward · · Score: 0

      In theory, in the casino game of Roulette, someone can recoup their losses and win big if they double the wager after each loss. Eventually, they should win once and gain back all the lost money plus gain the same amount. This of course assumes the player either has an unlimited amount of cash or can sustain multiple losses and eventually win before running out of money.

      To counter this, casinos have made other parameters. For example, minimum wager and maximum amount of money the table can give out.

      I wonder when the situation that you described happens (it undoubtably will), if people will come up with different parameters (game rules or other parameters) for the game that will make computing all possibilities etc more difficult for the computer to do and level the field a little bit.

    2. Re:Quantum Computers by Anonymous Coward · · Score: 0

      Wrong. Casinos don't care a bit if you double your bets. Let's put it this way: you've started with a $2 bet on black in roulette and lost 3 times, in a row, doubling your bet each time. You've now lost a total of $14. You now place a $16 bet. First of all, to the casino this is no different from some other guy walking in and placing $16 down. Second of all, you're more likely to lose that $16 than to win, which makes the casino happy. And if you do win? For the risk you took (a 53% chance of being down $30), you stand to win $2.

      This doesn't mean that your final point is wrong, but the casino analogy certainly is.

    3. Re:Quantum Computers by Anonymous Coward · · Score: 0

      I think that the analogy is good. Imagine this. If you are a millionaire, you go to the casino and bet on the roulette. If at some point you are down several thousand dollars, you continue on doubling until you win. Eventually, you do win unless you are so unlucky and lose every single time.

      Casinos prevent people from doing that because they have maximum amounts of cash that you can bet. Say $1000. So you can not go there and always win just because you have a lot of cash.

      Notice how they love it when people take notes and make series. They even provide paper and pen. They know that in the worst case they lose small amounts but when a guy reaches the table limit, he just lost $1000 (plus all other prior losses). He can not continue and win on the $100000 bet and go home happy with his daily earning. Casinos want you to double your bet as much as possible. Until a certain limit.

  121. Making a chess computer (article) by Anonymous Coward · · Score: 0

    There is an interesting article at How Stuff Works that explains how chess programs work: article. Also, here is a link to a related story.

    good night.

  122. Neural Net by Anonymous Coward · · Score: 0

    How about if you built a neural network and trained it vs humans?

  123. Great Chess Website by unity · · Score: 1

    If anybody out there is looking for a great chess website, i recommend www.redhotpawn.com .

    p.s. i don't have any interest in the site except for being a satisfied user.

  124. One thing this does prove... by BrokenHalo · · Score: 1

    Is that Kasparov is a sucker for punishment :-). It takes some guts to not slink away with one's tail between one's legs after a pounding like Deep Blue's.

    1. Re:One thing this does prove... by Anonymous Coward · · Score: 0

      If you understand chess, you would understand that it was certainally not a pounding. IBM did't allow a rematch because they would almost certainally lost (if they kept the exact same hardware).

    2. Re:One thing this does prove... by BrokenHalo · · Score: 1
      you would understand that it was certainally not a pounding.

      I was referring not to his defeat but to the stress of that kind of competition.

  125. Re:Face reality by Anonymous Coward · · Score: 0

    Says who, Doctor?

  126. Re:Face reality by Anonymous Coward · · Score: 0

    Ummm... there is also the reality that women and men think differently. The typical man will have an improved sense of spacial relationships, whereas the typical woman will have stronger language centre skills (for example).

    Chess is very much about being able to envisage the spatial relationships of the board many moves in advance, and as such, it is highly probably that men would on the whole do better at it than women.

    The bigger issue is why activities that are dominated by men (such as football or chess) are considered of greater importance than activities that are dominated by women (bringing up children?)?

    cheers
    Sara
    yes; female, a slashdotter, a geek and a gamer; plus I can play chess and read a map...

  127. Re:Face reality by Anonymous Coward · · Score: 0

    Many great inventions of the past were by women who then let a man release their invention because a woman simply wouldn't be taken seriously and it wouldn't be socially acceptable for them to do so.

    I would prefer open-minded, intelligent realism, and you obviously do not. Is this flexible yet critical? I think it is obvious that your statement is foolish and malevolent. One must consider straightforwardness versus propaganda. Is this open-minded? I think it is obvious that your statement is dangerous and foolish. But there is a flexible yet critical justice, and your argument would reject anything involved with it. Think about the stupidity, malignant and orthodox, and how it compares with honest straightforwardness.

  128. Best Chess Computer by RzUpAnmsCwrds · · Score: 1

    Human makes opening move.
    Computer: Mate in 63. You lose.

  129. This is the stupidest troll ever. by pr0ntab · · Score: 1

    Christ man, you sound like someone TRYING to be stupid. You're just trying to get your signature some visibility, for whatever that gets you.
    So then let me answer your question with another question: How can you be so stupid, yet sound even stupdier?

    --
    Fuck Beta. Fuck Dice
  130. But we humans as a reace have lost by silence535 · · Score: 1

    Well well, maybe our best human is still competing with the best computer, but in general I think if we held a gigantic chess match of all humans playing agains all computers we would clearly lose.

    Now that we know that this war is lost, why don't we stop playing chess at all and start focussing on, ... ehhh lets say ... WALKING.

    Ha ha! You stupid machines! At the soles of my feet. Eat my dust as you see my speed off to the horizon...!

    -jsilence

    --
    Dyslectics of the world, untie!
    1. Re:But we humans as a reace have lost by Anonymous Coward · · Score: 0

      Hopefully english is your second language.

    2. Re:But we humans as a reace have lost by silence535 · · Score: 1

      You foargot to read my .sig

      --
      Dyslectics of the world, untie!
  131. Re:Face reality by Sivaram_Velauthapill · · Score: 1

    ... there is also the reality that women and men think differently. The typical man will have an improved sense of spacial relationships, whereas the typical woman will have stronger language centre skills (for example).

    Yeah that's true to some extent but we don't really know a whole lot about it. For example, what makes one deviate? Also, I am unhappy with the lack of emphasis placed on environment--too much genetics and too little environment...

    Chess is very much about being able to envisage the spatial relationships of the board many moves in advance...

    We don't know about that. I don't think anyone has done a study to indicate that. You may be right but I'm not too confident yet.

    The bigger issue is why activities that are dominated by men (such as football or chess) are considered of greater importance than activities that are dominated by women (bringing up children?)?

    The answer is fairly obvious--is it not? Since nearly all societies are patriarchial, activities by men will be valued more.

    Sara... yes; female, a slashdotter, a geek and a gamer; plus I can play chess and read a map...

    Are you sure you aren't a man? ;)

    Sivaram Velauthapillai

    --
    Sivaram Velauthapillai
    Seeking the meaning of life... @slashdot of all places ;)
  132. well as soon as... by Madcapjack · · Score: 1
    Well as soon as a computer has to walk by itself to the chess table, move the pieces itself, and shake the hand of its opponent, I will start considering chess computers to be a match for us...

    sure computers will get better than us at chess. but we're multi-purpose machines, not chess computers.

  133. Re:Face reality by Henry+V+.009 · · Score: 1

    I believe that raising children is the single most important act in any civilization -- for both men and women. Though women have the primary responsibility. It is a shame that our culture has lost so much of the respect for that act that it once had. I do not think that our children are being raised as well as they should be. And I do not think that women who undertake that task are being accorded the respect they should rightfully have.

    (P.S. You can read a map?!? Well, I can ask for directions. Of course, I choose not to.)

  134. Re:Face reality by Anonymous Coward · · Score: 0

    i play 9-ball competitively. if youre suggesting that the women on tv are the top 9-ball players, youre wrong. a strong amateur male player (such as a local champion) can typically match a top-ranked professional female player.

    whether this is due to a larger population of male players or some innate difference is open for debate. however theres a definite difference in shot selection between the male and female pros.

    in any case, the women are on tv more because they look better on tv and they have a single well-managed players association (unlike the men).

  135. What about playing _Go_ with God? by RedCard · · Score: 1

    On a related note, here's a short story that appeared on Kuro5hin about paying an infinite game of Go with a horribly wounded angel.

    Deals with the concept of NP-hard problems, too!

  136. Consider Phlebas by slb · · Score: 1

    Jeff Sonas assertion remind me of Iain Banks "Culture" series where most of the universe is ruled by the Minds (some kind of omniscient AIs).

    He says that surprisingly even the Minds can't beat the best humans (OK the best amongst trillions) in specific areas.

    Incidently I believe the computational approach of computers would never beat very intuitive players like Bobby Fisher.

    --
    http://www.transparency.org
    1. Re:Consider Phlebas by Manic+Ken · · Score: 1

      Bobby Fisher? Well, I bet my gnuchess would beat him ;)

      Seriously, I am sad to see that he has been...eh...offline so to speak(mentally)...

      I read some transcripts of radio interviews and I feel he need some friends to get him straighten up.

      He has some 'issues' and interprets things in a bizarre way. I dont know, but he seemed to be an intelligent young guy, then something went wrong...what?? I know that we all make choices, but here I feel that something pushed him...I dunno...

  137. You're confusing power with energy by Performer+Guy · · Score: 1

    There you go getting on your thermodynamic high horse but screw up big time when you confuse energy requirements with some sort of cataclysmic power surge. Very silly, you're a big numbers guy with no patience.

    w.r.t. solving chess, there are such things as tree pruning and of course not all states have to be stored, they are merely searched. Then of course there's the prospect of additional mathematical optimizations.

    1. Re:You're confusing power with energy by rjh · · Score: 1

      but screw up big time when you confuse energy requirements with some sort of cataclysmic power surge.

      It's not a power argument; it's purely an energy argument. That much energy in our cosmos would lead to utter catastrophe, which shouldn't be surprising given that it's orders of magnitude greater than the total energy content of the universe. I literally cannot imagine the scope of the damage, and I'm generally pretty good at imagining spacetime deformations.

      w.r.t. solving chess, there are such things as tree pruning and of course not all states have to be stored, they are merely searched.

      Ah, I see. So we get around the storage requirements by dynamically generating our states as we search through them... which will lead to us regenerating states over and over again, thus increasing the energy requirements over that of the naieve method. Sorry; this doesn't work, either.

      Re: tree pruning, that's not what the original poster was talking about. The OP was talking about fully mapping the chess space, which is simply not going to happen.

    2. Re:You're confusing power with energy by Performer+Guy · · Score: 1

      Tree pruning is exactly how efficient ply searching works. w.r.t. analysing the chess tree, you don't regenerate states that much searching a tree, you can store your current position and explore all moves. Remember you're evaluating the best move at this ply for the whole tree, not store the best move are every position at every ply. So to play a game, you do your exhaustive search for this move only. From then on you repeat for each position, but after your first move you have a small fraction of the work (taking the brute force approach). The actual cost of the lack of storage is trivial by comparrison to the initial cost. The lack of storage is NOT a problem, although storage can improve performance.

      w.r.t. setting bits in memory, it's a specious argument, the power requirements are much greater w.r.t. computation, setting memory bits for board positions are not the greatest power issue, there are hundreds of thousands of gate switches in a processor executing code. I know what your trying to say, (theoretical limits) but reality is much worse.

      However I'm not buying your argument about using energy leading to a cataglysm that "propagates at the speed of light" There's no basis for that nonsense. Once again, this is a use of energy over time (and it's not an exhaustive search although it is thorough). Worst case you run out of energy in your corner of the universe and everything goes dark, you move your "Dysan chess sphere" TM over to the next star / black hole and resume the program :-), but then again that makes certain assumptions about the nature of the universe and the nature of the problem I think the problem is more tractible than your strawman suggests.

      It is a search, that can be optimised, I insist :-)

      Maybe it'll be easier to build a computer that's smart enough to come up with a chess proof without searching the move tree exhaustively.

    3. Re:You're confusing power with energy by Performer+Guy · · Score: 1

      P.S. when I say "play a game" I mean "play a perfect game".

  138. cellular automata by pyrrho · · Score: 1

    are merely programs that are arranged in a spacial grid such that they have neighbors.

    The behavior of the program is limited the state of it's neighbors. Often these things are arranged in a grid of pixels, for example, and a cell might have the rule of being on if exactly half it's neighbors are on, and off otherwise. Or any rule you might think. They exhibit very interesting behavior.

    Steven Wolfram, a young brilliant physicist and cosmologist that dropped out of science in the mid eightees, had made discoveries back then about interesting characteristics of cellular automata. He dropped out and continued his study, making a living selling the software he made for his own research needs, Mathematica. It's kind of a good geek legend like one on old.

    Just last year he came out with the results of his work in "A New Kind of Science" which studies the patterns created by cellular phenomenon, and which includes admission that Worfram really believes the whole world comes down to cellular automata.

    The idea that this theory would mean a computer could simulate people comes from the fact that cellular automata are easily simulated on a computer. Of course, that doesn't mean the computer could beat the human, it's running a simulation, one layer removed, it's like a VM, implimenting the machine all over again (as cellula automata) and then using it.

    --

    -pyrrho

    1. Re:cellular automata by Anonymous Coward · · Score: 0

      He dropped out and continued his study, making a living selling the software he made for his own research needs, Mathematica.

      There are quite a few people whose code and research was "appropriated" into Mathematica that are very tired of the Wolfram worship. Wolfram profits from their work, and they even have to purchase their own work from Wolfram. Symbolic computation was an open research field where mathematicians and computer scientists shared their work. Wolfram did not write Mathematica. Wolfram assembled Mathematica from the work of others and locked others from using his contributions.

      So while you may be correct that he "made" Mathematica, your choice of words implies that he did dignificantly more than extend the work of others. His "New Science" book is also stuffed with unattributed appropriated "discoveries".

      Wolfram is a leech and deserves all the respect granted any other parasite.

  139. What is non-deterministic by Nightlight3 · · Score: 1
    Tell me what you mean by the world being non-deterministic.

    It means that if a system is in the state S1 at the moment t1, then at a later time t2 it can be in multiple states S2,S2',S2",... i.e. the state evolution function is a multi-valued function (like square root of 4, which is +2 or -2).

  140. but by pyrrho · · Score: 1

    what if our minds are quantum computers, then normal computers would never be able to match them, in all liklihood. There are a lot of unknown possibilities like that.

    --

    -pyrrho

  141. Counting by pommiekiwifruit · · Score: 1

    Some of us can count to 1023 just using our fingers.

  142. I for one... by kerb · · Score: 0, Flamebait

    ...warmfully welcome our computer chess overlords

  143. My computer can beat me at chess.... by Anonymous Coward · · Score: 0

    however it is no match against me when it comes to kickboxing.

  144. The human frame can not survive 30mph by nagora · · Score: 1

    And other stupid sayings.

    The idea that ever-increasing brute force can be held off by an almost flat line of inspiration is just a joke. But the result (that computers will be able to beat any human) will be no more vaild than entering a 1500cc Harley-Davidson in the olympic marathon: so the machine wins, big whoop!

    TWW

    --
    "Encyclopedia" is to "Wikipedia" what "Library" is to "Some people at a bus stop"
  145. Computers won't surpass humans by Rogerborg · · Score: 2, Insightful

    And neither will they ever need more than 640K of RAM.

    The problem with using empirical evidence is that it's dealing with then. This is now. In the future we will have quantum computers with enough storage space to calculate (or just lookup) a winning path from any possible position.

    Computers will inevitably surpass meat brains. The real question is: when, and what sort of computer?

    --
    If you were blocking sigs, you wouldn't have to read this.
  146. Play some Go by sanosuke001 · · Score: 0

    why don't they give up on making chess programs and work on something important like a progam that can beat an amateur Go player? (www.usgo.com)

    --
    -SaNo
  147. To put it bluntly... by greppling · · Score: 1
    ...this article has no worthwile content.

    He starts by comparing the SSDF computer ratings with the FIDE Elo rating, and claims that they would lead to the conclusion that computers will surpass humans in a couple of months. This is non-sense. Nobody has ever claimed that. The SSDF ratings always come with the disclaimer that they are only based on computer vs computer games, so that the ratings cannot be compared to human ratings.

    Then he refutes this claim that noone has ever made by citing the results of human-vs-computer matches in the last 15 years. We see draws in the last 5 years against opponents that had gradually increasing ratings, who probably were taking the matches increasingly more seriously. And that altogether had 49 games. Sorry, I can hardly believe that Sonas is a statistician if he is deriving his claim from such a small sample.

    All we can say is that these matches in the last 5 years do not show that computers will be clearly better than humans in a few years. But they do nothing to destroy the very strong evidence to the contrary, either. Evidence gathered in 30 years of computer chess development, e.g. showing that a doubling in computing power leads to about 60 points ELO rating increase.

  148. Re:Face reality by Sivaram_Velauthapill · · Score: 1

    Raising children IS the most important thing. However, due to capitalism (and other elitist systems), you end up undervaluing the luxurious and non-essential stuff. For example, ever notice how farming is one of the worst sectors to be in (low profits, etc), whereas non-essential sectors like manufacturing do far better. One can hardly claim that food is not important but one is willing to spend more on non-essential things...a severe human flaw in the modern world...

    Sivaram Velauthapillai

    --
    Sivaram Velauthapillai
    Seeking the meaning of life... @slashdot of all places ;)
  149. Re:Face reality by stanmann · · Score: 1

    You of course realize that the top few hundred professional cooks are also all male...

    Some women are good at it, but at the peak professional level the men are the ones making the big bucks... Maitre chef de cuisine.

    --
    Food not Bombs is a nice platitude but it breaks down when you notice that the Bombees are usually well fed
  150. Chess was symbolic, anyways by Anonymous Coward · · Score: 0

    Well, that's just it. At this stage, the worry is more fluff than substance, though. Chess is a very specific problem domain: it's taken an enormous amount of effort to build computers that are capable of playing a superior game against superior players.

    Chess is considered to be a particularly cerebral pursuit, so the symbolism of machines victorious over man is particularly poignent. A computer who beats superior human players has either proved that pursuit is less cereberal than it seems, or chess is a rigorously definable problem domain like so many others.

    Now, build me a computer that can think -- and we'll have something.

  151. Re:Face reality by NDPTAL85 · · Score: 1

    Farming is a bad sector to work in because of oversupply, over capacity and hyper productivity. Today the US only has about 3% of its population in agriculture. Why would a profession that needs so few people yet still requires such hard backbreaking work be desireable?

    --
    Mac OS X and Windows XP working side by side to fight back the night.
  152. chess computer? by Corporal+Tunnel · · Score: 1

    I have trouble beating my TI-89 calculator at chess!

  153. Chess is dead, long live chess by ARWK · · Score: 1

    Against most of us 'normal' chess players computers have been able to beat us each and every time now for many years. This has certainly not diminished the game in anyway but rather given the oppertunity to have interesting games (usually only if the skill level is turned down!) in the absence of a human opponent.

    Even 'chess genius' on my PDA can beat me most times, a far cry from my childhood when a chess computer was large and bulky and could be beaten each and every time, such as by making an obvious move of sacking a piece for positioal advantage.

  154. Who is winning by figa · · Score: 1

    I can tell you one thing, around my house Fritz is definitely winning. I ceded in the man vs machine battle a long time ago.

  155. Don't quit your civil engineering job by digitaltraveller · · Score: 1

    We just gave up the idea that we can beat them as Kasparov lost to a computer and that is engough to prove that computers have surpassed humands.
    Your misinformed. The best Deep Fritz could recently score against Kramnik was a 4-4 tie, with Kramnik winning the second and third games before falling behind in later games probably due to fatigue.

    Beating a computer is easy. I do it myself sometimes. The hard part is beating a computer on a specific date, at a certain time under tournament conditions with the world watching - and Kramnik proved it against a 8 way Xeon machine searching around 2 million nodes (moves) a second. Can Kramnik calculate more or even close to this? Hardly.

    The point isn't that Deep Blue's search depth is around 100 million nodes/second and that Kramnik's match was somehow inferior. The point is that proper anti-computer chess strategy evaporates a computer's tactical advantage gained through brute-forcing the position if a reasonable level of discipline is maintained once peices start coming off the table. This is why you frequently see computers in middlegame positions wildly swing their game assessment from (+4.66 to -14.66) as a new search depth is reached in a position an intermediate chess player wouldn't play into. Yes, chess is a finite problem space but that space is enormous, approximately 10^150 legal positions and that's more positions then atoms thought to exist in the known universe. The fact is with the exception of breakthrough in quantum computing and assuming Moore's law holds, the heat death of the sun would come before a chess computer could even calculate 0.000000000000001% of that space.

    So computers are great for short-term tactical finesses that are easily calculated but are useless middlegame players. They are also useless opening players, but they get the advantage of having the opening book.

    1. Re:Don't quit your civil engineering job by civilengineer · · Score: 1

      Your misinformed.
      Do you really think so?

      Beating a computer is easy. I do it myself sometimes.
      if you are an IM or a GM, yes you might beat some good programs, but otherwise, even ARASAN will beat you if you play a fair game and give the computer the same amount of time to think as you do.

      Yes, chess is a finite problem space but that space is enormous, approximately 10^150 legal positions and that's more positions then atoms thought to exist in the known universe.
      Not all legal positions will need to be evaluated. Legal positions could be as ridiculous as having eight queens for one side and none for the opponent. You don't have to calculate all these positions till checkmate to beat a GM. All you need to calculate is how to convert a small advantage from the end of opening lines to a +- or -+ position. That's it. The rest is a formality. This whole argument about the total number of possibilities being so great is nice for theoretical amusement, but in reality, it proves nothing.
      All in all, I am not ashamed as a human being to lose to a computer and so I am more willing to accept the fact that they have surpassed us. I do not expect everyone to be like me, and they might not be ready as yet to accept the facts.

      --

      New year Resolution: Don't change sig this year
  156. Re:Computers won't surpass humans (HUH?) by smitty45 · · Score: 1

    so are you arguing that you can't expect results of empirical evidence to support what will happen in the future ???!!

  157. It's not that big a deal by BlackjackGuy · · Score: 1

    Just use PKZIP.

  158. The real question: Engineers vs Chess Players by teko_teko · · Score: 1

    I think the real question/statement is not "Man Vs Machine In Chess", but "Engineers vs Chess Players", by Engineers i meant coders, chess analysts, and everybody else that has significant role in the process of creating the AI.

  159. Re:Computers won't surpass humans (HUH?) by Rogerborg · · Score: 1

    >so are you arguing that you can't expect results of empirical evidence to support what will happen in the future

    I'm arguing that you can't always use empirical evidence to predict the future. You can use it, for example, to predict the asymptotic performance points for human athletes, because we are limited by design. You can't use it (as the author does) to say that computers will never become clearly superior to humans at chess.

    Think of it this way. If someone back in 1955 had used empirical evidence taken from valve based computers to show that computers would never be able to draw ten thousand textured triangles 30 times a second on a 1280x1024 LCD screen, they would have been completely reasonable and credible... and totally wrong.

    In this case, if you want to argue that silicon CISC/RISC based computers will never be clearly superior to human chess masters, well, we can argue that, but it's a different argument. At some point in the future, I expect "calculate all possible configurations for a chess board" will be a standard feature in benchmarking tests for quantum computers.

    --
    If you were blocking sigs, you wouldn't have to read this.
  160. Re:Man v. machine? MACHINE. by Anonymous Coward · · Score: 0

    "For now, the claims that PC programs like Fritz are as strong as DB2 was are mostly marketing hype."

    This sentence is not true. Mircos are currently superiour to Deep Blue based on analysis of the few games Deep Blue played. There is no other evidence to go on then these games (the positions per second is irrelevant).

  161. White not necessarily better by grosh · · Score: 1

    I wouldn't always bet on intuition. In Connect Four, the player who goes second can force a win every time.

    1. Re:White not necessarily better by Anonymous Coward · · Score: 0

      Actually connect 4 is a win for the first player. See http://www.ce.unipr.it/~gbe/velena.html

  162. Yawn. by TheLink · · Score: 2, Informative

    Uh. Not worth a read, a waste of time. Summary: author says God cannot be omnipotent and infallible if humans have free will- coz if God knows what we will do, we don't have free will, and since we have free will (author doesn't prove that convincingly either) God is fallible etc etc. The author also follows with some insulting remarks too.

    Philosophers and other people have done arguments like that or better, far more efficiently and elegantly - e.g. "can God create a rock he cannot lift" and so on. Some have managed to do so without the trolling and insults too.

    The universe is more than what we understand so far, and this guy thinks it's so simple?

    Explain this (and I mean thoroughly):
    http://www.wikipedia.org/wiki/Double -slit_experime nt

    And also explain the first observation every scientist makes - self awareness.

    What if God lends/puts a bit of himself to/into each human?

    Or arranges it so that if you, a glimmer of light, choose accordingly, you end up with constructive interference - light. But if you choose otherwise, you end up in destructive interference and darkness.

    It's probably not quite as simple as that either but I'm willing to bet the universe isn't as narrow as those popular philosophical arguments seem to assume.

    If it were that simple, why is there a "you" or "I"?

    --
  163. I'll keep these charges in mind.... by pyrrho · · Score: 1

    ... when I'm at the next Wolfram Church meeting... :) seriously, I have read A New Kind of Science and fell in love with cellular automata back in the 80's as I fell in love with other recursive and feedback related phenomenon. But I havn't followed Wolfram closely, so I only know the hype.

    Tell me, what about him being a genius. Is he?

    (It's possible to be a genuis and also steal the work of others... basically if not all the good stuff is stolen) Wouldn't make him less of an ass if what you say is true, but I'm curious if you also would debunk his repuatation as something of a uniquely brilliant (if eccentric) mind.

    ???

    --

    -pyrrho

  164. Re:Face reality by Anonymous Coward · · Score: 0

    in any case, the women are on tv more because they look better on tv and they have a single well-managed players association (unlike the men).

    They're just more fun to watch, and I don't think the fact that they 'look better on TV' has anything to do with it. For some reason, the women's personalities make watching much more enjoyable than watching the men. Don't ask me why... it's just my observation and does not carry over to other sports, like golf, etc.

  165. Man vs. Machine; man is not a match by TheStich · · Score: 1

    As has already been pointed out, there was quite a difference between the hardware these computer programs were running on, as Jeff Sonas doesn't really consider in his article. As far as I recall reading, the Deep Blue that beat Kasparov, was actually running on an algorithm 100 times faster than the one Fritz, which drew Kasparov in a match earlier this year, were using. I'm PRETTY convinced, that if you put one of todays best programs (there has been a huge development in the actual strength of the programs since Deep Blue) on a killer machine like IBM did back then (just one that at least equals the one Deep Blue was running on), any human being would be completely outclassed in a match...

  166. Capitalism is anti-elitist by Anonymous Coward · · Score: 0

    "due to capitalism (and other elitist systems)"

    Capitalism is anti-elitist, especially compared to to socialism which grants almost divine powers to elites.

    "you end up undervaluing the luxurious and non-essential stuff"

    No, under a system of freedom, peoeple are able to evaluate things for their real value.

    "end up undervaluing the luxurious and non-essential stuff. "

    Is that why socialist regimes like to execute farmers by the tens of millions in engineered famines?

    1. Re:Capitalism is anti-elitist by Sivaram_Velauthapill · · Score: 1

      Capitalism is anti-elitist, especially compared to to socialism which grants almost divine powers to elites.

      I guess you mean stalinism when you say socialism. If yes, then I agree. In fact, stalinism is one of the most elitist systems (it's very close to pure totalitarianism). However, it still doesn't deflect the blame with capitalism. Capitalism, regardless of how you look at it, is inherently elitist. A system that allows a select few to hoard wealth (and consequently power) is elitst!

      No, under a system of freedom, peoeple are able to evaluate things for their real value.

      Elitism has nothing to do with the notion of "freedom". You could be quite free yet be living in an elitist system. For instance, you may have the right to start a business, sell/buy whatever, but monopolies and oligopolies could rule every aspect of your life. You would be very "free" but it will still be elitist.

      Is that why socialist regimes like to execute farmers by the tens of millions in engineered famines?

      Stalinist regimes do that because they are totalitarian. It is done in order to destroy the dissenting voices. Killing people is the quickest way to eliminate people that challenge your power. Totalitarians do that all the time...

      Sivaram Velauthapillai

      --
      Sivaram Velauthapillai
      Seeking the meaning of life... @slashdot of all places ;)
    2. Re:Capitalism is anti-elitist by Anonymous Coward · · Score: 0

      " guess you mean stalinism when you say socialism"

      Strong socialism is the same as Leninism/Stalinism (remember there was no difference between Lenin and Stalin).

      "Capitalism, regardless of how you look at it, is inherently elitist

      No, capitalism is inherently anti-elitist, since it allows the people involved to make the decisions instead of having elites make decisions for them.

      "A system that allows a select few to hoard wealth (and consequently power) is elitst!"

      Actually, under capitalism, anyone can hoard their own wealth according to how hard they work for it.

      Stalinist regimes do that because they are totalitarian. It is done in order to destroy the dissenting voices. Killing people is the quickest way to eliminate people that challenge your power. Totalitarians do that all the time.

      The most socialist countries do this all the time.

      "For instance, you may have the right to start a business, sell/buy whatever, but monopolies and oligopolies could rule every aspect of your life. You would be very "free" but it will still be elitist."

      Then isn't a socialist system the most elitist, as the elites have 100% monopoly on every business (imagine Microsoft Windows....and Microsoft Car, Microsoft Corn, Microsoft Sofa, Microsoft Real State.... and all others are outlawed).

  167. SETI@Home vs. Kasparov? by Comatose51 · · Score: 1

    Now that SETI has decided to allow out-projects, I would like to see a chess program based on that. I want to see the highest chess rating known to man! :-D

    --
    EvilCON - Made Famous by /.
  168. Why do organic gates have to hate silicon ones? by stylinsty · · Score: 1

    The only way to prove computers will never do what people do is to show that our minds are products of actions which can only exist a human structure.

    Since chess playing is done only by systems with wires and states between the wires I just don't see where anyone can ever say there will never be another (circuit) similiar or as functional as humans.

    It is so obvious we are wired together.
    Any doubt about an objects ability to make choices that is not human is sheer ignorance of the last 500 years of scientific research.

    Our evolving algorithms coupled with our computers hardward advancement will surpass human intelligence in extreme magnitudes.

    Most anti-A.I. voices are fueled by fear of something stronger and smarter than them and ignited from lack of study in the field.

    "We already have deceptive error prone computers- they are called humans"

    My AI philosophies:
    http://www.handheldwarez.com/z/inde x.php?category= AI%20Philosophy

  169. Re:Face reality by Sivaram_Velauthapill · · Score: 1

    I wrote up a long message yesteday but ran into the 25-post limit :( I'll keep it brief. You dont' address any of my points. I'm talking about the VALUE of an activity or good. I'm not saying that people should all work in farming or that the US population should be more involved in it. All I'm saying is that when a necessity, like food, is valued so little compared to luxury goods, it questions the value system of society. Of course a capitalist will claim the nature of scarcity and revert ot arguments that you put forth (oversupply, etc). But, capitalism itself claims that oversupply shouldn't exist.

    BTW, there was a typo in my original post. I think the word 'not' is missing...

    Sivaram Velauthapillai

    --
    Sivaram Velauthapillai
    Seeking the meaning of life... @slashdot of all places ;)
  170. Is Chess the best game that we can play? by Anonymous Coward · · Score: 0
    Is Chess really the best game that we can play using a standard Chess set. The inventor of this new game called Arimaa says his game is 1000x more difficult for computers than Chess while still using just a standard Chess set. Not only that but he says the game is easy for people (even non-chess players) to learn and master. He is putting up a tidy sum for anyone who can write a program to defeat the best human player at Arimaa.

    http://www.arimaa.com/

  171. Values = people decide not elites by Anonymous Coward · · Score: 0

    "I'm saying is that when a necessity, like food, is valued so little compared to luxury goods, it questions the value system of society. "

    This also shows how capitalism is anti-elite. In capitalism, the people decide the value of something. That is how it should be. In socialism, you have "values" made up arbitrarily by elites and then forced on everyone who has to put up or shut up.

    Your food example only shows you are out of touch with the real value of the item in question.