Slashdot Mirror


Chess - 2070 CPUs vs 1 GM

jvarsoke writes "ChessBrain.net broke the world's record for 'largest number of distributed computers used to play a single game' by holding a chess match between Danish GM Peter Heine Nielsen and the equivalent of SETI@home (which similarly, has some people looking for a Mate). 2070 CPU's from 56 countries aided Black by running the chess program Beowulf, including a couple of University clusters. Their supernode ran Linux, and MySQL. The game was relayed by FICS. Results can be viewed here(1) and here(2)."

57 of 248 comments (clear)

  1. I'd love to see a Beowolf cluster of those by odeee · · Score: 4, Funny

    I'd love to see a Beowolf cluster of those... Oh damn... it is =:-)

    1. Re:I'd love to see a Beowolf cluster of those by brad-d · · Score: 5, Funny

      Oh yeah, that'd be right.

      Finally I thought I could get a 5+ funny and here you go and steal my joke. I mean, what are the chances of somebody else thinking of this exact same joke on Slashdot? 1 in 3?

      --
      -Brad
    2. Re:I'd love to see a Beowolf cluster of those by frobisch · · Score: 2, Funny

      Finally I thought I could get a 5+ funny and here you go ...
      no go in chess topic please

  2. For those too lazy to read the article... by Gogl · · Score: 4, Informative
    Or in case it gets Slashdotted or something, I may as well note who actually won the game (although I do think that is something that should have been noted in the submission itself but oh well).

    Our World Record attempt is now complete. We had serious technical difficulties early in the game, but managed to resolve them! The result of the game was a draw.
  3. Well that's great.... by filtur · · Score: 4, Funny

    Sure Chess it great, but can it find me a date?

    1. Re:Well that's great.... by arvindn · · Score: 2, Funny
      Sure Chess it great, but can it find me a date?

      No, but you can find a mate.

  4. Here is mirror of the game :) by doomy · · Score: 5, Informative

    Nielsen,P - ChessBrain [E94]
    Guinness record attempt, 30.01.2004
    1.d4 g6 2.c4 Bg7 3.e4 d6 4.Nc3 Nf6 5.Nf3 0-0 6.Be2 e5 7.0-0 a5 8.Re1 exd4 9.Nxd4 Bd7 10.Bg5 Nc6 11.Nxc6 Bxc6 12.f3 Qd7 13.Qd2 Rfe8 14.Rac1 h5 15.Kh1 Nh7 16.Bh6 Bxh6 17.Qxh6 Re5 18.Nd5 Rae8 19.Qd2 b6 20.Bd3 Qd8 21.Rf1 Nf6 22.b3 Bb7 23.Qc2 Nd7 24.f4 R5e6 25.e5 c6

    --
    ...free your source and the rest would follow...
    1. Re:Here is mirror of the game :) by wan-fu · · Score: 5, Informative

      You're missing the remainder of the game:

      26.f5 gxf5 27.Bxf5 cxd5 28.Bxe6 Rxe6 29.Rxf7 Kxf7 30.Qh7+ Ke8 31.Qxh5+ Ke7 32.Qg5+ Ke8 33.Qh5+ Ke7 34.Qh7+ 1/2-1/2.

  5. What's the point? by syrion · · Score: 3, Interesting

    The problem with this is that it seems to assume that chess is a difficult problem. It isn't. Modern chess algorithms are really simple search-and- prune systems, relying on the computer's immense number-crunching ability to overcome the more heuristic human mind. Unfortunately, this isn't very interesting. What's the point? We know that computers can search faster than a human. See: Google. All these projects (DeepBlue, Fritz, this) accomplish is trivializing the game of chess, which is rather sad. Now, I'll be really annoyed when Go programs start improving to a 'decent amateur' level...

    1. Re:What's the point? by suchire · · Score: 2, Interesting
      Mostly, yes, I'd have to agree with you, but there are also complicated mechanisms for searching. Designing a good algorithm isn't a simple matter. There are all sorts of problems that come with the basic minimax tree with alpha-beta pruning (the horizon effect being the most obvious of them all). If you think about it, there are actually quite a few different algorithms for chess game-tree searching, negascout and mtd(f) being the most popular. If you really want to see how "simple" chess programs are, try looking at the source to crafty, which is an open source chess program, and consider how it handles all of the different concepts (color domination, open files, king protection, pawn structure, and so on). To beat the top players, a simple minimax tree is not enough.

      And these days, people don't really investigate chess as a problem to "solve" (since, it really can't be solved per se). What people should do is use chess as an environment to test various things out (such as neural networks and distributed computing), since it is easy to evaluate efficiency (just have it play a "normal" computer a hundred times or so).

      --
      Such irE
    2. Re:What's the point? by vidarh · · Score: 4, Insightful
      Any turn based board game are "really simple search-and-prune" systems. The problem is how to minimize the time taken by the search, and how to decide what a to prune, and how to decide which move to take.

      Brute forcing a chess game tree based on basic alpha beta minimax for instance is no way to play well against an experienced human player - first of all you won't get many moves ahead, and a good player that know how the computer work can easily set up a trap that will make the board look good X moves ahead, to make the computer to do stupid moves they can't easily reverse later.

      Second you face the problem of definining and weighting what a "good position" is. What is a good position depends on the strategy of the opponent.

      Most modern chess programs will augment the basic search and prune with a lot of heuristics to guide the search and weighting of choices, exactly for that reason. They also often contain massive databases of games, sequences of moves etc., to hunt for known strategies that humans might try to recycle against it.

      Chess isn't "simple". Chess is a game where it's easy to beat beginners, possible to beat intermediate players on modest hardware, and possible to face grand masters if you have lots of time and access to millions of dollars worth of hardware, and you can still expect to be surprised every now and again.

      It makes it interesting, because you have a good foundation to research algorithm improvements on, and because a good algorithm will be more and more useful as hardware costs come down, but it certainly doesn't invalidate the need for better algorithms.

      It's also interesting because better algorithms might help us appreciate how humans approach the problem, and as such benefit AI research.

  6. Bullshit... by Transient0 · · Score: 5, Informative

    It is very rare that a common opener played at the GM level results in a discrepancy greater than about a quarter of a pawn. And it takes a great strategic thinker to understand the advantages and disadvantages of all the available branches in the opening against different types of players.

    Of course, it should be obvious that your line of reasoning is totally bogus. The totality of possible moves in chess is simply incomputable and somehow magically trimming this tree to "good" moves still leaves a fundamentally unmemorizable realm of possibilities even at only ten moves depth.

    1. Re:Bullshit... by DAldredge · · Score: 5, Informative

      10^120 is the number of possible chess moves. From a google link.

      " If you were to fully develop the entire tree for all possible chess moves, the total number of board positions is about 1,000,000,000,000,000,000,000,000,
      000,000,000,00 0,000,000,000,000,000,000,000,000,00 0,000,
      000,000,000,000,000,000,000,000,000,000,00 0,000,00 0,000,
      000,000,000,000, or 10120, give or take a few. That's a very big number. For example, there have only been 1026 nanoseconds since the Big Bang. There are thought to be only 1075 atoms in the entire universe. When you consider that the Milky Way galaxy contains billions of suns, and there are billions of galaxies, you can see that that's a whole lot of atoms. That number is dwarfed by the number of possible chess moves. Chess is a pretty intricate game!"

    2. Re:Bullshit... by ObviousGuy · · Score: 3, Funny

      For example, there have only been 1026 nanoseconds since the Big Bang. There are thought to be only 1075 atoms in the entire universe.

      The universe must be much smaller than I am prepared to comprehend.

      --
      I have been pwned because my /. password was too easy to guess.
    3. Re:Bullshit... by wan-fu · · Score: 2, Interesting

      While this is true and I definitely agree with your sentiments, it should be noted that players at the GM level spend a considerable amount of time in preparation for their specific opponents. They spend countless hours analyzing the games of the person that they will be playing tomorrow. In this sense, a computer will and already is better facilitated to analyzing styles/methods/openings/etc. to play against a human than any human being is capable of. A computer could easily go through every game someone has ever played and at least know which opening(s) to present and which variations based on statistics. While a human might have some intuition, the computer should have a more comprehensive view of this.

    4. Re:Bullshit... by ag0ny · · Score: 2, Funny

      There are thought to be only 1075 atoms in the entire universe.

      They must be very big.

    5. Re:Bullshit... by troon · · Score: 3, Informative

      For example, there have only been 1026 nanoseconds since the Big Bang. There are thought to be only 1075 atoms in the entire universe.

      Mental note: <sup> doesn't work on /.

      --
      Ydco co ,df C erb-y go. a Ekrpat t.fxrapev
    6. Re:Bullshit... by product+byproduct · · Score: 5, Informative
      Watch your terminology:
      • The number of chess moves is at most 218.
      • The number of chess positions is estimated to be between 10^43 and 10^50.
      • The number of chess games is infinite, as the 50-move rule and the draw by repetition of position don't apply if no player makes the claim.
      • The game tree complexity is about 10^123. That's the number of chess games you may have to consider to play perfect chess.
      Source: http://en2.wikipedia.org/wiki/Chess
    7. Re:Bullshit... by Rolo+Tomasi · · Score: 2, Funny
      They spend countless hours analyzing the games of the person that they will be playing tomorrow.

      Yeah, if "countless" is by your definition "less than 24".

      --
      Did you know you can fertilize your lawn with used motor oil?
    8. Re:Bullshit... by kirinyaga · · Score: 2

      by the way, note this is in no way a privilege of chess. Such a huge number of positions and games is a characteristics of many games, not only chess.
      Its old age and its popularity since a long time ago make it special, not its complexity. In fact, a lot of games are even more complex.
      Even if you consider only the elders, and not the modern boardgames. While chess is just enough complex for computers being able to start challenging chess GMs, you won't see anytime soon a computer challenges a regular player of Go for example.

      --
      Kirinyaga
  7. Re:Understanding vs. Processing by njan · · Score: 5, Interesting

    The theorists would disagree with you; computers are extremely good at assessing a *large* number of potential outcomes. Humans, however, are much better at pattern recognition and whilst they can only consciously assess a dozen or two moves, they have most of the work done for them by the functionality in the human brain which causes them to recognise patterns and possibilities far more efficiently than any computer we have now (or will in the forseeable future) will.

    Computers can certainly give GM chess players a run for their money - no-one's disputing this; but ultimately, barring a total change of direction in programming/processor/logic/chess theory, they're still just applying what basically boils down to a probability-based brute force method to chess-playing - the human method is far more elegant.

    --
    I am a viral sig. Please copy me and help me spread. Thank you
  8. May I suggest... by kamapuaa · · Score: 4, Funny
    which similarly, has some people looking for a Mate

    May I suggest, that neither the SETI@Home, nor Chessbrain.net, is the best place where one can find a Mate.

    --
    Slashdot: providing anti-social weirdos a soapbox, since 1997.
  9. Draw game against 2070 CPUs? by vchoy · · Score: 4, Interesting

    To give credit to Danish GM Peter Heine Nielsen, I would have to say if there were only 2069 CPUs then he might of just won... :P (J/KING)

    More interestingly, would the ChessBrain.net team would of won with more CPUs?

    1. Re:Draw game against 2070 CPUs? by Migrant+Programmer · · Score: 3, Insightful

      "might of"

      "would of"


      Make the hurting stop!

      The sad part is you correctly said "would have" earlier in the post.

      Yeah yeah, evolving language. Some adaptations should be thrown in the chlorinated pool!

      I'm not usually a grammar nazi. But hey, chess is neat. Those fancy chess playing computers are going to take over the world some day, yessirree!

    2. Re:Draw game against 2070 CPUs? by ezzewezza · · Score: 2, Informative

      of course he wrote "would have" earlier in the post... he wouldn't form a contraction there: "I would've to say." It's less a matter of evolving language and more a matter of improper orthography...

  10. Re:Understanding vs. Processing by vontrotsky · · Score: 5, Insightful

    We're getting closer and closer to the days when humans won't be able to compete with computer's at chess. Even so I don't think this is such a big deal. We haven't be able to compete with computers at arithmetic for half a century and this doesn't bother anyone.

    Losing to computers in chess will be like losing to calculators in a addition match. People and computers aren't really in competition. They do very different things.

  11. Results by Stalyx · · Score: 5, Insightful
    "The game lasted several hours before resulting in a draw. Chess Grandmaster Peter Nielsen commented that he had set several traps for ChessBrain which computers normally fall for... but was surprised that ChessBrain refused them! "

    So what does this tell us? Nothing really, however it would be interesting how the computer will perform in a 5 match series.

    Although I still think the GM would win handily.

    1. Re:Results by azaris · · Score: 3, Insightful

      Why do you believe that over a 5 match series the GrandMaster will win handily?

      If you look at the position at move 26, it's obvious ChessBrain is being pressured. In fact the article gives a possible move that could have resulted in ChessBrain losing. Instead Nielsen went for a forced draw because he only cared about not losing to a computer.

      If ChessBrain refused some normal traps that computers normally fall for, then could it be the case that the computer is better than you realise. What if the drawn match was a bad one for the computer?

      I suspect Nielsen sacrificed the win to see if ChessBrain would fall in his standard tricks, and when it didn't he settled for a draw. With that knowledge he'd probably play the second game much differently, and based on ChessBrain's poor position in the first game, would likely win.

      But the fact that ChessBrain didn't fall in those standard traps tells us it's better than most computer opponents.

  12. Obligatory Slashdot Comment by Crypto+Gnome · · Score: 4, Informative
    It's only a large aggregation, not really a cluster in that sense.

    Anyway apparently it worked! (ie not a cluster in that sense either)

    If it WAS implemented on the clustering technology we-all-know-and-love as Beowulf, would that make it a Beowulf-Squared?

    And, of course, we have to ask the (obvious) question(s)
    --
    Visit CryptoGnome in his home.
  13. PS by Gogl · · Score: 4, Informative

    It was a draw by repetition. The human grandmaster had a position advantage and was able to force a draw that way despite being down a significant amount of material.

    1. Re:PS by arvindn · · Score: 3, Informative

      Not exactly. Nielson had a positional advantage but decided to force a draw anyway by sacrificing material to obtain a draw by repetition. Your version sounds more romantic, but is not accurate :-)

  14. Intangibles... by John+Seminal · · Score: 4, Interesting
    Computers playing chess is not the same thing as two people playing the game.

    With two people, there are some elements that can not be programmed into a chess game. I remember in high school playing chess, there was a differance between playing a math academy team and a school best known for its basketball program. Expectations were different, the pressure was different. I remember the pressure of the state finals. There is the look the other person has, almost like poker. Can I bluff this person? Can I trick this person? What about the clock, can I manipulate that to cause an emotion in the other person.

    Maybe Spock can play a PC and have no differance in quality of play. But I prefer humans.

    --

    Rosco: "If brains were gunpowder, Enos couldn't blow his nose."

    1. Re:Intangibles... by Seraphim_72 · · Score: 2, Interesting


      Reminds me of the kid who was a year older than me who was in the Chess Club. Big guy, joined the Marines right out of highschool, played on the football team etc. Anyway, when he would go into a match he would pull out his chair about 5 feet or so - really far. He would then sit down in it, bend at the waist, grab the table and pull it over to him with the board and pieces jumping all over making a huge racket. It invariably ended up with him sitting at the table fiddling with his pieces while some shimp of a chess geek sat looking real scared about 5 feet away.

      Sera

      --
      Slashdot, where armchair scientists get shouted down and armchair theologians get modded up.
    2. Re:Intangibles... by HiThere · · Score: 2

      Have you looked through a recent edition of MCO? Even since I was interested in chess, professional level chess increasingly involves memorization. If your opponent can force you into an opening that he knows well, and you don't, he has a very great advantage. People used to study and work to invent novel openings (just consider the Orangutang), but now it's reached the point where the well researched openings cover more than it's reasonable to memorize. This has changed the nature of the game. (For the worse to my mind, but changed it.)

      You don't need to have a complete lookup table. You just need one that extends each line sufficiently far that it's easy to evaluate the position as either leading to a win, loss, or draw. The drawn positions are more difficult to evaluate, of course, because it's tricky. But there are so many drawn positions branching off the wins and losses that they, also, are tricky. Still, the size of the actual table needed is probably feasible, if one is really dedicated. Of course, it will still require much skill to take the "this is a won position" and actually deliver a win. When I was playing, I could never bring myself to memorize the lesser MCO openings (it was still possible then, back in the 1970's), but I was frequently able to win against those who were weaker in handling the mid game even though their opening gave them a decided advantage.

      OTOH, if you are saying that all games of perfect information are identical...well, that's a perspective. There are theoretical positions from which it is useful. But the pratical positions from which it is useful are minimal to non-existant.

      --

      I think we've pushed this "anyone can grow up to be president" thing too far.
  15. Comp. vs. Comp. by John+Hurliman · · Score: 3, Interesting

    I want to see this cluster take on IBM's system!

  16. GM vs. thousands of humans? by schm00 · · Score: 5, Interesting

    Has anyone ever written a system by which a large number of average chess players could collaborate to play a single game? The individuals could vote for the best move, and the majority would rule. Would a group like this be able to beat a high ranking player?

    1. Re:GM vs. thousands of humans? by vec+sibarra · · Score: 2, Informative

      Offhand, I would think not. Tests with monkeys have shown that intelligence is not cumulative. Ten half-power monkeys just can't equal five regular monkeys no matter what, to put it simply. Assuming that each player acts intelligently, i.e. non-randomly, there is about epsilon chance of them winning. Where epsilon is the chance that one of those players does act randomly... and randomly picks the best move... enough times to win. 0.02EU

      --
      They that can give up essential liberty to obtain a little temporary safety deserve neither liberty nor safety - Benjami
    2. Re:GM vs. thousands of humans? by sciencewhiz · · Score: 5, Informative

      There are many systems like this. Chessworld.net is one, and they just challenged chessbrain to a match. You can see a full list of chessworld.net's ongoing games here: http://chessworld.net/chessclubs/event_show_chessw orld_summary_rowgames.asp

    3. Re:GM vs. thousands of humans? by barfy · · Score: 2, Informative

      This was done, in Kasparov v World.

      It was done on the Zone.

      http://classic.zone.msn.com/kasparov/Home.asp

    4. Re:GM vs. thousands of humans? by TheLink · · Score: 2, Insightful

      No. Popular != best. 100 average people just gets you an average mob. If the average person is an expert then perhaps it works, but the average person isn't an expert.

      Many average eyes only make obvious bugs shallow. You need skilled eyes.

      A chess grandmaster aided by a bunch of high powered chess computers and programmes, might be able to beat the world number 1. The grandmaster provides strategy, and tells the computers which paths to look into. The computers provide search depth and protection against stupid mistakes.

      --
    5. Re:GM vs. thousands of humans? by JuggleGeek · · Score: 3, Informative
      Would a group like this be able to beat a high ranking player?

      I seriously doubt that the group would win. Some of the moves suggested by individuals in the group would likely be the best choice. But more votes would probably come in for another move - one which doesn't hold up as well.

      Some time back, I saw an average or slightly above average player play "everyone at the event" by allowing anyone who wanted to make one move in the game. Many people felt this put him at a disadvantage. But it actually gave him a huge advantage. 10 people make make reasonable moves - but all it takes is one guy to make a really stupid move, and now the individual has a big advantage over the "group".

      Chess is a game of mistakes. If neither side makes a mistake, draws are very common. That's why when you see games between two GM's, you see a lot of draws. In games where both are "average" players (not serious chess players) then mistakes are common, and generally the guy that made the last mistake is going to lose. (Not always - especially if he already had a demanding lead at the time.)

      Things that look very minor - or which are not noticable at all to the average player - are very important to top players. Letting 5,000 average players vote on each move pretty much guarantees that any slightly-above average player would win.

  17. Re:Understanding vs. Processing by 0xfc · · Score: 2, Insightful

    > It's too bad that chess has become a matter of memorizing a series of opening moves rather than a game of strategy.

    I do not play much chess but this statement interests me.
    Someone replied to you saying that the amount of possible moves is incomputable.

    I am just thinking if I was a Master Chess Player. Would I be studying the source code for the chess program before the match? It seems only fair because the creators studied many previous matches and played countless simulations. Will it be the exception that makes the rule on how future masters play? Think of a video game you have played where some rare ocurrence opened up a new way to play that allowed one to defeat the AI in trivial fashion.

    Sure the computer can look out 10+ possible moves on any piece on the board, but if the player can manipulate the program from the beginning in some exceptional way, the AI could stumble easily.

    After all, it is just an algorithm. I am sure several "bugs" will be found and abused in different variations in the future.

  18. Re:Understanding vs. Processing by arvindn · · Score: 5, Interesting
    Hey! This is pure FUD.

    GMs don't even play to mate anymore

    Only rank beginners (say less than a couple months into chess) ever play to mate. Its obvious who's going to win long before mate happens. To continue playing is a waste of both players' time, not to mention an insult to the opponent's intelligence.

    they just play out an opening move .

    I don't even know what this is supposed to mean. Grandmasters do an enormous amount of research into finding new moves in openings. They don't "memorize" them. There are five volumes of the ECO chess encyclopedia, and that just covers the basics!

    and whoever has the upper hand at the end takes the game

    No of course they don't. This is simply false, period. Why do you think there are things called "middlegame" and "endgame"??

    Its sad that because most moderators aren't chess players, anyone can write ridiculous BS and get modded up "+5, interesting".

  19. chorus of tortises vs. array of hares by Doc+Ruby · · Score: 2, Insightful

    It's really "10 trillion neurons" vs. "2070 CPUs", but the neurons are about 40Hz, while the CPUs are in the GHz class. My bets are on the homegrown favorite, the MPP integrated analog processor with the "intuitive" OS. Although v2 of the digital SW will benefit from the digirally-distributed analog MPP network of metaprogramming, and might come out on top in round 2.

    "Chess is for computers" - Usenet 1997

    --

    --
    make install -not war

  20. Losing to Computers by rynthetyn · · Score: 3, Informative

    It's gotten to the point that even Kasparov is only playing the best chess computers to draws. Of course, he did lose to Deep Blue, but despite all his insistance that IBM cheated, he got beat mentally, not necessarily because the computer was better.

    Incidentally, there is a new documentary, Game Over: Kasparov and the Machine about the Deep Blue rematch, which I had the opportunity to see at the US premier a few weekends back. I'd link to the review I wrote on my blog, but I don't think the sysadmin would be very happy with me if I did.

    --
    Eagles may soar, but weasles don't get sucked into jet engines...
    1. Re:Losing to Computers by Vellmont · · Score: 2, Insightful


      Of course, he did lose to Deep Blue, but despite all his insistance that IBM cheated, he got beat mentally, not necessarily because the computer was better.


      But that's part of the game. You can't seperate the mental part of the game from the psychological part of the game. This is one of the big advantages that computers have, they don't get psyched out. It might be more fair to say that Deep Blue didn't beat Kasparov at his best. The computer always plays its best game, humans only some of the time.

      --
      AccountKiller
  21. fur hats by Doc+Ruby · · Score: 2, Funny

    Vodka-cooled Russians have traditionally dominated the field.

    --

    --
    make install -not war

  22. Re:Understanding vs. Processing by prockcore · · Score: 3, Insightful

    Losing to computers in chess will be like losing to calculators in a addition match. People and computers aren't really in competition. They do very different things.

    Damn straight. A computer may be able to beat me at chess, but at least I can visually identify a chess set in a crowded room.

  23. Re:Understanding vs. Processing by TygerFish · · Score: 2, Interesting
    We're getting closer and closer to the days when humans won't be able to compete with computer's at chess. Even so I don't think this is such a big deal. We haven't be able to compete with computers at arithmetic for half a century and this doesn't bother anyone.


    As perceptive as that statement might be on the surface (and it is *VERY* perceptive), it draws a false analogy between chess and arithmetic. First off, arithmetic is a human activity that is engaged in by most people only as a matter of necessity and the removal of the need for deep ability in it brought about by the development of the electronic calculator is a universal boon (people no longer need a facility for calculation, a *talent,* to apply formulae).

    Chess on the other hand, is an activity engaged in on a purely elective basis and it is a contest between two people. It touches upon and broadens our instinctive need for comparison and competition. Unlike the algorithmic provisions of arithmetic, chess has a soul and that soul is the simple wager between two people who bring their respective talents and knowledge (tactics, strategy, knowledge of opening and endgame theory) to the board and each of the players wagers that he/she knows enough and is talented enough to reach an-as-yet-unknown set of winning criteria against any opposition the other player can create with no more information to work with than the initial position.

    Your reasoning ignores the need for competition and the glories that come from it. It is true the combination of better and better hardware and software will certainly make a computer the strongest chess-player in the world, sooner rather than later, but that day will mark a small diminishing of human worth in the world. Of course, this is a matter of opinion, an esthetic judgement and not logically demonstrable but the strength of it can be shown by three simple questions:

    1. Would a football game where all the players were robots be interesting?

    2. Would a world-class violin performance have meaning if the player was a pair of mechanical arms?

    3. Would anything be permanantly lost to the world if any of the above players was smashed to pieces?

    --
    To mail me, remove the 'mailno' from my email addy.
    "Yeah. It smells, too..."
  24. 2070 CPUs by Duncan3 · · Score: 4, Funny

    1 CPU to beat the GM.
    +2069 CPU's so it could get on Slashdot.

    There are very few humans on the planet that can beat even one computer. That's been true for how many years now? Neither beating a GM or 2070 CPU's is impressive anymore.

    Someone go built a robot that can shovel snow, now THAT would be useful.

    --
    - Adam L. Beberg - The Cosm Project - http://www.mithral.com/
  25. Re:Understanding vs. Processing by cognibrain · · Score: 2, Insightful

    ....humans won't be able to compete with computer's at chess. Even so I don't think this is such a big deal.

    I think it is a big deal. 50 years ago, if you'd told someone "I have a machine which can consistently draw with a grandmaster. Is it intelligent?" they would have said "Yes."

    50 years later, we say "Yes, but only in a very limited way", or "No, it's doing a very different thing", depending on our point of view. In either case, we're taking a position on what we mean by "intelligent", and our understanding of that word's meaning is deeper than it would have been 50 years ago.

    My view is that if the computer and the human acheive the same result, then they are doing the same thing. It doesn't matter that the computer is doing it in a "stupid" but well-understood way, and the human in an "intelligent" but poorly-understood way.

  26. Re:Understanding vs. Processing by spun · · Score: 4, Informative

    You do know FUD means "Fear, Uncertainty, and Doubt", right? I think the acronym you are looking for is "BS."

    --
    - None can love freedom heartily, but good men; the rest love not freedom, but license. -- John Milton
  27. Re:Understanding vs. Processing by flewp · · Score: 2, Funny

    You can also identify the computer that beat you and take a bat to it.

    The day a computer can pick out a person in a group and take a bat to them, that is the day we must fear.

    --
    WWJD.... for a Klondike bar?
  28. Must be too early to read slashdot... by Mawen · · Score: 2, Funny

    > and the equivalent of SETI@home (which similarly, has some people looking for a Mate).

    I had always wondered why people ran SETI@home; now I know: they have given up on mating fellow humans (Is their self esteem that low? Has obesity gotten that bad in America?) and are looking to find love with aliens, once we decrypt the personal ads they have been sending us via interstellar radio.

    (I think ambiguous appositives like these are a good reason to switch to Lojban)

  29. Am I doing my maths correctly? by Knx · · Score: 5, Interesting

    There are approximately 35 moves per position in Chess (average value). Thus, the branching factor of the search tree is ~35 with a simple min-max search. Assuming that the program is always picking the best move to search first -- which is obviously not systematically the case -- alpha-beta pruning allows us to get a branching factor equal to approximately the square root of 35, that is: close to 6.

    Assuming that 2070 CPU are able to do the calculations 2070 times faster than 1 CPU -- which, again, is not the case -- it appears that the resulting supernode is able to 'see' up to 4 or 5 half-moves deeper than a single CPU in the same amount of time:

    6^4 < 2070 < 6^5

    It doesn't seem to be *that* useful. For most strategical positions, thinking 5 half-moves deeper just doesn't make any difference. Game 3 of 'Kasparov vs X3D Fritz' is a good example: I'd be willing to bet that 2070 X3D Fritz playing together would have lost the game the same way, since the serious troubles caused by the pawns diagonal are still far beyond the resulting analysis depth. (Well... At least, I think so. I'm not a Chess expert!)

    Anyway, this is quite an interesting project. I hope to see it grow up in the future.

    -- Arnauld

    --
    The problem with Slashdot memes is that YOU INSENSITIVE CLOD!
    1. Re:Am I doing my maths correctly? by phkamp · · Score: 2

      There is a difference between "participated" and "worked flat out on the problem".

      In this case they had some serious bottleneck issues and at least the machines I had involved spent most of the time idle, throughout the game I probably got only about five moves per CPU, total.

      Poul-Henning

      --
      Poul-Henning Kamp -- FreeBSD since before it was called that...
  30. In other news... by Waffle+Iron · · Score: 2, Funny

    ...Waffle Iron still hasn't taken the time to learn chess strategy; gets soundly beaten once again by a cluster of one Z80 running the chess cartridge on a 1992 vintage Gameboy.