Slashdot Mirror


Codename Brutus: Chess-Playing FPGA PCI Card

rockville writes "Brutus, a FPGA add-in PCI card developed by ChessBase and Dr. Christian Donnegar, just dominated a strong field of human players at a tournament in Germany. It's the first serious chess-playing FPGA architecture since Deep Blue was disassembled after its victory over Kasparov in 1997. Pictures of the card and a short description are here."

260 comments

  1. Et Tu Brute! by Anonymous Coward · · Score: 2, Funny

    Now, maybe I can get my friends to stop planting knives in my back during chess matches... ..oh wait. Damn.

    1. Re:Et Tu Brute! by Anonymous Coward · · Score: 0

      What, like the opposing team's queen? I think she did that.. in Battlechess.

  2. this rules by alanhyee · · Score: 0, Redundant

    thats pretty sweet.

  3. How long till.... by RevJim · · Score: 5, Interesting

    How long till chess players are banned from wearing watches, because Deep Blue et al will be shrunken to the size of a pea?

    1. Re:How long till.... by Dumbush · · Score: 2, Funny

      hmmmm... naked chess, I want to watch the females play

    2. Re:How long till.... by Synocco · · Score: 1

      Have you see some of the female chess players?

    3. Re:How long till.... by Eric+Damron · · Score: 1

      And players are tested for chess playing brain implants....

      --
      The race isn't always to the swift... but that's the way to bet!
    4. Re:How long till.... by the_duke_of_hazzard · · Score: 1
    5. Re:How long till.... by Anonymous Coward · · Score: 0

      The important question is: does she take it in the poop chute?

    6. Re:How long till.... by ccp · · Score: 1


      Take my word for it, you don't.

      Cheers,

  4. And poor me by alexborges · · Score: 5, Funny

    I havent been able to beat gnuchess....:(

    --
    NO SIG
    1. Re:And poor me by tarquin_fim_bim · · Score: 1

      I've never been able to see the whole board on GNUChess, whatever resolution the last half inch always seems to disappear off the desktop, s'pose I should rtfm.

    2. Re:And poor me by SamBeckett · · Score: 2, Informative

      tarquin $> xboard -size small

      That will do the trick

    3. Re:And poor me by dtfinch · · Score: 1

      Don't feel bad. I find it very hard to beat C64 Chessmaster 2000.

    4. Re:And poor me by Anonymous Coward · · Score: 0

      Beating GNUChess on a modern PC is almost impossible unless you're a highly ranked master or grandmaster. You must play a lengthy gambit to even stand a chance. In straightforward positional games you will be crushed.

    5. Re:And poor me by andi75 · · Score: 1

      > Beating GNUChess on a modern PC is almost impossible unless you're a highly ranked master or grandmaster.

      That's not true. I played GNUchess running on an Opteron (at Linuxworld) and I easily trashed it (in a positional game). And I'm still more than 200 elo points away from grandmaster strength.

      - Andreas

    6. Re:And poor me by anon1888 · · Score: 1
      I havent been able to beat gnuchess....:(

      On a more serious note, I doubt there are many people who can. It's not really that funny, gnu chess is borglike.

    7. Re:And poor me by lazyl · · Score: 1

      If you're 200 shy of grandmaster then you're in the category he was talking about.

      --
      Aw crap, ninjas!
    8. Re:And poor me by Anonymous Coward · · Score: 0

      I've beaten GnuChess also (and it's 2700+) on my computer...only once though, i've had about 3 draws too. I've also drawn fritz playing at 2805...and I'm only 2100 :-)

    9. Re:And poor me by empereur · · Score: 1

      Which means you're at least 600 elo points above average player.

  5. Fits in a standard PCI slot. by Sean+Johnson · · Score: 1, Interesting

    I want one.......I have an empty PCI slot in my computer. I wonder if DivX encoding would benefit from FPGA's. That would be uber-neato!

    --
    >>>>>> Chewie, take the professor in the back and plug him into the hyperdrive.
    1. Re:Fits in a standard PCI slot. by cybermace5 · · Score: 2, Funny

      It would also help satisfy your urge to spend more on your computer than you did for your car.

      (taking into account the average Slashdotter's vehicle)

      --
      ...
    2. Re:Fits in a standard PCI slot. by Aadain2001 · · Score: 1

      Probably not. The PCI bus is so dog slow that no matter had good an algorithm you used or how fast you were able to get an indepentant clock on the the PCI board to run, you would starve the whole thing just fetching chunks of memory from RAM to encode and push back out to the hard drive. Now, if this plugged into an AGP slot, then you could have some real fun :)

      --
      Space for rent, inquire within
    3. Re:Fits in a standard PCI slot. by pbox · · Score: 2, Informative

      You mean the full board positions cannot be encoded in about 32 bytes (12 different figures=4bit * 64 squares = 32 bytes)? And the resulting move cannot be communicated back in less than 3 bytes? (from x=3bit + y=3bit + new_x=3bit + new_y=3bit)

      --
      Code poet, espresso fiend, starter upper.
    4. Re:Fits in a standard PCI slot. by SamBeckett · · Score: 2, Informative

      You need more than 12 bits to store a move-- en passant captures, castling and pawn promotions have to be handled seperately.

    5. Re:Fits in a standard PCI slot. by Magura · · Score: 1

      Which is why any at least half-sane FPGA host card has memory on board that the FPGA can get to without having to go via the PCI bus.

      Throwing a few dozen/hundred meg of moderately fast memory on a card is pretty cheap now days.

    6. Re:Fits in a standard PCI slot. by pbox · · Score: 1

      Good point. Worst case that 32bytes will be enough though.

      This just shows my unskilledness in chess :-) (and apparently in English)

      --
      Code poet, espresso fiend, starter upper.
    7. Re:Fits in a standard PCI slot. by garethw · · Score: 1

      It could potentially be faster than a software solution running on a processor, but it would certainly not be as fast as a dedicated chip (ASIC) designed for that purpose. And when you get past the few-thousand unit volume, ASICs are much, much cheaper. But it would be a neat project, I guess.

      --
      garethw
    8. Re:Fits in a standard PCI slot. by robslimo · · Score: 1

      Yes. Neat project. Yes. ASICs much, much cheaper (at volume) yes.

      This is a project that is neat and idealy suited to FPGAs for exactly the reasons you mentioned. What possible purpose could be served by producing a few-thousand chess winning machines? Deep blue, et al, were a product for publicity. Deep Blue was canned after it made its point as were all similar large scale plans because it's been done and proven that the game of chess does not call upon any special-to-human heuristics. This FPGA product is also for publicity, and does well as such, thought the linked site should work on their Eastern-European-to-English translation/spelling a bit, because it proves that the scale can be/has been shrunk.

      ASICs have their place and FPGAs their's. FPGAs are gaining ground because their capabilities are increasing and price decreasing. ASICs capabilities are increasing as well, but their cost decrease is not significant. The price/performance niche for ASICs is becoming increasingly dependent on higer volumes.

    9. Re:Fits in a standard PCI slot. by tiled_rainbows · · Score: 1

      nahhh, surely not. castling can be identified as king moving x,y -> x,y where difference between the two x values > 1. Pawn promotion and en passant caputures are rare enough that the most efficient thing would be, in situations where they were possible, use an extra 3 bytes (like another move) to specify piece taken / promoted to.

      Not that I know anything in particular. Please let me know if I'm wrong.

  6. I wonder by Kethinov · · Score: 0, Troll

    I wonder how much of this AI crap festers around on freechess.org

    --
    You're right, I wouldn't steal a car. But if it were possible, I sure as hell would download one!
  7. okay by Anonymous Coward · · Score: 4, Funny

    I for one welcome our new chess playing overlords!

    mod me -1 Redundant, dammit!

    1. Re:okay by Anonymous Coward · · Score: 0

      That's "I, for one, welcome our new chess playing overlords!" to you!

    2. Re:okay by Anonymous Coward · · Score: 1, Funny

      In SOVIET RUSSIA, chess overlords play YOU!

    3. Re:okay by Anonymous Coward · · Score: 0

      All your e tu are belong to BRUTUS!

    4. Re:okay by mattwolfewvu · · Score: 1
      Better, and *gasp* article relevent. (Article quote: "The Brutus project has been running for over a year now. Chrilly Donninger has consulted all the leading experts in the field, and he is also cooperating with a strong Russian GM.")

      Sooo...In (former) SOVIET RUSSIA, chess overlords welcome you!

      --
      "I think that when you become a Republican, you don't get to score any more." -- Butt-head
    5. Re:okay by nEoN+nOoDlE · · Score: 1

      I for one welcome our new chess playing overlords!

      HAHA! God, that gets me every time!

      --
      Don't trust a bull's horn, a doberman's tooth, a runaway horse or me.
    6. Re:okay by Anonymous Coward · · Score: 0

      That actually makes sense. Ever seen a chess match played with real people in costumes?

  8. how about... by 1ridium · · Score: 2, Funny

    a beowulf cluster of em....

    --
    Make it idiot-proof and someone will build a better idiot.
    1. Re:how about... by toddestan · · Score: 1

      I have 6 open PCI slots. If I fill them all up, does that count?

  9. The Solution by John+Paul+Jones · · Score: 4, Funny
    Microsoft needs to offer something like this, offloading worm/virus processing from the CPU.

    I bet they'd make another billion.

    --
    Feh.
    1. Re:The Solution by Alien+Being · · Score: 1

      "I bet they'd make another billion."

      I bet someone would h4x0r it. IBM had Deep Blue. M$ would have Deep Shit.

    2. Re:The Solution by Anonymous Coward · · Score: 0

      "M$ would have Deep Shit."

      Deep Brown.

  10. Slightly Off Topic by Davak · · Score: 4, Interesting


    As the power of computer "thinking" increases, I personally believe that a computer will soon be able to beat any human player by pure power alone. Chess will fail to be dominated by people.

    But what stands in its place? Forever I have thought of chess as THE place where the mind can still beat the computer in a game environment.

    What will be the next challenge? Where is there a game that requires the uniqueness of human thought over the pure power of computer calculations?

    Davak

    1. Re:Slightly Off Topic by VistaBoy · · Score: 4, Interesting

      The game of Go is extremely difficult to implement on a computer. I guess that's the next computing challenge.

    2. Re:Slightly Off Topic by Frostalicious · · Score: 3, Insightful

      Chess will fail to be dominated by people.

      I don't think there is an issue of who will dominate chess - man or machine. People play computers at chess for practice or fun, because people want it. Normal competitive chess will continue to be restricted to humans, as are most competetive games and sports.

      If there was some equal opportunity regulation for sports and games, the robots with the lazer beams would take over hockey, soccer, squash etc...

    3. Re:Slightly Off Topic by JExtine · · Score: 2, Insightful

      Go and Shogi ("Japanese Chess") have proven difficult for computers to master, with "average" players able to beat computer programs with ease. The strategies of Chess are pretty well defined, with Grand Masters easily able to say why one move is better than another. With Go, players simply reply that a move "felt right". Computers are getting closer and closer to dominating Human competition in Chess, but there are still many games where they cant compete with the masters.

    4. Re:Slightly Off Topic by Xerithane · · Score: 4, Funny

      Congratulations!

      You win the prize for being the first person to mention Go while being logged in in a chess story is this comment.

      --
      Dacels Jewelers can't be trusted.
    5. Re:Slightly Off Topic by greppling · · Score: 4, Informative
      I am reluctant to give the answer, as every timechess programs come up on slashdot, someone has to make a post referring to Go:

      Computers are still very weak at this Asian board game. And despite many people trying to make substantial progress with that. The best open-source one, GNU Go, is btw not very far away from the best commercial ones.

      There is a Go Wiki with, among other things, a short introdcution.

    6. Re:Slightly Off Topic by Gherald · · Score: 2, Interesting

      > What will be the next challenge?

      Solving the "problem" of chess for all possible solutions, of course!

      In particular, I'd like to see someone quantify exactly how much of an advantage White has if mathematically perfect moves are executed by both sides.

    7. Re:Slightly Off Topic by makapuf · · Score: 1

      Trolling on /. ?

    8. Re:Slightly Off Topic by jabberjaw · · Score: 1

      I know it might not exactly require the mind so much as sheer luck, but what about a game as simple as blackjack? Pitting a computer against a one who knows how to count cards might prove interesting, no?

    9. Re:Slightly Off Topic by MagPulse · · Score: 4, Interesting

      The last games to be conquered by machines will be physical like soccer, or involve recognition of speech or visual information. Humans use their brains to their fullest in those activities; it's what they're best at compared to machines. When AI gets that far, if you believe in the Singularity, we'll be at it.

    10. Re:Slightly Off Topic by searleb · · Score: 1, Redundant

      What will be the next challenge? Where is there a game that requires the uniqueness of human thought over the pure power of computer calculations?

      Let's start with the simple game of "conversation", move quickly to "philosophy", and futher on down the line to "intuition". Hell, even "natual spoken language" is currently impossible for a machine.

    11. Re:Slightly Off Topic by Anonymous Coward · · Score: 0

      Global Thermal Nuclear War!

    12. Re:Slightly Off Topic by JFMulder · · Score: 1

      I think the real next computing challenge would be to make Windows virus-free. :p

    13. Re:Slightly Off Topic by tshak · · Score: 3, Insightful

      But is it really the computer that's winning? It's one thing if all we do is give a computer the rules of Chess, and then see how it does. However, the computer is being told how to think and what to compute by humans. The computer is just automating (via opening/closing/midgame books, brute force, etc.) a human created algorithm. All that the computer has over the human is the speed of number crunching.

      --

      There is no longer anything that can be done with computers that is nontrivial and clearly legal. -- Paul Phillips
    14. Re:Slightly Off Topic by Pieroxy · · Score: 1

      That's the Graal, the ultimate challenge, not only the next one.

      Think about it. Go is qualified as "Extremely difficult" to implement. Thus it is only the first step to get Windows virus free.

      We're gonna need a friggin' lot of AI to achieve the Graal...

    15. Re:Slightly Off Topic by El · · Score: 4, Funny
      Where is there a game that requires the uniqueness of human thought over the pure power of computer calculations?

      Computers have never done well on "Jeopardy"; they keep forgetting to "please phrase your answers in the form of a question."

      --

      "Freedom means freedom for everybody" -- Dick Cheney

    16. Re:Slightly Off Topic by andy666 · · Score: 1

      what stands in it's place ?

      1. telling if a program has an infinite loop
      2. controlling a robot as it walks across a cluttered room
      3. performing accurate weather prediction
      4. detecting sarcasm

    17. Re:Slightly Off Topic by swordboy · · Score: 1

      What will be the next challenge?

      Art.

      This one's a Centrino Dali

      --

      Life is the leading cause of death in America.
    18. Re:Slightly Off Topic by flooey · · Score: 3, Interesting

      What will be the next challenge? Where is there a game that requires the uniqueness of human thought over the pure power of computer calculations?

      My first thought would be Diplomacy, since success in that game is based on communication, deal-making and -breaking, and manipulating others for personal gain.

      There is currently a Diplomacy AI project based on negotiation-free (nopress) play, but even that is far more difficult than chess since you have six other players and all seven players move simultaneously. As well, since there are six other players, often times it will be in a player's best interest to forgo an opportunity to better one's own position in favor of an ally. When those times are, how you can tell who your allies are (and decide who they should be), and how to use those to decide on a "best" set of moves from a set much larger than the set of legal chess moves appears to be quite a challenge.

    19. Re:Slightly Off Topic by maxume · · Score: 2, Funny

      Don't you think that the computer might possibly be able to count cards as well? In a machine like manner even? And instantly calculate lots of ridiculous things? Card counters use lots of tricks to cut down on the amount of things that they need to remember/calculate...

      --
      Nerd rage is the funniest rage.
    20. Re:Slightly Off Topic by Gherald · · Score: 1

      Conquering soccer is an iffy proposition though, because certain things could be considered "cheating". I mean, what if the computers were linked together with WiFi, or perhaps had some sort of central control system? I am sure most human players would consider that unacceptable.

      And there are a lot of variables that may bother humans, such as the firmness of a robot's exterior bumping into a player's skin...

    21. Re:Slightly Off Topic by bahowen · · Score: 1
      > What will be the next challenge? Where is there a game that requires the uniqueness of human thought over the pure power of computer calculations?

      No-limit Texas hold'em poker.

    22. Re:Slightly Off Topic by Alien+Being · · Score: 1

      "In particular, I'd like to see someone quantify exactly how much of an advantage White has if mathematically perfect moves are executed by both sides."

      I think it would have to be "always wins" or "always loses", but I'm not sure how to prove it.

    23. Re:Slightly Off Topic by Alien+Being · · Score: 1

      ...or "always draws"

    24. Re:Slightly Off Topic by Saeger · · Score: 1
      The technological Singularity really isn't something you need to "believe" in - it's an inevitability assuming we don't go extinct first.

      --

      --
      Power to the Peaceful
    25. Re:Slightly Off Topic by Gherald · · Score: 1

      Consider something simple like Tic-Tac-Toe. Because it is such a simple game we can easily calculate how much of an advantage X has over O.

      Because chess is so much more complicated, this has not been calculated yet. But the problem is so huge and requires so much computing power that it will probably not be solved for hundreds of years...

    26. Re:Slightly Off Topic by stmfreak · · Score: 1

      Politics.

      --
      These opinions guaranteed or your money back.
    27. Re:Slightly Off Topic by Anonymous Coward · · Score: 0

      Contract and Duplicate Bridge.

      Chess is now trivial, at least in a mathematical sense. My guess is that we'll need another three or four orders of magnitude increase in CPU power before a computer can compete with even mediocre human players.

    28. Re:Slightly Off Topic by zangdesign · · Score: 1

      Hey, can I enter a shark with a "la-zer beam" on it's head in the next chess match?

      --
      To celebrate the occasion of my 1000th post, I will post no more forever on Slashdot. Goodbye.
    29. Re:Slightly Off Topic by Pharmboy · · Score: 1

      What about the Simpsons (obligitory) where they talk of a dog that shoots bees from his mouth?

      --
      Tequila: It's not just for breakfast anymore!
    30. Re:Slightly Off Topic by mraymer · · Score: 1
      A comparison between go and chess:

      http://www.villagenet.com/users/bradleym/Compare.h tml

      One of the reasons that Go is so much harder to do with AI is that the number of possible moves is no where near as limited as Chess. Thus we can't just "brute force" the AI like we do with Chess.

      --

      "To confine our attention to terrestrial matters would be to limit the human spirit." -Stephen Hawking

    31. Re:Slightly Off Topic by ztwilight · · Score: 1

      how about charades?

      --
      Who moved my sig?
    32. Re:Slightly Off Topic by jdhutchins · · Score: 1

      I don't know much about Go, but I do know that computers are getting faster and faster, and eventually it will just be a matter of time beforee Go can be "brute-forced". I don't know how long it will take, but it will happen eventually.

    33. Re:Slightly Off Topic by Alien+Being · · Score: 1

      "Consider something simple like Tic-Tac-Toe. Because it is such a simple game we can easily calculate how much of an advantage X has over O."

      Right, it comes out to exactly zero advantage. With the game of Nim the first player can always win.

      Assuming that we had the monster computer that could brute force its way through a chess game, then I think it's correct to say that it would be able to solve the halting problem for chess. If the game doesn't halt, it would mean that the game always ends in a draw. But if it does halt, then for a given initial state (opening move) the algorithm would be deterministic.

      Does that make any sense?

    34. Re:Slightly Off Topic by afidel · · Score: 1

      Go can't be purely brute forced, there are more possible games of Go then there are atoms in the universe!

      --
      There are 4 boxes to use in the defense of liberty: soap, ballot, jury, ammo. Use in that order. Starting now.
    35. Re:Slightly Off Topic by afidel · · Score: 1

      Computers can already make art. There are neural nets out there that have been fed basic rules about a field of art (painting or music are two I have seen), then unleashed on the web. They create a piece or artwork and then have the results voted on by visitors to the sites, the nets use the results of those votes as fitness scores for the next generation of creations.

      --
      There are 4 boxes to use in the defense of liberty: soap, ballot, jury, ammo. Use in that order. Starting now.
    36. Re:Slightly Off Topic by Flakeloaf · · Score: 1

      Consider something simple like Tic-Tac-Toe. Because it is such a simple game we can easily calculate how much of an advantage X has over O.

      The best way to win is not to play.
      How about a nice game of Chess?

      --

      Am I the only one who heard Roxette to sing "I'm gonna get blitzed for some sex"?

    37. Re:Slightly Off Topic by Gherald · · Score: 1

      I loved that movie! =D

      When I was six, of course...

    38. Re:Slightly Off Topic by Kris_J · · Score: 1

      Oh, and I suppose Pitch-O-Mat 5000 was just a modified Howitzer?

    39. Re:Slightly Off Topic by MegaFur · · Score: 1

      I chalenge you to build the "tree of all Chess moves". I think you will find it will take you many thousands of millenia to build the thing. Good luck with that.

      --
      Furry cows moo and decompress.
    40. Re:Slightly Off Topic by Gherald · · Score: 1

      Yeah, I mentioned "the problem is so huge and requires so much computing power that it will probably not be solved for hundreds of years..." in a follow up post.

      But your grandparent was wondering what "the next challange will be," and I have it to him. :)

    41. Re:Slightly Off Topic by jpmorgan · · Score: 1

      No, the last games to be conquered by machines will be drinking games.

    42. Re:Slightly Off Topic by Paradise+Pete · · Score: 2, Funny
      Pitting a computer against a one who knows how to count cards might prove interesting, no?

      Why? Because computers are so bad at things like counting and keeping track of stuff?

    43. Re:Slightly Off Topic by Russellkhan · · Score: 1

      "The strategies of Chess are pretty well defined, with Grand Masters easily able to say why one move is better than another. With Go, players simply reply that a move "felt right"."

      I think you're misinformed. It is true that there are "players" who will respond that a move "felt right", and I am even one of those players who would respond that way in many cases, but I would also respond that way when explaining the reason I made a particular chess move - and I would estimate that my skill level in each game is roughly equivalent - (~1450 ELO for chess, 10 kyu in Go - better than the best go playing programs, IIRC). "Masters" in Go (Pro- level Dan players), or even advanced amateurs (Amateur dans and near-dan Kyu players) can generally explain why a given move is good (or bad) and effectively teach less experienced players both general concepts and specific tactics and strategies. I have several books on Go which do exactly that. If all they had to say was that a move "feels right" they wouldn't be of much use as learning tools.

      --
      Information doesn't want to be anthropomorphized anymore.
    44. Re:Slightly Off Topic by Anonymous Coward · · Score: 1, Interesting

      Ah, yes. But that is also true of chess.

      I don't think chess is currently "brute forced" nor will it or Go ever be "brute forced".

      Chess programs right now evaluate the position to determine which side has an advantage, and how much of one. They cannot (in most situations) calculate out to the end of the game.

      Fritz (arguably the best commercial program) amazes me. It knows that despite it being down material (for instance a rook), it has very good changes for an advantage and would evaluate certain positions to be 'one pawn' in its favor, despite being down a whole rook! (about 5 pawns worth). It still cannot see a definite way to win the position however, it just knows it has the better chances.

      Don't tell me it knows that by "brute forcing"!

    45. Re:Slightly Off Topic by PurpleFloyd · · Score: 1
      I challenge you to build the "computer that can beat a human grandmaster." I think you will find it takes many thousands of years to do it. Good luck with that.
      (</SARCASM>)

      While the tree of all possible moves would probably finish computing after the heat death of the universe, you don't have to have the complete tree to compute whether, given optimum play by both players, white always wins, always loses, or the game is always a draw. The only requirement is that each possible game be run until the game is unwinnable by either white or black; there are established algorithms to find this. Of course, this is a significantly smaller tree than that of all possible moves.

      While the problem is a tough one to crack, it may well be solved within the next few decades, particularly with massively parallel computing on the horizon: miniturization plus clustering technology means cheap, powerful, small supercomputers perfect for tasks like this that consist of many more or less independent operations.

      --

      That's it. I'm no longer part of Team Sanity.
    46. Re:Slightly Off Topic by Xrikcus · · Score: 1

      Chess is partially brute forced, in that calculations are run for a large number of levels theoretical turns and options. At each level there are limited turns that are remotely sensible. The art to designing a good chess computer is working out a position evaluating formula that gives a good answer, take that down multiple levels and you have a better idea.

      The problem with Go I think is the large number of options that are available at any one point, which makes a very bushy game tree, ie hard to brute force to any depth at all. It is also much harder to generate a static evaluation of the board, because of the more arbitrary "positions" the game can get itself into.

    47. Re:Slightly Off Topic by ComaVN · · Score: 1

      Does that make any sense?

      No, it doesn't. The halting problem has NOTHING to do with draws or wins. The halting problem is about determining wether a certain algorithm eventually finishes execution, and the monster computer you refer to most definitly DOES finish eventually. Remember the 50 moves rule? This ensures that the total number of moves in a game is finite (around 3000 max or so), and therefore the total number of possible games is finite too (somewhere in the 10^120 region if I remember correctly)

      Also, halting has nothing to do with determinism.

      Check any decent book on computation theory for more information.

      --
      Be wary of any facts that confirm your opinion.
    48. Re:Slightly Off Topic by Anonymous Coward · · Score: 0

      Well, I was going to post "What about reading?" but then I saw you typed "game", so I'd lose at that game too.

    49. Re:Slightly Off Topic by protonman · · Score: 1

      Yeah, that's about the same logic my dad uses when I beat him.

      "But I told you how to play! So once again, I beat myself!"

      --
      The man of knowledge must be able not only to love his enemies but also to hate his friends.
    50. Re:Slightly Off Topic by sql*kitten · · Score: 1

      What will be the next challenge? Where is there a game that requires the uniqueness of human thought over the pure power of computer calculations?

      You're missing the point of games, which is what chess is, a means of entertainment for the players and in some cases spectators. We have machines that can lift many orders of magnitude more weight than any human, yet weightlifting is still a sport. We have machines that travel at 20,000 mph, yet running at 20 mph is still a sport. You can use a 10-megapixel camera to take pictures, yet painting is still an art. And the finest technology in the world can't turn a mediocre musician into a good one.

      Superseding the individual capabilities of humans is the whole point of machines. Humans, for the forseeable future, are the only entities that can decide what to do, and why, and when, bringing capabilities to bear on a problem. If you're looking for a challenge, try implementing "hard" AI :-)

    51. Re:Slightly Off Topic by supremebob · · Score: 1

      Funny, I would have thought that robots would be GREAT at drinking games! All you need to do is build a robot with a bigger "storage tank" than us, and you have a guaranteed winner for beer chugging competitions!

      I'm suprised that someone at MIT hasn't already built one of these!

    52. Re:Slightly Off Topic by redog · · Score: 1

      Coed naked Twister! Beat that with computing power!

    53. Re:Slightly Off Topic by Anonymous Coward · · Score: 0

      What about breaking those rules? If we had done this in Mozart's time I doubt we would have ended up with new (in comparison) music like that of Beethoven, Chopin, Rachmaninoff...
      And even less so the music of today.

      But I'm just making an assumption anyway. Do you have links to this computer-generated art?

    54. Re:Slightly Off Topic by 2toise · · Score: 1

      Isn't this like saying that weight-lifting will be dominated by construction machinery? Computers are playing chess in a way which is not comparable to people. The ultimate situation of having a computer that 'knows' every possible game fork from each move and can win easily is like putting weigh-lifters up against industrial cranes. Sure, they can lift more, but it's not the same thing.

    55. Re:Slightly Off Topic by MegaFur · · Score: 1
      While the problem is a tough one to crack, it may well be solved within the next few decades, particularly with massively parallel computing on the horizon: miniturization plus clustering technology means cheap, powerful, small supercomputers perfect for tasks like this that consist of many more or less independent operations.

      Oh. That would be cool. My guess is: with best play, Black is able to hold off White and the game ends in a draw. But that's just my opinion.

      --
      Furry cows moo and decompress.
    56. Re:Slightly Off Topic by Anonymous Coward · · Score: 0

      Hi Davak,

      Please see this site:

      I thought about this question for a long time while restricting the game to use only a standard chess set.

      Omar

  11. One crazy scientist! by trippinonbsd · · Score: 5, Funny

    Look at that guy, he looks like a mad scientist.

    1. Re:One crazy scientist! by Aadain2001 · · Score: 0

      Ya, mad at his barber *buddum ching* Go ahead, mod me down! I dare you!

      --
      Space for rent, inquire within
    2. Re:One crazy scientist! by Grizzlysmit · · Score: 1

      Yeah, Waaaay Cooooool, I wonder if I could look like that if I tried 8-) :-) ;-)

      --
      in my life God comes first.... but Linux is pretty high after that :-D
      Francis Smit
  12. Full length add-in card by jj00 · · Score: 1, Funny


    Guess this thing won't fit into my Shuttle PC...

  13. You gotta love... by Anonymous Coward · · Score: 0
  14. Re:Ah... by tarquin_fim_bim · · Score: 1

    Especially on March 15th.

  15. Finally... by wolrahnaes · · Score: 4, Funny

    I was almost giving up on /.
    It's been days since we had an article about something that is really cool but useless for all practical tasks

    --
    I used to get high on life, but I developed a tolerance. Now I need something stronger.
    1. Re:Finally... by Anonymous Coward · · Score: 0

      No, there was an article on Linux yesterday.

  16. FPGA HW linked like Voodoo 2 by Anonymous Coward · · Score: 2, Interesting

    A note from the webpage (before it gets slashdotted) on why this implementation is "better":

    "An additional benefit of using FPGAs is that it is not just the search routines that are speeded up dramatically. Due to the sturcture of the code you can add chess knowledge in any quantity without slowing down the process. In regular PC programs each new quantum of knowledge is expensive - it is bought at the price of search speed. The FPGA program does not slow down when you add new knowledge modules."

    Beyond speculation, further development could involve a server version for a 64-bit PCI bus. Another solution would be to join multiple cards as was done with the Voodoo 2 way back in the day...

    1. Re:FPGA HW linked like Voodoo 2 by dave420 · · Score: 1
      isn't it about the code structure, not the hardware structure?

      Don't get me wrong - I love voodoo2s. I have one of the little SLI(?) ribbon cables in front of me. It's been knocking round my desk since I scrapped my poor, poor Voodoo2 (R.I.P.)

      Damn those things got hot. I had to get one of those voodoo2 cooling things with the two fans just to get it to stop freaking out. Creative, it was. Both in brand and nature :-P

    2. Re:FPGA HW linked like Voodoo 2 by Jad+LaFields · · Score: 1

      Hey, I actually removed a Voodoo 2 card that was hooked up to an old Diamond Stealth 2d card in an old computer of mine that was laying around about an hour ago!

      It was hilarious pulling it out and seeing the good ol' 3dfx logo stamped all over it...

      Um, nothing to say that's actually on topic...

      --
      [SIG] It's like putting a moose in the blender -- a recipe for disaster!
  17. Hmm by mkweise · · Score: 4, Funny

    Deep Blue was disassembled after its victory over Kasparov in 1997

    Kinda makes you shudder to think what they would've done to Kasparov if he had won...

    --
    Gentlemen! You can't fight in here, this is the War Room!
    1. Re:Hmm by Anonymous Coward · · Score: 1, Funny
      >>Deep Blue was disassembled after its victory over Kasparov in 1997

      >Kinda makes you shudder to think what they would've done to Kasparov if he had won...

      I guess it's the opposite of bullfighting: when the bull loses, the restaurant serves big rocky mountain oysters. When the bull wins, the restaurant serves small ones.

  18. Computers will never beat us at... by Scrameustache · · Score: 5, Funny


    Twister.

    --

    You can't take the sky from me...

    1. Re:Computers will never beat us at... by Saeger · · Score: 1
      Why is that funny? A dexterous robot could easily contort its body better than a human could.

      --

      --
      Power to the Peaceful
    2. Re:Computers will never beat us at... by maxume · · Score: 1

      Oh my god, do you ever suck.

      --
      Nerd rage is the funniest rage.
    3. Re:Computers will never beat us at... by Anonymous Coward · · Score: 0

      its funny because twister is a hilarious game all by itself and adding computer players into the mix makes it even funnier.

    4. Re:Computers will never beat us at... by Scrameustache · · Score: 2, Informative

      Oh my god, do you ever suck

      No, and stop coming on to me you fag

      --

      You can't take the sky from me...

    5. Re:Computers will never beat us at... by maxume · · Score: 1

      What the fuck? I was replying to the reply, not to you. Fucking weird man.

      --
      Nerd rage is the funniest rage.
    6. Re:Computers will never beat us at... by Scrameustache · · Score: 1

      I was replying to the reply, not to you.

      And yet, somehow, your reply ended in MY messages.
      Stop posting drunk, its bad for karma.

      --

      You can't take the sky from me...

    7. Re:Computers will never beat us at... by Anonymous Coward · · Score: 0

      Shut up!

  19. Shall the PCI card assist in the slashdotting by Anonymous Coward · · Score: 0

    How to use the CPU to handle the slashdotting?

  20. Probably... by Anonymous Coward · · Score: 0

    The game Go, where computers have not yet come close to intermediate level players, mostly due to the huge search space.

    More details.

  21. Full length-pci by Anonymous Coward · · Score: 0

    Been a while since I saw a full length pci card...
    For home pc use that is...

  22. Poor Chess Players...... by Millbuddah · · Score: 1

    Didn't they ever watch Popeye??? The only way to defeat Brutus is to eat a can of spinach!!!!! Oh wait....or was it Bluto? Damn, nevermind.

    1. Re:Poor Chess Players...... by The+Spie · · Score: 1

      You want something that's had a lot of retroconning? Try the Bluto/Brutus situation.

      Here's how that came about. The rights to produce cartoons of Popeye characters had fallen back to King Features, the Popeye comic strip distributors, after Paramount closed Famous Studios, its in-house cartoon creators, in 1957 (and proceeded to sell off the cartoons to AAP). The material from Fleischer Studios and then Famous are the cartoons broadcast by Cartoon Network.

      (1957 wasn't a very good year for cartoons in Hollywood. MGM also closed their studio that year, and Warner Brothers instituted cutbacks that delayed their (first) closure until 1963.)

      In the early 1960s, King Features sold the rights to create new Popeye cartoons for television. However, in order to make absolutely certain that there were no rights problems that would result in a suit by Fleischer, Famous/Paramount, or AAP, a mandate was included in the contract: only those characters created by Elzie Segar (and later by Doc Winner and Bud Sagendorf) for the comic strip could be used. King Features was absolutely certain that Max Fleischer had created Bluto for the first Popeye cartoons, so use of Bluto was forbidden.

      Well, Popeye did need an arch-enemy (or cryptic lover if you believe certain Minute Maid commercials). So, out of the inkwell, so to speak, came a Bluto clone named Brutus, with enough differences to prevent a lawsuit but enough similiarities that the audience accepted him as a renamed Bluto.

      Then someone at King Features decided to actually do some in-depth checking. It turns out that Elzie Segar had indeed created Bluto for the comic strip, and that the creators of the new cartoons had a right to use him. But by that time, Brutus had become established, so Brutus kept on being used.

      A few years ago, the Popeye comic book, which is regarded as canonical, declared in plain terms that Bluto and Brutus are, in fact, two different people.

      Insert your own SCO joke about intellectual property here.

      --
      If using Linux is about choice, how come people complain when I choose to use Windows?
  23. FPGAs by Twillerror · · Score: 2, Interesting

    I think these are the coolest things to come around since high level languages.

    I've done some reading on VHDL and other languages used to program them. It would also be a fun hobby and a great way for open source to venture into the hardware realm.

    VHDL compilers are platform specific, so as the FPGA platform evolves the code written can be tweeked and recompiled to run faster on new chips. You could also take the compiled result and do additional tweeking to create an IC. It could also be possible to re-compile on the fly if the industry got standard enough, even running through an emulator if need be.

    FPGAs can even load new code as they are running, pretty fast to. So you could have librarys in memory and move them into the processors as they are needed. This allows for a much more complex program to be in hardware.

    Memory bandwith and memory in general seem to be some limiting factors, but are being addresses as they evolve. I think eventually they will be like a normal CPU, surrounding the FPGA.

    FPGA designs ( the fpga itself ) are usually a lot simpler then a normal CPU, so manufactoring them on smaller processes like 90 nm and lower will be easier, of course not a cake walk either.

    Check out http://www.xilinx.com for some products, they seem to be affordable for the average joe. I've read "Programmable Logic: PLDs and FPGAs" ( look on Amazon or your favorite reseller ), it was outdated, but a good introduction. There are some new books that I'm looking to get my hands on as well.

    I've done quite a bit of google searching, but haven't found a good "getting started with fpga" site. If anyone has some please reply with them.

    1. Re:FPGAs by FunOne · · Score: 4, Informative

      VHDL the language may not be specific, but to properly use/take advantage of an FPGA architecure it must be specifically targeted. Writing VHDL for implementation ( and not just simulation) requires targeting the specific final implentation (FPGA, CPLD, VLSI) and even the specific brand/type/etc.

      FPGA designs require dynamic processes (so that they can be reprogrammed) and highly regular, repetative, and predicatable implementation. That does NOT make them easier to change process with. Unlike memory/processors that can be reclocked or relabeled, the FPGA needs to be as exact as possible to get proper functionality out of it.

      If you want a good "Getting started with Hardware Design" I suggest attending a university for a Computer or Electrical Engineering degree.

      Coding VHDL for HW implementation is NOT easy, its not just VHDL->Synthesis->DONE. There is tons of testing and retesting to determine if it synthesized right, if its timed right, if its functional under all inputs/circumstances. Getting a properly simulated and funciontal VHDL design (in the synthesizable VHDL subset that is) is only step ONE of a design. You then have to get a design that is still functional that will synthesize. Then you have to get a design that is still functional that synthesizes that performs correctly.

      Its not the kind of thing that you can learn in 21 days from a Sams publishing book.

      --
      FunOne
    2. Re:FPGAs by RetroGeek · · Score: 1

      Its not the kind of thing that you can learn in 21 days from a Sams publishing book.

      Damn!

      --

      - - - - - - - - - - -
      I am a programmer. I am paid to produce syntax not grammar. Deal with it.
    3. Re:FPGAs by seanadams.com · · Score: 4, Interesting

      I have quite a few books on VHDL and logic design and this one is absolutely the best book for a beginner:

      Fundamentals of Digital Logic Design with VHDL

      Based on little more than what I found in that book, I was able to implement my first chip, which is currently shipping in the SLIMP3 network music player. Managed to fit the design in a small XC95144XL CPLD, which handles memory buffering, DMA transfer, IR capture, and serializing of data to feed to an audio decoder.

      It starts with the most basic building logic building block and boolean algebra, and moves step by step from there to a basic CPU. Very well organized and easy to follow, with excellent examples.

      Please DO NOT start with the Xilinx Foundataion kit and the examples therein. It will not make any sense. Actually it'll make even LESS sense to you if you have any software background at all.

    4. Re:FPGAs by seanadams.com · · Score: 2, Insightful

      If you want a good "Getting started with Hardware Design" I suggest attending a university for a Computer or Electrical Engineering degree. .....Its not the kind of thing that you can learn in 21 days from a Sams publishing book.


      Get off your high horse, dude. It is NOT that hard to get started. With a good introductory book and a CPLD/FPGA demo board something like this, it is quite possible for someone who has never done logic design to get up to speed and crank out a few simple working designs after a couple weeks of study.

      I don't think the parent post was suggesting that learning how to make a high-speed, silicon-ready design is as easy as learning a new programming language, but there is a lot you can learn and do with VHDL on the way there.

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

      FPGAs aren't as hard as the original poster was implying but they aren't as easy as you are saying either :)

      FPGAs require an understanding of hardware concepts and will take some time to master (eg. timing, gate design, etc)...

      Sivaram Velauthapillai

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

      I know they are not easy, but I've been reading about basic hardware for a while, and I do think it is possible to learn without drinking for four years ( going to school, just kidding I'd like to have gone, but it isn't for me. ).

      I've applied and got denied to a engineering schools, even though I'm making good money and have good job security not even having a college degree in the software world.

      I feel like I could learn this on my own, not overnight, you cannot become anything good overnight.

      I think FPGAs at least allow someone who doesn't have access to expensive schools and even more expensive labs a chance to learn hardware designs. And I think there are actually some suprising similiarity's between hardware and software.

      Plus software can take a lot of testing as well, and it isn't as easy to define sometimes. Logic functions usually work with a pretty small vector. The number of permutations can be huge, but can also be defined. Theorectically it is possible in a complex application, but hard to think about.

    7. Re:FPGAs by hti_brain · · Score: 0

      Xilinx sucks, try Altera instead. The Quartus EDA software suite by Altera is much more user-friendly and powerful than Xilinx's ISE Foundation. It has a GUI similar to that of Microsoft Visual C++. As you know why, I'm part of the developer :P

    8. Re:FPGAs by coinreturn · · Score: 1

      I am an FPGA designer by vocation. I was planning on buying the SLIMP3 for home, but now that I find a beginner VHDL programmer designed it, I am truly hesitant. Does the SLIMP3 allow for in-system reprogrammability in case of bugs?

    9. Re:FPGAs by seanadams.com · · Score: 1

      Yes, the CPLD can be reprogrammed over ethernet, through the microcontroller, but this is not a feature we've needed to use in the field.

    10. Re:FPGAs by mfrank · · Score: 1

      They had a neat article in Scientific American a year or so ago about how soon they'll have FPGAs in your PC that can be reprogrammed almost instantly, and it'll be able to "task switch" every 10 or 20 milliseconds. While you're thinking about your move while playing chess against the FPGA, the seti@home hardware will kick in. :)

    11. Re:FPGAs by gbooker · · Score: 1

      It would also be a fun hobby and a great way for open source to venture into the hardware realm.

      Open sources has extended into the hardware realm. I am sure there more sites, but I have found Open Cores to be quite helpful. They have all kinds of things, and some are GPL.

      --
      You see? It's like I've always said. You can get more with a kind word and a 2x4 than you can with just a kind word.
    12. Re:FPGAs by Anonymous Coward · · Score: 0

      So if someone wants to start learning to program FPGAs, which is a better language to learn, VHDL or Verilog?

    13. Re:FPGAs by chewybaka · · Score: 1

      UGH! This conversation is painful to read. Yes, it is not that hard to learn and HDL. Yes, it is not that hard to read a book on logic and understand that 1 AND 0 = 0, 1 OR 0 = 1, and 1 XNOR 0 = 0. It is even easy to throw together some simple logic designs and pretend like you are a real FPGA/ASIC designer.

      HOWEVER, unless you have a firm grasp of the following concepts the design may never work in the real world: setup-time, hold-time, propagation delay, duty-cycle, jitter, SSO, pipelining, DLLs, PLLs, DCMs, CLBs, LUTs, DPMs, R=V/I, gated-clocks, clock-domain-transition, how to select the right I/O standard, duty-cycle-correction, DCI, fanout, fanin, overloading, etc.

      I felt much the same way other posters do when I was fresh out of school: "I've done RTL in class... this is easy." Then reality hit when I landed my first job. Yes they talk about this stuff in school, but the professors still make you believe that it is as easy as it looks by giving whimpy projects and rubber stamping the finished product if it simulates correctly (much like many of the HDL self-teaching books). They teach you all of these concepts, but don't hold you feet to the flame when the course ends. When you finally start working you realize that these concepts aren't some obscure bits of info that you have to worry every once in a while. You need to understand and worry about all of them throughout the design cycle.

      Now for the worse part: you find out that you actually know more about the FPGA you selected than the FAE that is supposed to be helping you with device/software issues. This is especially true of bleading-edge FPGA's where you get to be the guinui (sp?) pig for the ven-duh. (sorry... just venting here)

      IF after all this I still haven't scared anyone away from trying, then more power to you. You will probably make a good designer someday if you work hard at it.

      BOOK RECOMENDATIONS:

      DIGITAL DESIGN:
      A Verilog HDL Primer (2nd ed), by Bhasker
      Verilog HDL Synthesis - A Practical Primer, by Bhasker
      IEEE Standard Verilog Hardware Description Language (WARNING: close to 1000 pages)
      Fundamentals of Logic Design, by Roth
      Digital Design Principles & Practices, by McCluskey

      ELECTICAL ENGINEERING BASICS:
      Electical Circuits (4th ed), by Nilsson
      Electric Devices & Circuit Theory (5th ed), by Boylestad and Nashelsky

      HARD CORE MICROELECTRONICS (not for the weak of heart):
      Circuit Design for CMOS VLSI, by Uyemura
      Principles of CMOS VLSI Design, by Weste and Eshraghian

  24. Crafty. by Night0wl · · Score: 3, Interesting

    This makes my thoughts return to Dr. Hyatt and his amateur program, Crafty. Under his personal operation he runs a copy on a Quad Xeon box, and apperently has been developing a Beo-Crafty rendition to play chess on a Beowulf cluster.
    It would be particularly interesting if this Beo-Crafty could be taylored to operate on a set of these cards. One nice hefty machine at the top level, and a slew of these PCI cards to do the real crunchy work.

    --
    Computational Madness in a round package.
  25. Deep Blue disassembled? by ryan76 · · Score: 1

    Deep Blue was disassembled after its victory over Kasparov in 1997 Anyone know why Deep Blue was disassembled?

    --
    http://threetechguys.info Come, discuss Technology. Got a technology question? Come ask!
    1. Re:Deep Blue disassembled? by thorgil · · Score: 2, Funny

      Threat to humanity?

      --
      Warning: This sig contains a small bug. ==> *
    2. Re:Deep Blue disassembled? by uradu · · Score: 2, Funny

      > Anyone know why Deep Blue was disassembled?

      Because, when Gary asked him for the last time to open the game, he replied:
      "I'm sorry, Gary, I'm afraid I can't do that." For some odd reason the chief scientist went nuts and spontaneously disassembled BB on the spot.

    3. Re:Deep Blue disassembled? by Anonymous Coward · · Score: 1, Informative

      No one knows for sure why Deep Blue was disassembled. IBM also fired the entire team that worked on Deep Blue after it won the series against Kasparov. There are two theories:

      1. Deep Blue was useless, because it was only a chess-playing machine, and had defeated the world champion of chess (at the time), Kasparov.
      2. There is heavy speculation that IBM was cheating with Deep Blue. Some people believe that the machine was also being helped by GMs, behind the scenes, and it was dismantled to destroy the evidence. The reason for this suspicion was the notorious time when Deep Blue hesitated to play a move, and then suddenly changed the move. The Deep Blue team admitted it was not programmed to do this.

    4. Re:Deep Blue disassembled? by ryan76 · · Score: 1

      Sounds like an urban legend... But if it wasn't programmed to do that... Then how did it? What was IBM's response?

      --
      http://threetechguys.info Come, discuss Technology. Got a technology question? Come ask!
    5. Re:Deep Blue disassembled? by dave420 · · Score: 1

      SCO claimed some of their code was in there and tried to charge Kasparov $14bn? I hear he disassembled it with his own teeth...

    6. Re:Deep Blue disassembled? by Anonymous Coward · · Score: 0

      Basically what it boils down to, is the match was kind of a joke. IBM got to change the programming inbetween games and there were literally no games that Kasparov could've looked at, cf. to any professional player, with whom you can look at his entire tournament canon and see how he attacks and defends. IBM took the money and run; they didn't want people to look at how it was done, or weaknesses, or set up a rematch.

    7. Re:Deep Blue disassembled? by afidel · · Score: 2, Informative

      Deep blue WAS helped by some very good chess players both as coaches and as members of the Deep Blue team. Basically the match was Kasparov vs a bunch of way above average chess players and one really honkin fast chess computer as an aid. And Deep Blue was never dismantled, half of it is at the Smithsonian intact, the reason they don't have both towers is they simply didn't have room for it all.

      --
      There are 4 boxes to use in the defense of liberty: soap, ballot, jury, ammo. Use in that order. Starting now.
    8. Re:Deep Blue disassembled? by EventHorizon · · Score: 1

      Maybe they just lost the source code and wanted a disassembly.

    9. Re:Deep Blue disassembled? by Vagrant · · Score: 1

      In Feng-hsiung Hsu's book Behind Deep Blue, he states that the RS/6000 machines they used for Deep Blue were already sold to customers. There was a shortage of machines at the time, so they hijacked/borrowed the machines for the match, then shipped them off to the customers after the match (minus the Deep Blue chess hardware).

  26. Flashback by Anonymous Coward · · Score: 0

    Was Chrilly Donninger ever employed by 3dfx? Possibly during the developmend of the voodoo6?

    That thing is the size of a motherboard!

    Jebus!

  27. on the other hand by Trepidity · · Score: 4, Interesting

    Most people are exceedingly bad at Go as well. The top Go players are invariably those who have been doing essentially nothing but playing Go since they were 3 years old, leading many to hypothesize that the root of good Go play is essentially astoundingly good pattern recognition.

    1. Re:on the other hand by Gherald · · Score: 1

      Yeah, I mean, most humans can't tell the difference between Go and Othello...

    2. Re:on the other hand by Anonymous Coward · · Score: 0

      And how is this different from chess? Most people start playing when they are pretty young...

    3. Re:on the other hand by jemecki · · Score: 1

      So why is it so hard to design a good Go program? A computer with a database of millions of possible positions would still "know" more positions than a person who has been playing since he was a child.

    4. Re:on the other hand by chthonicdaemon · · Score: 1

      Finding a move is about finding an optimal branch of a move tree. The tree in Go is much wider than with chess -- there are too many possible moves on a 19x19 board with no fixed moves defined for pieces. So the solution is not to look at 'positions', but at patterns on the board (as there could be only a few patterns on a board, all independant of one another). The thing is that these patterns are hard to recognize -- enter the difficult bit. Not the analysis of moves, but the recognition of patterns.

      --
      Languages aren't inherently fast -- implementations are efficient
  28. Sombody has to say it by Ugodown · · Score: 0, Troll

    In soviet Russia, CHESS plays YOU!

    --
    --- to swing on the spiral...
  29. Competition between chess systems? by Anonymous Coward · · Score: 2, Interesting
    I know Kasparov is smart, and I know most everyone can beat me at chess, and I know that most of these specialized chess things need a team of people just to operate, but how do they fare against each other.

    Like, if you put Deep Blue against Gnuchess... or even Sargon II on the Vic-20... would Deep Blue win *every single time* in a trouncing defeat? Would some programs give Deep Blue/Thought a real challenge or just a good run on a fluke of the random number generator?

    1. Re:Competition between chess systems? by Anonymous Coward · · Score: 0
      Like, if you put Deep Blue against Gnuchess... or even Sargon II on the Vic-20... would Deep Blue win *every single time* in a trouncing defeat? Would some programs give Deep Blue/Thought a real challenge or just a good run on a fluke of the random number generator?

      Are you really that ignorant? None of those second-grade chess programs would EVER beat Deep Blue at chess.

    2. Re:Competition between chess systems? by Anonymous Coward · · Score: 0

      Are you really that ignorant? I'd like to see what course a game between those two would take.

    3. Re:Competition between chess systems? by Smaon · · Score: 1

      I dunno if this answers your questions, but I try to give some useful links:

      There's an (annual?) computer olympiad where computer games play against each other. 2002 Brutus won bronce in chess...
      http://www.cs.unimaas.nl/Olympiad2002/re sults.html
      2003 it will be held in Graz, Austria
      http://www.cs.unimaas.nl/olympiad2003/

      For testing chess programs against each other: the only occasion I know about was made by heise (http://www.heise.de/ct/schachduell/ ) but with opponents of the same leage (Shredder and Fritz), I think it was mentioned on /. when it was held...

      I don't think anyone bothered to let a good program run hundreds of games against a really poor one to see if there's a chance to win for the latter. But I think that it's like a chess novice playing against Kramnik or Kasparov: he'd need a hell lot of luck to win....

    4. Re:Competition between chess systems? by sql*kitten · · Score: 1

      Like, if you put Deep Blue against Gnuchess... or even Sargon II on the Vic-20... would Deep Blue win *every single time* in a trouncing defeat?

      It would depend on what conditions were imposed on timings. If you assume that each machine is allowed 5 minutes to think about each move, and that each game has (say) approximately 100 moves, then between the first and second moves, Deep Blue could model every single game that the VIC20 could possibly play and be ready for it.

      But if you set the game up so each machine could look no more than 3 moves into the future, then it comes down to the skill of the algorithm designers. It could well be that the Sargon II programmer was smarter because he had such limited resources and the IBM programmers grew sloppy because they assumed that they would always have enough processor time to look further into the future than their opponents.

  30. The real story.... by freeze128 · · Score: 0

    I really want to know what you think FPGA actually stands for, and how you think it can be a PCI card.

    1. Re:The real story.... by thebigmacd · · Score: 2, Insightful

      I'll bite, because the sarcasm (if any, I'm not sure) is too subtle...

      Field Programmable Gate Array mounted on a PCI card. Why do I sense criticism?

    2. Re:The real story.... by Anonymous Coward · · Score: 0

      it's okay, I hear these same folks make SETI@HOME accelerator on a card too.

  31. In the future... by Ugodown · · Score: 2, Insightful

    I think that eventually, the question won't be if a machine can beat a human at chess, it will be who's computer can beat the other computer that can obviously beat a computer. And the pride will be in the design of the hardware and software that beats the reinging computer.

    --
    --- to swing on the spiral...
  32. That card is way too big... by 403Forbidden · · Score: 2, Funny

    que the anti-voodoo5 and anti-geforce5800 zealiots.

    "but but but.. it takes an ENTIRE PCI slot... where will i put my porn stash now?"

    1. Re:That card is way too big... by sharkey · · Score: 1
      que the anti-voodoo5 and anti-geforce5800 zealiots.

      That bang you just heard was a Grammar Nazi's corrective sense shifting without a clutch.

      --

      --
      "Outlook not so good." That magic 8-ball knows everything! I'll ask about Exchange Server next.
  33. Deep Blue was not dismantled by phr2 · · Score: 5, Informative

    It's in the Smithsonian and the hardware is more or less intact. It's in the typical condition of a decommissioned computer, i.e. you can't just flip a switch and start using it, but there's some chance that the folks who built it could get it working again sometime. This is described in the book "Behind Deep Blue: Building the Computer That Defeated the World Chess Champion" by Deep Blue's designer F.-H. Hsu. Hsu later got interested in building a Shogi (Japanese chess) machine using FPGA's. He says with today's custom VLSI, the equivalent of Deep Thought could be built on one chip and mounted in a compact flash card. You'd put the card into your Zaurus or Ipaq PDA and have a grandmaster-strength pocket chess machine. He put some effort into commercializing such a device but couldn't get enough backing so he went off to greener pastures.

    1. Re:Deep Blue was not dismantled by heli0 · · Score: 1
      --
      Whenever the offence inspires less horror than the punishment, the rigour of penal law is obliged to give way...
    2. Re:Deep Blue was not dismantled by phr2 · · Score: 1

      The machine is in the Smithsonian. You can go look at it, but can't run it. Hsu bought the rights to the design when he left IBM. He tried to get a rematch with Kasparov in order to help commercialize the technology, but Kasparov wasn't willing to play. This stuff is all in the book. My copy isn't handy so I can't check the exact quotes, but I believe Hsu specifically says the news reports saying the machine was dismantled are in error.

    3. Re:Deep Blue was not dismantled by toddestan · · Score: 1

      Apparently the computer has been atleast partially dismantled, and some of the peices are at the Smithsonian.

      From a visitor guide buried in the Smithsonian's website:
      http://www.si.edu/pdf/SIVisitorGuide.pdf

      "WHAT'S NEW
      Deep Blue Chess Computer. Known for being the first computer to
      beat a reigning world champion chess player in a regulation match,
      IBM's Deep Blue sparked questions about the implications of a
      computer being able to beat the human mind. Five years after Gary
      Kasparov lost to Deep Blue in a chess match, Deep Blue remains a
      cultural icon. This new display includes one of Deep Blue?s two tow-
      ers, chess memorabilia, a video of the Kasparov-Deep Blue match
      and a flipbook of cartoons commemorating the event."

  34. Its not about playing games by oolon · · Score: 2, Informative

    Chess grandmasters do not tune their skills by playing lots of games, how could the best player ever get better? The interesting part only occurs in the middle game. Most GMs learn by reading books and replaying of important games. Its about seeing the pattern and knowing how to counter it. This is exactly the kind of thing computers are good at. They don't have to be taught how to understand the game or how to put to getter some new stratagy, just want to do when something happens. This is why Gary Kasparov was so upset at loosing, the computer had been programmed to recognise all know plays and knew how to counter them. So it simply waited for Gary to make a mistake.

    James

    1. Re:Its not about playing games by Gherald · · Score: 1

      That is part of it, but more important is pure calculating power. If a computer can think a significant amount of moves deeper than a GM, it has a HUGE advantage.

    2. Re:Its not about playing games by Anonymous Coward · · Score: 1, Funny

      When will IBM come out with a supercomputer that teaches people the difference between 'loose and 'lose'?

    3. Re:Its not about playing games by Ninja+Programmer · · Score: 2, Insightful
      Chess grandmasters do not tune their skills by playing lots of games ... Most GMs learn by reading books and replaying of important games.
      What?!?! This is blatantly incorrect. Many of the world's top Grand Masters have accounts on ICC and play a lot. Certainly GM Alexei Shirov (currently ranked 7th in the world) GM Nigel Short (past World Championship candidate, and ranked 16th in the world) and GM Zong Zhang (ranked 33rd in the world) are known to regularly play lots and lots of blitz games on ICC to keep their skills up. Many of the other top players play under unknown handles, so that nobody knows who they are.

      The books are *WRITTEN* by these top GMs -- they have raw databases that they create themselves that are far deeper than just about any book on any opening system. It is also well known that they also use computers to check opening ideas.

      And in the endgame, besides trivial ones that can be stored on CD-ROMS (6 pieces or less) humans are *FAR* superior to machines. There are even some endings that *I* could play better than the best computers (I am rated about 1800.)
    4. Re:Its not about playing games by Anonymous Coward · · Score: 0

      Parent post is inaccurate. Please mod down.

    5. Re:Its not about playing games by Anonymous Coward · · Score: 0

      Chess grandmasters do not tune their skills ONLY by playing lots of games.

      They have their own trainees, they study their opponents beforehand, they study known games and openings...

    6. Re:Its not about playing games by dersen · · Score: 1

      Its about seeing the pattern and knowing how to counter it. This is exactly the kind of thing computers are good at.

      Nope. Pattern recognition is excactly the kind of thing humans are good at. Computers are improving, but they are still heavily dependent on their raw calculating powers when playing chess.

  35. In the year 2000.... by Anonymous Coward · · Score: 0

    The only interesting chess matches will take place between the latest models of casio graphing calculators. Which will be a change from the previous millenium when there when the word interesting never appeared in conjunction with "chess matches."

  36. obligatory thought by micronix1 · · Score: 1

    what? where's the oversized heatsink/fan and external power connector?

  37. Soylent Silicon isn't made out of people! by Kibo · · Score: 1

    You're forgetting game shows. I'm betting it'll be at least until after we've beaten the Zentradi that computers will routinely be competative with humans at idol singing.

    Aki Ross might have done ok on Hot Or Not, but there were two gay guys and a chick. And before someone says Larenzo Lamas isn't gay, I'd like to point out that while formerly married to a former playmate there's no proof of sex, and he did wear a neckerchief, in public no less.

    --
    --Jimmy has fancy plans; and pants to match.
  38. Not the strongest competion by imnoteddy · · Score: 1
    dominated a strong field of human players at a tournament in Germany

    While I'm sure it's a good program, none of the humans was in the top 100 human players.

    That said, it is almost certain that computers will dominate humans in chess at some point.

    --
    No electrons were harmed creating this post, though some may have been subjected to electrical and/or magnetic fields.
  39. you'll think... by Goozbach · · Score: 1

    ... when bender kicks your ass

    --

    I used to but then I quit.

    1. Re:you'll think... by mfrank · · Score: 1

      your shiny metal ass.

  40. why? by ShadowRage · · Score: 1

    what's the real point of this? really. "WOO HOO! I've made a computer even more smarter than a human!" big deal. Really, Where's the real need to this? I mean, if you have a chip that possibly cannot be beaten, then, why have it around? where's the fun in that? What use will it bring? If they created a board that could fix storage and resource issues in a machine, or created perfect voice recognition? It's neat that they created this, but for what real reason? to play some world chess champ, and that's it? where will these go into production? the average person doesnt play chess, The people that do usually cant beat it right and left, and there are very few people that could even give this some challenge, to make it appealing they would have to dumb it down. So, what's the use of such a device?

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

      Oh go back to your X-Box...GTA3 waits for you.

  41. No wonder it only won 50% if the games.... by Anonymous Coward · · Score: 0

    it was due to the "sturcture" of the code

  42. Basically, yes by achurch · · Score: 1

    As a (very low-level) Go player, everything I've seen, and been told by higher-level players, says that it's all about pattern recognition. By playing games upon games upon games, you apparently learn to recognize certain combinations of stones and the optimal sequences of moves from them. All the high-level players are very good at this sort of reading ahead, and it's how good you are at reading ahead that primarily determines your skill at such levels.

    Or so I hear, anyway.

    1. Re:Basically, yes by Anonymous Coward · · Score: 0

      From a strong chess player...

      Chess is also primarily pattern recognition. Yes, there is mental calculation involved. However, this is only to find known patterns!

      The hard part to both chess and go (in my limited experience with go) is to be able to see the different possible patterns available to you, and determine which is preferable in that exact position with regard to what is happening elsewhere on the board.

      Chess has some situations where you can see a new pattern as you play, but recognizing previous patterns is a huge part of playing chess (well, playing chess well ; ) ).

      The two games are not as different as people think!

  43. I dont own a car! by gazoombo · · Score: 1

    ... you insensitive clod!

    --
    John Hancock
  44. This is wonderful by Call+Me+Black+Cloud · · Score: 1, Redundant


    I, for one, welcome our new chess-playing overlords. I'd like to remind them that as a trusted Slashdot poster, I can be helpful in rounding up others to toil in their underground card factories.

  45. I know this sounds neat... by vfs · · Score: 1

    I know this sounds pretty neat, but does anyone else remember this article?

    1. Re:I know this sounds neat... by silentmusic · · Score: 1

      This one is not a hoax. If you go to the Computer Chess Club via www.talkchess.com then you can find some discussion of it's performance.

      One question that you could ask is does this really improve the performance of Chrilly's Nimzo engine or is it a gimmick? It's hard to get any worthwhile data. Supposedly Chrilly is working on a parallel processing version of Brutus, but that's a non-trivial problem so we'll see how well it scales. The goal is probably to win this year's world champs in Graz to generate some interest in a chess PCI card. If he doesn't win, then not many people will be willing to pay the huge expense to get a PCI chess board. (And even if he does win, it's a pretty small market.)

      If you want to see how you could do move generation in an FPGA then check out Marc Boule's thesis at http://www.macs.ece.mcgill.ca/~mboul/ there you will find documentation and VHDL code.

      If you want to know how eval in hardware might work then you can search for information on Ken Thompson's Belle, and Hsu's Deep Thought. Probably the best source is Hsu's phd thesis, plus Hsu's article in IEEE Micro, and finally Hsu's article in AI. (Some have coauthors but I'm too lazy to look them up.)

      I have personally coded a hardware move generator in Verilog and know that it fits in a "small" Virtex 2 part.

      --

      Things are not as they appear, nor are they otherwise.

  46. Deep Blue WASN'T FPGA! by Anonymous Coward · · Score: 0


    Deep blue wasn't FPGA (floating point gate array). It was made from ASICs (Application specific integrated circuits.)

    There's a big difference, performance-wise. ASICs are a fair bit faster since they are custom circuitry, with datapaths and logic designed specifically around the problem being solved.

    1. Re:Deep Blue WASN'T FPGA! by garethw · · Score: 1

      Actually, that would be Field-Programmable Gate Array.

      --
      garethw
    2. Re:Deep Blue WASN'T FPGA! by Anonymous Coward · · Score: 0

      okay smarty-pants, expand the acronym CPLD and please identify the major manufacturer that uses each acronym (FPGA and CPLD). then and only then can you rest soundly that your inane desire to correct someone for not using an apostrophe is somewhat founded.

    3. Re:Deep Blue WASN'T FPGA! by hti_brain · · Score: 0

      CPLD = Complex Programmable Logic Device FPGA = Field Programmable Gate Array Manufacturer = Altera, Xilinx, Actel, etc. Idiot!

  47. won't work by ztwilight · · Score: 1

    I've got a special chess-playing chip implanted in my brain

    --
    Who moved my sig?
    1. Re:won't work by efishta · · Score: 2, Funny

      your brain is so deficient at chess it requires the equivalent of an external FPUs installed in it - wow, a step backwards to 386s.

  48. 12 bits for a move, 276 bits for a board by mec · · Score: 2, Interesting

    I co-wrote a chess program on a miserably tiny piece of hardware once, so I looked into this.

    For representing the moves, the simple 12-bit scheme (from-square, to-square) handles en passants and castling.

    En passant example: white pawn on e5, black pawn moves f7-f5, white moves e5-f6. Unambiguous.

    Castling example, even easier: o-o is e1-g1 or e8-g8; o-o-o is e1-c1 or e8-c8.

    You can even do pawn promotion with 12 bits, if you adopt some clever encoding when the source square contains a pawn that is going to promote. If the source square has a pawn in it, then the second 6 bits are not a square. They are: two bits to specify left-ahead-right (instead of 6 bits of destination) and two bits to specify queen-rook-bishop-knight.

    In fact you can take this further and always encode the destination in 5 bits instead of 6, because given the source square you know what piece is on it, and there are at most 27 moves which a piece can make (queen in the center).

    That's 11 bits for encoding a move.

    Grab a few unused bit patterns for "offer draw" and the like.

    For encoding a board, you can use 4 bits per square to encode what is on the square. There are 13 things that can go on a square so you lose a little to rounding. You have to encode whose move it is. You have to record 1 bit each for the a1, e1, h1, a8, e8, and h8 squares to indicate if the piece on them has ever moved, for castling. You have to encode en passant information. That is 4 bits off the top of my head (once you know whose move it is, there are eight possible last-pawn moves that could be e.p.'ed, plus the possibility of no e.p., so 9 things to encode). You need the 50-move counter or whatever the limit is in FIDE rules these days, that's another 6 bits. And you need three-fold repetition counter, another 2 bits. And you need a bit to indicate whether the side that just moved offered a draw.

    So for the board: 4*64 (position) + 1 (move) + 6 (castling state) + 4 (en passant state) + 6 (50-move counter) + 2 (3-fold repetition) + 1 (draw offer) = 276 bits.

    1. Re:12 bits for a move, 276 bits for a board by FryGuy1013 · · Score: 1

      You have to record 1 bit each for the a1, e1, h1, a8, e8, and h8 squares to indicate if the piece on them has ever moved, for castling.
      ----

      Wouldn't you only need to know if o-o or o-o-o are permitted requiring four total bits?

      ----
      And you need three-fold repetition counter, another 2 bits.
      ----
      Would you need to store the actual 5 previous moves, requiring 66 bits? Or do you count this? If you can access what the last 5 moves are, then why do you need to store the number of repeated moves?

      --
      bananas like monkeys.
    2. Re:12 bits for a move, 276 bits for a board by SamBeckett · · Score: 1

      Ignoring flags for the moment....

      If you have the start position of say, a rook,

      bits 0-5, bits 6-7 bits 8-11
      xxxyyy dir squares moved (up to 7!)

      So that is still 12 :-). Also, most computer chess programs don't try for minimal encoding since they also pack in enough information to "undo" the move after it is made as well as ordering information (since alpha/beta is heavily dependant on move order). My crappy chess engine fits it in (barely) with 32 bits.

      As for flags, you only need 4 for castling, 4 for enpassant. For three-fold repeition, if you even bother keeping track, you need to keep track of all moves previous to the last un-reversible move (i.e., capture, pawn move, castling, etc), as that can go on for 100 "half-moves", you will need 12*100 bits for that :-)

    3. Re:12 bits for a move, 276 bits for a board by mec · · Score: 1

      I agree, 4 bits suffices for castling (one for each castling possibility). I don't know why I didn't see that before! Blind spot.

      For three-fold repetition, you don't need to know what the previous moves were. You just need to know that the board position has occurred 0 times, 1 time, or 2+ times before, ever. If it is occurred 2+ times before, then "claim draw" is a legal move.

      Actually it occurs to me that you need more bits than that, because you need to know if the position that you are moving to is going to occur for the 1st, 2nd, or 3rd+ time, because those are different positions. So there is a source of more state information, quite a bit of it, actually. Argh!

      I never did implement three-fold repetition which is why I'm weak on the design of this part.

      If you can access what the last 5 moves are ...

      The idea is to reduce this to a graph exercise. The boards are nodes, and the moves are directed edges from one board to another. If a board carries "the last 5 moves", then that's an additional 60 bits of state information on the board, for 334 bits (give or take a few).

      Three-fold repetition doesn't have to be on consecutive moves. So storing the previous 5 moves would not be enough.

    4. Re:12 bits for a move, 276 bits for a board by FryGuy1013 · · Score: 1

      well I guess I'm unclear on the rules then. I thought it had to be board states a-b-a-b-a-b in order to claim the draw, either that or perpetual check/50 moves without a pawn move or capture.

      --
      bananas like monkeys.
    5. Re:12 bits for a move, 276 bits for a board by Scarblac · · Score: 1

      In my opinion, three fold repetition is a property of a game (series of positions), not of a position. You need to be able to check all the positions since the last pawn move/castle/capture (moves that can't be "undone"). It is possible that a position repeats for the third time twenty moves after the first time it occurs.

      A position does need to record how many half moves have gone since the last capture or pawn move, for the 50 move rule. This is important for programs (if the program is still trying to win, it should move a pawn or capture if 49 moves without have gone).

      As for encoding moves, there was at least one database program that encoded moves depending on the number of possible moves in a position. If a position has 32 or fewer possible moves, the one chosen can be encoded in 5 bits, et cetera. But that was a database program (NICbase), speed is not as all important as in an engine.

      --
      I believe posters are recognized by their sig. So I made one.
    6. Re:12 bits for a move, 276 bits for a board by Scarblac · · Score: 1

      well I guess I'm unclear on the rules then. I thought it had to be board states a-b-a-b-a-b in order to claim the draw, either that or perpetual check/50 moves without a pawn move or capture.

      I'm in Europe, so I know only the FIDE (international) rules. The USCF is strange in that it is the only national federation that uses its own rules.

      But in FIDE rules, it is like this: if it is your move, and the current exact position (including castling rights, en passant capture rights) occurs for the third time in the game, OR you can currently make a move which would cause a position to occur for the third time, you may claim a draw.

      Note that in the last case, you don't actually make the move. In really official tournament play, you would stop the clock, notify the arbiter and explain to him which move you intend to make, and that you claim a third time repetition based on that move.

      --
      I believe posters are recognized by their sig. So I made one.
    7. Re:12 bits for a move, 276 bits for a board by FryGuy1013 · · Score: 1

      Well that might be the way the USCF is. I'm not a competetive chess player so I don't know. Mainly I just have an interest in making games AI (I'm sure many CS people do thoug). I was thinking about writing an AI for chess and using it as my college thesis, but too many people have already done it, so I doubt it will get any recognition :).

      --
      bananas like monkeys.
    8. Re:12 bits for a move, 276 bits for a board by kasperd · · Score: 1

      That's 11 bits for encoding a move.

      So out of the 6+6 bits you find a way to save one bit of the destination. It would be at least as simple to save two bits of the source. Rather than encoding every possible square, encode only those at most 16 squares on which the player have a piece. That will take us down to 9 bits. Now the interesting question is, can this be taken even further? Is there any position in which there are more than 256 possible moves?

      --

      Do you care about the security of your wireless mouse?
  49. Good for an old laugh. by Anonymous Coward · · Score: 0

    Reminded me of this.

  50. General Purpose Device? by lostchicken · · Score: 1

    How long before an FPGA is standard issue on motherboards? From Photoshop filters, to Audio work, this could be something very, very powerful.

    IBM Mainframes have enormous abilities to work with data with very little in the way of MIPS. They do this by having processors that can do math on data going over I/O channels without the CPU ever dealing with it. A motherboard FPGA, programmed at the application level could change the way we think about computing, allowing us to deal with data, treating it as signals, processed simultaneously, instead of as numbers, processed sequentially.

    --
    -twb
    1. Re:General Purpose Device? by afidel · · Score: 1

      Never, most of those instructions are used too infrequently and not repeated enough for FPGA's to be a good fit. The reconfigure times are just too high. The more general purpose SIMD instructions on most modern processors are good enough for most media work.

      --
      There are 4 boxes to use in the defense of liberty: soap, ballot, jury, ammo. Use in that order. Starting now.
    2. Re:General Purpose Device? by EventHorizon · · Score: 1

      Xilinx sales guys have been barking up that tree for a while.

      There are two practical problems: interchip I/O is extremely expensive in modern computing architectures, and FPGA clock rates are too low. By the time you get the data into and out of an FPGA running at 200 MHz, you typically could have done the whole algorithm in software (3 GHz assuming your working set fits in cache).

      Someone with excellent fabs would need to build a CPU+FPGA onto one piece of silicon for this to be worthwhile. Once that happens, I/O to the FPGA could become the same cost as I/O to cache, and reprogramming latency would also become more reasonable...

    3. Re:General Purpose Device? by Anonymous Coward · · Score: 0

      Already done, Xilinx sell the Virtex II Pro chips that have upto 4 PowerPC processors running at upto 400Mhz(manafacturer quote).

      There are plenty of FPGA applications that standard processors can only dream of doing. High end DSP work is often the domain of FPGA work. With literally 100's of multipliers onboard the FPGA there is no way that an off the shelf CPU (or even DSP) can keep up with them.

  51. Chess as "the" place for humans over machines by Blue23 · · Score: 1

    Chess defied computers as real masters for so long because the problem space /used to be/ too large to take a good look at, so intuition and finely honed skills at determining positional strength (as opposed to just calculating plies of moves) kept the top humans the top of the field.

    However, as computers get more powerful, being able to look far ahead/prune less will slowly be able to simulate true positional understanding, because the computer will be able to "see" farther reaching strategies.

    That was the magic of Deep Blue. Lots of custom designed chess chips (like Brutus, except even faster because it was on a single chip and there were more of them) running in an IBM SP cluster. It just had enough cycles to look far enough ahead that it simulated positional understanding at the level of a grand master.

    I'm not putting Deep Blue down - it took an amazing amount of thought to design those chips, I'm in awe of it.

    Coming back to Brutus, computer speeds have been doing their normal Moore's law increase. What used to take a huge number of custom chips, you can now do on much fewer.

    Their are games where the search space is even larger, and not just by a few orders of magnitude. Go is one of these, and is often touted as the next fronteir of man's superiority over machine.

    Man will maintain that for a time, as computers get faster and ground down the difference. Maybe they'll never "get it". Or maybe they'll be able to play all possible games in 3 minutes.

    The joy of discovery.

    =Blue(23)

    --
    LITTLE GIRL: But which cookie will you eat FIRST? C. MONSTER: Me think you have misconception of cookie-eating process.
  52. Go vs. Chess by Blue23 · · Score: 1

    Thanks for the link, I haven't read that before.

    My thought is this - grand masters in chess used to be so far above computer players, because the computer players could not handle the huge number of possible positions.

    Computers have advanced enough that now they can deal with positions on the level of a grand master, at least with a powerful enoguh computer (a la Deep Blue).

    I would expect that the same will eventually hold true of Go. Currently, computers can't hold a match to high dan players (or is it high kyu players, I haven't checked out rankings in a while).

    However, I would expect that as computers get faster, that even the massive positional space of Go will eventually be able to be calcuated in a period of time given for moves to a deep enough level to emulate human players.

    I don't think a computer will ever have human elegance, for lack fo a btter term, while playing, but it may have it's own, unique brand of play that is quite effective.

    =Blue(23)

    --
    LITTLE GIRL: But which cookie will you eat FIRST? C. MONSTER: Me think you have misconception of cookie-eating process.
  53. The computer that's winning, or the humans that ma by Blue23 · · Score: 3, Insightful

    But is it really the computer that's winning? It's one thing if all we do is give a computer the rules of Chess, and then see how it does. However, the computer is being told how to think and what to compute by humans. The computer is just automating (via opening/closing/midgame books, brute force, etc.) a human created algorithm. All that the computer has over the human is the speed of number crunching.

    It's an interesting point. Depends on what you define winning as.

    If you are comparing the ability of own human to do something unaided vs. the ability of another human to build a tool to do the same, then the tool builders win.

    If you are comparing chess skill, then the designers need not have more chess knowledge then the master, they just have a different way of approaching the probelm. In that case, as a matter of pure chess skill, hte master "wins" over the human designers.

    *shrug*

    I don't think the question is all that important, except to illustrate that "the computer" doesn't win, it's merely a tool.

    =Blue(23)

    P.S. Of course, the computer is your friend, keep your laser handy.

    --
    LITTLE GIRL: But which cookie will you eat FIRST? C. MONSTER: Me think you have misconception of cookie-eating process.
  54. Anything you can do I can do better by SlashCrunchPop · · Score: 2, Funny

    Karpov saw this coming and competitive as he is, one day he asked me to try to fold him down to PCI form size. This was the first time in my life that knowing origami helped and although his ears were a big problem, somehow I managed to fold him down to PCI form size. OMG, he's still in PCI slot 5! No wonder I'm so good at Quake all of a sudden. Hmm, I wonder if I should get a heatpipe for him.

  55. Acronyms by JewFish · · Score: 1

    I am willing to bet that a lot of /.ers had no idea that FPGA stood for Field Programmable Gate Array, I only knew this because I took a digital logic class during my undergrad.

    Hmm come to think of it I bet 85% of /.ers have no idea what PCI stands for. Oh well I for one love our acronym oriented Engineering culture, I also like acronymfinder.com

  56. ENOUGH WITH THE BEOWULF COMMENTS! by Anonymous Coward · · Score: 0

    Thank God, I was beginning to worry that there would be no idiotic, token Beowulf comment in this thread.

    "Wow look at that (insert object here)"
    "How about a Beowulf cluster of em!"

    "Wow look at that piece of backbacon"
    "How about a Beowulf cluster of em!"

    "Wow look at that drunk man vomiting in the street"
    "How about a Beowulf cluster of em!"

    "Wow look at the high-beams on that chick!"
    "How about a Beowulf cluster of em!"

  57. I'm looking for something like this that plays... by Zathras11 · · Score: 0

    No Limit Texas Hold'em poker. I'm serious.
    How cool would that be!

  58. Re:I'm looking for something like this that plays. by SlashCrunchPop · · Score: 1

    Almost as cool as FPGA strip poker.

  59. Cars run faster than people, noone sweats it by tjstork · · Score: 2, Interesting


    Once upon a time, people used to have a thing that brains and brawn were of roughly equal value. Then, in the industrial era, smart people made machines to replace brawn. Now, smarter people are making machines to replace smart people, so, that brawny people won't need smart people any more.

    At the end of the day, we'll all be like John Henry, maybe beating this year's steam shovel and dying for it, but, next year, they will make a better model.

    --
    This is my sig.
  60. What about GNU Tic Tac Toe? by truth_revealed · · Score: 1

    It's IMPOSSIBLE to beat.
    I think the key to winning has something to do with the center square, but I'm not sure.
    Perhaps we'll never know.

    1. Re:What about GNU Tic Tac Toe? by Xrikcus · · Score: 1

      On a 3x3 grid it is impossible to force a win, winning relys on the other player making a mistake. A computer can easily evaluate the entire game tree to a winning move, so it should never make a mistake. I assume it doesn't beat you too often either? :)

    2. Re:What about GNU Tic Tac Toe? by mhayenga · · Score: 1

      wow... sarcasm lost on slashdotters.... who woulda thought... lol

    3. Re:What about GNU Tic Tac Toe? by Xrikcus · · Score: 2, Funny

      Sleepy mood this morning I think ;) At times deleting comments would be nice...

  61. Re:Good chews for Evolution! by Anonymous Coward · · Score: 0

    Chess is only marginally a game, as the RULES very poorly define the (non-losing)LAWS of play. As yet, NO ( n-o) unaided computer abscent human input other than the RULES-of-CHESS has beaten a strong human player. Presumptuous & ignorant hooknosed weenier_dudes-cum-byteboyz may RTFM Nimzowitch & Godel for details.

  62. Go to the source by on · · Score: 1

    Why not visit Deep Blue's homepage?

  63. Bring on the bloat ware by tqft · · Score: 1

    3-D Holographic Clippy?

    If you can think of a good pr0n application, I am sure there is plenty of capital for your application/idea in xxx-land

    --
    The Singularity is closer than you think
    Quant
  64. Make things interesting again by daffmeister · · Score: 1

    Take away the computers opening book. Let's face it, the GM's aren't allowed to have a copy of Modern Chess Openings sitting by their elbow.

    Or if you like, let the computers have a limited repertoire, similar to a GM. So many lines to a certain depth. You could even change it for each tournament based on the opponent.

    This would at least put the emphasis back on calculation and stop the situations where the GM (notably Kasparov in the Deep Blue match) tries a very weak opening move just to get the computer out of book.

  65. It already uses a 64 bit pci bus by nietsch · · Score: 1

    just take a look at the mentioned hardware suppier's site. The only new fact is this guy wrote a chess program for a fpga chip/card.
    fpga's will play a big role for simulating neural networks that do something usefull, playing chess is not.

    --
    This space is intentionally staring blankly at you
  66. Re:Overclocking? by nietsch · · Score: 1

    Brute force decryption uses a 'simple' algoritm and a lot of trial and error. You could gain some speed by implementing your algoritm in hardware, but you'd still be looking at billion's of tries before you have a solution. Remember this card can do only 66MHz, while a good computer can do much more.
    Programming an FPGA is not something an average /. reader can do.

    --
    This space is intentionally staring blankly at you
  67. Diplomacy by alexo · · Score: 2, Interesting

    > My first thought would be Diplomacy, since success in that game is based on communication, deal-making and -breaking, and manipulating others for personal gain.

    Which AI agents already do.

    > There is currently a Diplomacy AI project based on negotiation-free (nopress) play

    You're a bit behind the times.

    When I did my B.Sc. (85-88), there was a computerized Diplomacy game run by Sarit Kraus that included AI agents as well as human players. All negotiantions were done on-line using a formal language that proved to be surprisingly expressive. One did not know who the other players were (or even whether they were human) until the game ended.

    I only participated in one game. At the end, we found out that there were 4 human players and 3 AI agents (playing independently), one of which won the game.

    I believe that Sarit and others made some progress in the 15 or so years that passed since then.

  68. Real Understanding vs. Velocity by DollyTheSheep · · Score: 1

    There was a time, when computer chess was considered as one of the many options to understand(artificial) intelligence better. These ambitions have gone a long time ago, it seems. Humans are beaten by the mere velocity, not by the intelligence of computers.

    In fact, the velocity of the machines may have been counterproductive in development of a real understanding of the game, of its semantic, its sense. Maybe chess computers have meanwhile developed primitive kinds of pattern recognition, but they still rely on (improved) forms of brute force computations, or (in the endgame) on completely computed endings (rook+pawn vs. rook).

    What I would like to see are self-learning algorithms and a "verbal" representation of a strategy ("build up pressure on the queen side by gaining more room", or something like that).

  69. Re:Ah... by BigBadBri · · Score: 1
    And when it gets too good at chess:

    Men at some time are masters of their fates: The fault, dear Brutus, is not in our stars, But in ourselves, that we are underlings.

    Or, reflecting on a loss:

    He reads much; He is a great observer, and he looks Quite through the deeds of men.

    --
    oh brave new world, that has such people in it!
  70. The better the better by m0smithslash · · Score: 2, Insightful

    As an at least average chess player, I feel that the better the computer, the better for me. BTW, by average I mean I win as often as I lose. I usually lose when I play the computer. Yet that is not the only reason, or even the best reason to teach a computer to play chess.

    Even better than playing a computer, is using the computer to analyze the game afterwards. The best way to get better is to learn from your own mistakes and those of your opponents. By having a stong, even grand master level, computer program look over the game you can learn a lot about why you lost or won. Imagine someone who can beat the world champion willing to go over your game with you.

    Humans will always have an advantage over computers until chess becomes "solvable". Until then, there will always be people who can keep the machines on their toes. Also, by giving the rest of us opponents of great skill to play, who are also patient enought to teach, we can all improve our game and improve the general playing level of chess

    --
    Your friend and well-wisher
    m0smithslash
    http://www.ferociousflirting.com
  71. Pooters are good at pattern tecognition though by caveat · · Score: 1

    Correct me if im wrong, but isnt pattern recognition one of the things a computer is really really good at?

    --

    Facts do not cease to exist because they are ignored. - Aldous Huxley
    1. Re:Pooters are good at pattern tecognition though by Anonymous Coward · · Score: 0

      Correct me if im wrong, but isnt pattern recognition one of the things a computer is really really good at?

      You are wrong. Humans are much better at pattern recognition.

  72. humans are better by Trepidity · · Score: 1

    Nope, humans are still much better at that. Computers are better only in the special case where you're recognizing exact patterns -- then a huge lookup table on the computer's part beats human performance. But in more "fuzzy" situations, humans do a much better job. One often-cited example is face recognition -- humans can do it nearly instantly, while computers have a very difficult time of it.

    1. Re:humans are better by mfrank · · Score: 1

      They've recently come up with computers that recognize faces well; they correlate how well the face matches a set of "eigenfaces".

  73. Re:I'm looking for something like this that plays. by mfrank · · Score: 1

    As long as it's not LPGA strip poker :)

  74. Nonsense by exp(pi*sqrt(163)) · · Score: 1
    Computers are better only in the special case where you're recognizing exact patterns
    How did you get away with saying that. Computers can recognize more patterns than just a list and it can recognize many of those patterns much better than a human. Here's a pattern a simple numerical pattern recognizer might spot faster than a human: 1,12,36,80,150,... It's n^3+n^2. There are infinitely many simple polynomial series so it's pretty obvious you can't list 'em all in a table.
    --
    Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
    1. Re:Nonsense by ccp · · Score: 1


      Aren't we all just timed daemons?

  75. Re:Overclock? by thorgil · · Score: 0

    ok... why do I get a -1 overerated mod for this? i can understand the offtopic one but overrated??

    --
    Warning: This sig contains a small bug. ==> *
  76. Profound! by exp(pi*sqrt(163)) · · Score: 1

    Damn! I'm sure I was really close to enlightenment for a moment there. But it's gone now. Ho hum.

    --
    Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
  77. CHESSBASE NEWS by muirhead · · Score: 1
    There's article on CHESSBASE NEWS here with a reciprocal link to this story.

    Whoa that clicky clicky does my head in.

  78. Are there Cores?, what about with more gates? by AndyGasman · · Score: 1

    Has anyone seen any IP cores for chess? couldn't find any on opencores. It'd be great to put these designs on some real kickass hardware, like a Nallatech system, we use a BenNUEY board with 3 BenBLUE2 daughter boards a total of 32000000 gates for our AES stuff