- Related Stories
-
Chess grandmaster to battle supercomputer
June 21, 2005 -
Photo: Computerized checkmate
May 25, 2005 -
Kasparov, computer to square off
August 8, 2002 -
Kasparov vs. Deep Blue: The moves
May 12, 1997 -
Deep Blue falls to human
February 18, 1996
Adams, the U.K.'s top chess player, lost five out of six games, and only managed a single draw at London's Wembley Centre.
The battle, which ended this week, had been hyped as a clash between human and machine, yet during the games Hydra only used 32 out of the 64 PCs in its cluster. Based in Abu Dhabi, Hydra's PCs are each powered by a 3.06GHz Intel Xeon processor.
Whereas a decade ago
According to the team that developed Hydra, it can calculate 200 million moves per second, and look up to 40 moves ahead. Adams was at a disadvantage, as he was estimate to only be able to calculate 1.4 moves per second, and look up to seven or eight moves in advance.
However, when asked in a Chessbase interview whether Adams thought his battle was conclusive proof of where the power now lies, he responded, "Well, I don't think you can get a conclusive proof after one match. My own impression of Hydra was that it played well, but I am sure we will see more of Hydra's games against other top players."
Tom Espiner of ZDNet UK reported from London.
See more CNET content tagged:
supercomputer,
U.K.,
Intel Xeon,
London,
games




will probably continue to beat computers for
some time into the future. Standard chess is
relatively easy to program. Using the basic
pawn=1, knight=3, bishop=3, rook=5, etc.,
system for evaluating the value of pieces, it
isn't that difficult to teach the computer how to
perform a rough evaluation of the strength of
each side after a combination of moves. Of
course, strong chess programs go far beyond
this basic valuation system in their analysis,
but the point remains that evaluating a board
is relatively easy compared to some other
games. So chess lends itself to "brute force"
programming techniques of simply calculating
every possible combination of moves and
evaluating their outcomes with a relatively
simple board evaluation routine.
But how about a game like the Japanese
game of Go? Here things start to get much
more subtle. Unlike chess, where you can
suddenly lose through the capture of a queen
or king, events proceed much more gradually
and subtly in Go. Furthermore, it requires
some degree of expertise and long-range
vision to evaluate a board position. Unlike
chess, there is no simple pawn=1, knight=3,
etc., evaluation method. Indeed, my father,
who learned Go while stationed in Japan
many years ago, can whip the best Go
computer programs I send to him despite the
fact that he considers himself just an
"average" player. He says that the programs
make a lot of silly strategic mistakes.
- Re: fundamental question of chess...
-
by
July 1, 2005 2:25 PM PDT
- This chess machine may be extremely good,
-
Reply to this comment
-
(4 Comments)but I think it is probably still far from being a
"God-like" machine which is able to play
perfect chess. In a match between this chess
machine and God, I would put my money on
God, even if He plays black and gives the
computer a knight handicap.