Slashdot Mirror


Humankind Makes Last Stand Against Machine

MrZeebo writes "According to this Financial Times story, Garry Kasparov has begun another match against a computer chess program on Sunday, this time playing against the Israeli-developed Deep Junior. Kasparov is the highest-rated chess player of all time, and lost to Deep Blue in 1997. According to the article, Deep Junior, despite evaluating less moves per minute than Deep Blue, is considered to be a superior chess player. The match will span 6 games, the last one being February 7th." Kasparov has won the first game.

2 of 401 comments (clear)

  1. Re:When a computer can beat a Go master at Go by outsider007 · · Score: 1, Flamebait

    wrong. go is much more finite than chess. it's 19x19x3x2 (an intersection can be black, white or empty, black or white to move.) and really divide that by four since you can just rotate the board 90 degrees to get the extra variations. once you map the best move for each positions it's game over for humanity.

    --
    If you mod me down the terrorists will have won
  2. Re:When a computer can beat a Go master at Go by CheeseCow · · Score: 0, Flamebait

    What about this, a enormous database with the best moves for every situation. So what if it would be hard to do today. Calculate all the best moves, store them in a database and play along.

    It is just a matter of memory & processing speed.