DEEP BLUE man against computer by Barabas Attila

1
(No Transcript)
2
DEEP BLUEman against computer by Barabas
Attila

• University Babes Bolyai, Cluj Napoca,
• Date 11 March 2008

3
Bilbliography

• http//enwikipedia.org/wiki/IBM_Deep_Blue
• http//enwikipedia.org/wiki/Fend_hsiung-hsu
• http//www.research.ibm.com/deepblue/
• http//www.sociumas.lt/Eng/Nr18/memory.asp
• http//chess.about.com/library/weekly/aa05f04.htm
• http/www.chesscenter.com/twic/feng.html

4
ALSO Deep Blue Murray Campbell IBM T.J. Watson
Research Center Yorktown Heights, NY 10598,
USA mcam_at_us.ibm.com A. Joseph Hoane
Jr. Sandbridge Technologies 1 N. Lexington
Avenue White Plains, NY 10601, USA Joe.Hoane_at_Sandb
ridgeTech.com Feng-hsiung Hsu Compaq Computer
Corporation Western Research Laboratory 250
University Avenue Palo Alto, CA 94301,
USA Feng-hsiung.Hsu_at_compaq.com August 1, 2001
5
The worst nightmare of modern computer engineers
is the future where computer based organisms can
probably take over the humans.
All these futuristic movies, sci-fi books dealing
with computer mind incarnation to humans,
machines or robots, has the feeling that the line
of human superiority will soon be attacked by
his own creation.
6
In the mid 90s there were a series of
challenges, mainly two, in which a chess world
champion, Garry Kasparov, played a series of
chess matches against an intelligent chess
playing computer named Deep Blue and developed by
IBM, trying to prove the human minds superiority
over artificial intelligence.
7
A first challenge was in February, 17, 1996 when
G. Kasparov clearly defeated IBMs computer, by a
score of 4-2. Deep Blue was then heavily
upgraded and played Kasparov again in May 1997,
winning the six game rematch.
8
The question is why did they build a chess
playing computer to prove that machines can be
intelligent? In 1950 the computer science
pioneer Alan Turing proposed his famous test.
Sitting in a room there are two keyboards in
front of you, one connected to a computer and one
leads to a person. You type in questions of any
topic you like, and both type back questions that
you read in the computer screens in front of
you. If you cannot determine which was the
machines answer and which the humans, than the
machine has passed the Turing test. But no
computer today can pass the unrestricted Turing
test neither today neither in the approaching
future, so they created restrictions to the test,
such tat the computer could have a fighting
chance.
9
In such modified chess Turing tests, just as in
the original Turing test, the better the
computer, the harder it is to distinguish between
human and machine opponents. In an informal
experiment, Kasparov could occasionally, but not
reliably, guess from recorded games whether
opponents were human or machine. We now know that
we can make computers excel on limited problems,
such as chess, or controlling an oil refinery, or
even complicated medical diagnoses, but we are
very far indeed from creating a computer to pass
an unrestricted Turing test.
10
But even if Deep Blue defeated Kasparov in the
second match we still cannot say that machines
AI has become superior to the human brain.
Humans are slow but exquisitely good at pattern
recognition and strategy and on the other hand
computers are extremely fast and have superb
memories but are annoyingly poor at pattern
recognition and complex strategy. Kasparov can
make roughly two moves per second Deep Blue has
special-purpose hardware that enables it to
calculate nearly a quarter of a billion chess
positions per second.
11

Garry Kasparov At the moment of the
matches Kasparov was the greatest chess player
in the world. USSR Junior Champion at age 13, an
International Grandmaster at 17, and the second
strongest player in the world while still a
teenager (19), Kasparov has consistently
exhibited a genius for chess that belies his age.
In November 1985, at age 22, he became the
youngest World Champion in history by defeating
Anatoly Karpov, and until 1997 he defended his
position.
12
Feng-hsiung Shu was one of the creators of Deep
Blue, he began developing chess playing computers
while he was a doctoral student at Carnegie
Mellon in 1985. The IBM Deep Blue project began
when Hsu and Murray Campbell joined IBM in 1989.
It started as an effort to explore how to use
parallel processing to solve complex computing
problems. The Deep Blue team at IBM saw this
complex problem as a classical research dilemma
of how to develop a chess-playing computer to
test the best chess players in the world.
13
Deep Blue is a massively parallel system
designed for carrying out chess game tree
searches. The system is composed of a 30-node
(30-processor) IBM RS/6000 SP computer and 480
single-chip chess search engines, with 16 chess
chips per SP processor. The SP system consists
of 28 nodes with 120 MHz P2SC processors, and 2
nodes with 135 MHz P2SC processors. The nodes
communicate with each other via a high speed
switch. All nodes have 1GB of RAM, and 4 GB of
disk. During the 1997 match with Kasparov, the
system ran the AIX r 4.2 operating system. The
chess chips in Deep Blue are each capable of
searching 2 to 2.5 million chess positions per
second, and communicate with their host node via
a microchannel bus.

14
Deep Blue is organized in three layers. One of
the SP processors is designated as the master,
and the remainder as workers. The master
searches the top levels of the chess game tree,
and then distributes leaf positions to the
workers for further examination. The workers
carry out a few levels of additional search, and
then distribute their leaf positions to the chess
chips, which search the last few levels of the
tree. Deep blue was the 259th supercomputer
capable of calculating 11,38 gigaflops
15
Although Garry Kasparov and Deep Blue are
considered to be two of the greatest chess
"players" in the world, each has a distinct
manner of playing the game. Both have the ability
to look at a chessboard, analyze positions, then
make the most optimal move. But the way Deep Blue
arrives at the decision to move a particular
piece is very different from Kasparov's method of
analysis. The following is a top ten listing of
the dissimilarities between the way Garry
Kasparov and Deep Blue play chess
16
1. Deep Blue can examine and evaluate up to
200,000,000 chess positions per second, Garry
Kasparov can examine and evaluate up to three
chess positions per second 2. Deep Blue has a
small amount of chess knowledge and an enormous
amount of calculation ability. Garry Kasparov has
a large amount of chess knowledge and a somewhat
smaller amount of calculation ability. 3. Garry
Kasparov uses his tremendous sense of feeling and
intuition to play world champion-calibre
chess. Deep Blue is a machine that is incapable
of feeling or intuition. 4. Deep Blue has
benefitted from the guidance of five IBM research
scientists and one international
grandmaster. Garry Kasparov is guided by his
coach Yuri Dokhoian and by his own driving
passion play the finest chess in the world.
17
5. Garry Kasparov is able to learn and adapt
very quickly from his own successes and
mistakes. Deep Blue, as it stands today, is not a
"learning system." It is therefore not capable of
utilizing artificial intelligence to either learn
from its opponent or "think" about the current
position of the chessboard. 6. Deep Blue can
never forget, be distracted or feel intimidated
by external forces (such as Kasparov's infamous
"stare"). Garry Kasparov is an intense
competitor, but he is still susceptible to human
frailties such as fatigue, boredom and loss of
concentration. 7. Deep Blue is stunningly
effective at solving chess problems, but it is
less "intelligent" than even the stupidest
human. Garry Kasparov is highly intelligent. He
has authored three books, speaks a variety of
languages, is active politically and is a regular
guest speaker at international conferences.
18
8. Any changes in the way Deep Blue plays chess
must be performed by the members of the
development team between games. Garry Kasparov
can alter the way he plays at any time before,
during, and/or after each game. 9. Garry Kasparov
is skilled at evaluating his opponent, sensing
their weaknesses, then taking advantage of those
weaknesses. While Deep Blue is quite adept at
evaluating chess positions, it cannot evaluate
its opponent's weaknesses. 10. Garry Kasparov is
able to determine his next move by selectively
searching through the possible positions.
19
After the loss, Kasparov said that he sometimes
saw deep intelligence and creativity in the
machine's moves, suggesting that during the
second game, human chess players, in violation of
the rules, intervened. IBM denied that it
cheated, saying the only human intervention
occurred between games. The rules provided for
the developers to modify the program between
games, an opportunity they said they used to
shore up weaknesses in the computer's play
revealed during the course of the match. This
allowed the computer to avoid a trap in the final
game that it had fallen for twice before.
Kasparov requested printouts of the machine's log
files but IBM refused, although the company later
published the logs on the Internethttp//www.rese
arch.ibm.com/deepblue/watch/html/c.shtml.
Kasparov demanded a rematch, but IBM declined
and retired Deep Blue.
20
There are record on the Internet about the
cheating charges, mostly about some unusual
moves that a computer would have never
select. There was one well known position where
Kasparov knew a computer would have newer
selected Deep Blues move. Its in game two and
it is shown in the diagram. Kasparov, who is in
serious trouble, expected 37.Qb6. In 'Game Over'
his side claimed that White wins a Pawn or two
and that no machine could resist snatching the
material.
21
Deep Blue continued 37.Be4. The IBM logs show
that Deep Blue calculated.
22
Some say Kasparovs declarations are the ones of
a sore looser, while others are supporting the
conspiration theory. Later Feng-hsiung Shu wrote
in an open letter that IBM gave him the rights to
the Deep Blue chess chip and that he answered
Kasparovs challenge but after two years
Kasparov Was no longer interested.