chessgames.com
Members · Prefs · Laboratory · Collections · Openings · Endgames · Sacrifices · History · Search Kibitzing · Kibitzer's Café · Chessforums · Tournament Index · Players · Kibitzing

Deep Blue (Computer)
Deep Blue 
Photograph © copyright 1997 IBM.  

Number of games in database: 42
Years covered: 1993 to 1997
Overall record: +16 -10 =16 (57.1%)*
   * Overall winning percentage = (wins+draws/2) / total games.

Repertoire Explorer
Most played openings
B22 Sicilian, Alapin (4 games)
A04 Reti Opening (3 games)
C45 Scotch Game (2 games)
D30 Queen's Gambit Declined (2 games)
B01 Scandinavian (2 games)
A00 Uncommon Opening (2 games)
B47 Sicilian, Taimanov (Bastrikov) Variation (2 games)
A07 King's Indian Attack (2 games)

Search Sacrifice Explorer for Deep Blue (Computer)
Search Google for Deep Blue (Computer)

DEEP BLUE (COMPUTER)
(born 1993) United States of America

[what is this?]

Deep Blue is a chess computer designed and produced by the computer company IBM. Deep Blue's programming code is written in C and runs under the AIX operating system. Its hardware architecture is somewhat based off of that of Chiptest (Computer). It won a game against Garry Kasparov on February 10, 1996, marking the first time a chess computer has ever beaten a reigning world champion under regular time controls. It was then upgraded and played a six-game match against Garry Kasparov in May of 1997. It won 3.5-2.5, marking the first time a chess computer has ever beaten a reigning world champion in a match under standard tournament rules and time controls. Garry Kasparov demanded a rematch which IBM did not accept and IBM retired Deep Blue. Its knowledge was fine-tuned by the Grandmaster Joel Benjamin, its opening book was supplied by Miguel Illescas Cordoba, John Fedorowicz and Nick de Firmian, and Jerry Brodie and Murray Campbell were also part of the IBM team. Randy Moulic and C J Tan managed the team.

https://www.chessprogramming.org/De...

Wikipedia article: Deep Blue (chess computer)

Last updated: 2018-12-03 09:46:49

Try our new games table.

 page 1 of 2; games 1-25 of 42  PGN Download
Game  ResultMoves YearEvent/LocaleOpening
1. Deep Blue vs S L Armentrout ½-½371993New YorkB84 Sicilian, Scheveningen
2. Deep Blue vs S Hamann 0-1481993CopenhagenB93 Sicilian, Najdorf, 6.f4
3. Larsen vs Deep Blue 0-1341993CopenhagenB01 Scandinavian
4. L Schandorff vs Deep Blue ½-½431993CopenhagenE11 Bogo-Indian Defense
5. Larsen vs Deep Blue 1-0431993Larsen-Deep Blue MatchC49 Four Knights
6. Deep Blue vs B Barth Sahl 0-1241993CopenhagenC45 Scotch Game
7. J Kristiansen vs Deep Blue 1-0401993CopenhagenC28 Vienna Game
8. H Danielsen vs Deep Blue 0-1361993CopenhagenA04 Reti Opening
9. B Barth Sahl vs Deep Blue ½-½381993CopenhagenC45 Scotch Game
10. Deep Blue vs J Kristiansen 1-0301993CopenhagenB81 Sicilian, Scheveningen, Keres Attack
11. Deep Blue vs Larsen ½-½591993Larsen-Deep Blue MatchB27 Sicilian
12. Deep Blue vs C Hoi ½-½441993CopenhagenB09 Pirc, Austrian Attack
13. Larsen vs Deep Blue ½-½621993Larsen-Deep Blue MatchB01 Scandinavian
14. L B Hansen vs Deep Blue 0-1521993CopenhagenD37 Queen's Gambit Declined
15. Deep Blue vs Larsen ½-½521993Larsen-Deep Blue MatchB90 Sicilian, Najdorf
16. Deep Blue vs M Rohde 1-0511993The Deep Blue ChallengeB47 Sicilian, Taimanov (Bastrikov) Variation
17. Deep Blue vs J Polgar 1-0731993Rapid MatchB47 Sicilian, Taimanov (Bastrikov) Variation
18. J Polgar vs Deep Blue ½-½611993Rapid MatchA07 King's Indian Attack
19. Deep Blue vs Wchess 1-091199424th NACCCA04 Reti Opening
20. Socrates vs Deep Blue 0-161199424th NACCCB62 Sicilian, Richter-Rauzer
21. M-Chess vs Deep Blue 0-135199424th NACCCB32 Sicilian
22. Deep Blue vs M Illescas ½-½471995Internet Exhibition MatchD10 Queen's Gambit Declined Slav
23. M Illescas vs Deep Blue 1-0261995Internet Exhibition MatchA28 English
24. Deep Blue vs Socrates 1-0511995Hong Kong WCCCD05 Queen's Pawn Game
25. Hitech vs Deep Blue 0-1401995Hong Kong WCCCB22 Sicilian, Alapin
 page 1 of 2; games 1-25 of 42  PGN Download
  REFINE SEARCH:   White wins (1-0) | Black wins (0-1) | Draws (1/2-1/2) | Deep Blue wins | Deep Blue loses  

Kibitzer's Corner
< Earlier Kibitzing  · PAGE 8 OF 10 ·  Later Kibitzing>
May-24-07  Manuel G. Vergara: "Deep blue is as deep as all the deep blue oceans combined" Anonymous.
May-24-07  Knight13: Deep Blue was too shallow in 1996, but it got way too deep in 1997, so I guess the name fits the computer.
Jul-19-07
Premium Chessgames Member
  BishopBerkeley: Has Checkers been SOLVED?

Canadian researchers report they have "solved" checkers, developing a program that cannot lose in a game popular with young and old alike for more than a thousand years.

"The [Chinook] program can achieve at least a draw against any opponent, playing either the black or white pieces," the researchers say in this week's online edition of the journal Science.

Source:

http://news.yahoo.com/s/ap/20070719...

Here's an abstract of the Science article:

http://www.sciencemag.org/cgi/conte...

"The game of checkers has roughly 500 billion billion possible positions (5 x 1020). The task of solving the game, determining the final result in a game with no mistakes made by either player, is daunting. Since 1989, almost continuously, dozens of computers have been working on solving checkers, applying state-of-the-art artificial intelligence techniques to the proving process. This paper announces that checkers is now solved: perfect play by both sides leads to a draw. This is the most challenging popular game to be solved to date, roughly one million times more complex than Connect Four. Artificial intelligence technology has been used to generate strong heuristic-based game-playing programs, such as DEEP BLUE for chess. Solving a game takes this to the next level, by replacing the heuristics with perfection."

The Chinook Checkers Supercomputer which did the work:

http://www.cs.ualberta.ca/~chinook/

While you're there, why not try your hand PLAYING against Chinook?!?

http://www.cs.ualberta.ca/~chinook/...

(: ♗ Bishop Berkeley ♗ :)

Jul-19-07
Premium Chessgames Member
  BishopBerkeley: Scientific American's summary of the claim that Checkers has been SOLVED by computer analysis (and it is a draw when played perfectly by both sides!)

http://www.sciam.com/article.cfm?ar...

=== begin quoted passage ===

July 19, 2007

Computers Solve Checkers—It's a Draw

King me! Top computer scientist proves perfect play leads to draw, recounts battle for world championship, gets kinged

By JR Minkel

Jonathan Schaeffer's quest for the perfect game of checkers has ended. The 50-year-old computer scientist from the University of Alberta in Edmonton left human players in the dust more than a decade ago after a trial by fire against the greatest checkers champion in history.

And now, after putting dozens of computers to work night and day for 18 years—jump, jump, jump—he says he has solved the game—king me!. "The starting position, assuming no side makes a mistake, is a draw," he says.

Schaeffer's proof, described today in Science ... would make checkers the most complex game yet solved by machines, beating out the checker-stacking game Connect Four in difficulty by a factor of a million....

"It's a milestone," says Murray Campbell, a computer scientist at IBM's T. J. Watson Research Center in Hawthorne, N.Y., and co-inventor of the chess program Deep Blue. "He's stretched the state of the art."

Although technological limits prohibit analyzing each of the 500 billion billion possible arrangements that may appear on an eight-by-eight checkerboard, Schaeffer and his team identified moves that guaranteed the game would end in a draw no matter how tough the competition.

Like any complicated mathematical proof, the result will have to withstand scrutiny. But "it's close to 100 percent," says computer scientist Jaap van den Herik of Maastricht University in the Netherlands, who has seen the details. "He has never published anything that was not completely true."

Opening Play: Walking a Precipice

Schaeffer's odyssey began in the late 1980s. He had written a top chess program but IBM was on the verge of pouring its far vaster resources into Deep Blue. "I like to be competitive," he says, so he turned his attention elsewhere. "I naively thought I could solve the game of checkers," he recalls. "You can teach somebody the rules in a minute."

Setting out in 1989 with 16 megabytes of computer memory, he quickly found that checkers, like chess, was too rich with possible positions to dash off a solution. So he switched gears, vowing to topple legendary checkers champion Marion Tinsley, who had lost only three games in tournament play since 1950.

In 1992 Schaeffer's program Chinook took on Tinsley, who had resigned as world champion when the American Checker Federation and English Draughts Association temporarily refused to sanction the man-computer matchup.

Tinsley was so good that his opponents played dull games in the hope of securing at least a draw, according to Schaeffer; Chinook apparently put the magic back in the game for the champ. "It played brash, aggressive moves—it walked on the edge of a precipice," Scheaffer anthropomorphizes. "It would do things people looked at and said, 'Man, is that program crazy?'"

The program actually beat Tinsley twice, but computer glitches led to a forfeit that gave the human a 3–2 lead with two games left in a best-of-40 match. Schaeffer set Chinook on an aggressive course to try to recoup, resulting in another loss for the computer that cost it and its creator the match, Schaeffer recounted in his book One Jump Ahead....

=== end quoted passage ===

[Article concluded here: http://www.sciam.com/article.cfm?ch... ]

Jul-20-07  SatelliteDan: Is there any Rybka vs Rybka games available on line?
Sep-23-07  Whitehat1963: “Saying Deep Blue doesn’t really think about chess is like saying an airplane doesn't really fly because it doesn't flap its wings.”

-- Drew McDermott, Yale

True, or just another <Odd Lie>

Nov-18-07
Premium Chessgames Member
  BishopBerkeley: Vast Optimism about the Future of Humankind (and YOUR Future?!?)

If someone were to predict that 1) nearly all of the serious problems facing Humankind will be solved within the coming century (largely by means of advanced technology), and 2) YOU may be able to extend your lifespan to 200+ years (!!!) -- it would be tempting to dismiss that person as a wild-eyed dreamer.

But if that person had an established and very impressive track record of predicting the future (at least of advanced technology), and that person had actively contributed (in a major way) to the very technology that helped shape that future, it might be interesting to listen.

Such a person is Ray Kurzweil.

Microsoft founder Bill Gates said, "Ray Kurzweil is the best person I know at predicting the future of artificial intelligence. His intriguing new book ["The Singularity is Near"] envisions a future in which information technologies have advanced so far and fast that they enable humanity to transcend it's biological limitations -- transforming our lives in ways we can't yet imagine."

Kurzweil refers to an era he calls "the Singularity" that is fast approaching: "The Singularity is an era in which our intelligence will become increasingly non-biological and trillions of times more powerful than it is today -- the dawning of a new civilization that will enable us to transcend our biological limitations and amplify our creativity."

Here is the website Dr. Kurzweil has established for the book "The Singularity is Near":

http://www.singularity.com/

[continued below...]

Nov-18-07
Premium Chessgames Member
  BishopBerkeley: [continued from above...]

And here is a timeline of many of his future predictions, all the way from the present to the year 2099 (including the prediction that "The concept of 'life expectancy' has become irrelevant to humans and machines thanks to medical immortality...") [Presented at Wikipedia, and subject to all the limitations of that amazing yet not-perfect user-edited resource]:

http://en.wikipedia.org/wiki/Ray_ku...

At the website devoted to his book "Fantastic Voyage: Live Long Enough to Live Forever", we find, "Immortality is within our grasp . . .In 'Fantastic Voyage', high-tech visionary Ray Kurzweil teams up with life-extension expert Terry Grossman, M.D., to consider the awesome benefits to human health and longevity promised by the leading edge of medical science--and what you can do today to take full advantage of these startling advances. Citing extensive research findings that sound as radical as the most speculative science fiction, Kurzweil and Grossman offer a program designed to slow aging and disease processes to such a degree that you should be in good health and good spirits when the more extreme life-extending and life-enhancing technologies-- now in development--become available. This bridge to the future will enable those who dare to make the journey from this century to the next . . . and beyond."

http://www.fantastic-voyage.net/

Their website devoted to health and life extension:

http://www.rayandterry.com/

And here's a bit more about Dr. Kurzweil:

http://www.singularity.com/aboutray...

http://www.kurzweiltech.com/raybio....

http://en.wikipedia.org/wiki/Ray_ku...

Dr. Kurzweil's companies:

http://www.kurzweiltech.com/

Two interesting videos of Dr. Kurzweil:

http://youtube.com/watch?v=IfbOyw3C...

at Stanford University:

http://youtube.com/watch?v=9PWXrnsS...

I would certainly love to believe that Dr. Kurzweil's vision of the future is accurate. However, I am not persuaded by his writing that such a future is ensured or even likely -- but I do believe something like it is *possible* (provided we keep it from taking a distinctly dystopian turn).

Even so, I find it worthwhile (as well as entertaining!) to explore his ideas -- with a mixture of skepticism, enthusiasm, concern, and hope....

[P.S. I am not affiliated with Dr. Kurzweil or any of his companies in any way. I just present these references here since I think many people might find his ideas interesting. (For those who are familiar with the writings of such thinkers as Alfred North Whitehead, Henri Bergson, Fr. Pierre Teilhard de Chardin, Sri Aurobindo Ghosh, Ken Wilbur, and others, it seems to me that Dr. Kurzweil arrives at a similar mystical or quasi-mystical (techno-mystical?) destination to that envisioned by these thinkers, though "up from below" (as it were) instead of "down from above" (as in the case of these other "process" philosophers.) ]

(: ♗ Bishop Berkeley ♗ :)

Dec-12-07  Kaspablanca: Maybe 8x8 checkers is solved, but what about the international checkers version (aka polish checkers)It is on a 10x10 board.
Feb-04-08  norami: Kurzweil thinks he's going to live forever. We're already living forever! What we're experiencing now is a virtual reality movie, or an elaborate video game, or perhaps, as the old song goes, "Life is but a dream."
Feb-05-08  VaselineTopLove: Who made the decision to resign or offer draw from Deep Blue's side? The computer or the GM inputting the moves?
Feb-05-08  MichAdams: The machine operator (not a GM) would make those decisions.
Oct-07-08  whiteshark: Quote of the Day

" I just think we should look at this as a chess match between the world's greatest chess player, and Garry Kasparov. "

-- Lou Gerstner (IBM Chairman)

Good one. :D

Dec-06-08  missing kasparov: deep blue it is all your fault
Feb-12-09  nimh: Smyslov & Deep Blue
http://web.zone.ee/chessanalysis/su...

As expected, the super computer beats everyone else in accuracy. Smyslov, on the other hand, who, according to Kramnik's words "is truth in chess! Smyslov plays correctly, truthfully", doesn't actually impress me...

Mar-15-09
Premium Chessgames Member
  keypusher: A very different perspective on Deep Blue:

http://books.google.com/books?id=dP...

Mar-15-09  WhiteRook48: a rather bad picture
May-16-09  myschkin: This video is made for the purpose to show the public how the IBM company cheated and "won" an unfair match: http://www.youtube.com/watch?v=cK0Y... :)
May-16-09  MaxxLange: oh yeah, this is the game where the Deep Blue team was really gratified that the computer doubled up Rooks on the a-file before it opened. The GMs working with them had observed that the computer missed playing moves like that, and they had been fooling with its eval function to make it give a bonus for that kind of idea.

<In this position Deep Blue played 23. Rec1; this is a very human-like move. My fritz for example doesn't even take it seriously.>

23. Rec1 may be an artifact of that tuning as well...the computer saw that the c file may open?

Teaching a computer "this is good, except when it isn't" must be very hard

Oct-09-09
Premium Chessgames Member
  BishopBerkeley: Wonderful picture from 1974 here:

http://www.chilton-computing.org.uk...

=== begin quoted text ===

IBM 360/195 playing chess, November 1974, probably in the world computer chess championships. MASTER Team, from left: Alex Bell, Peter Kent, John Birmingham, John Waldron (a British chess player)...

No details are offered in the 1974 report; it appears that the machine is playing someone at a remote location, linked by telephone. According to the report, “The only major hardware change made to the IBM System 195 Central Computer during 1974 was the addition in March of a third megabyte of main core. The system has now given consistently high performance for a period of three years and from this experience it is now possible to predict its maximum capability when fully loaded.”

=== end quoted text ===

http://timpanogos.wordpress.com/200...

(: ♗ Bishop Berkeley ♗ :)

Jan-26-10  whiteshark: Quote of the Day

" In the past Grandmasters came to our computer tournaments to laugh. Today they come to watch. Soon they will come to learn. "

-- Monty Newborn (1977)
http://www.cs.mcgill.ca/~newborn/

Feb-14-10  M.D. Wilson: What I find most suspicious is Deep Blue's refusal to submit a urine sample. What was he trying to hide?
Apr-28-10
Premium Chessgames Member
  BishopBerkeley: Ars Technica presents an interesting article titled, " 'Fair use' generates trillions in the US alone":

http://tinyurl.com/297gcuk

or

http://arstechnica.com/tech-policy/...

While I suspect that TRILLIONS is an overestimate, I certainly believe it is greatly in the interest of any economy to have a free flow of information, and such information significantly enhances productivity. Striking that balance between freedom to use information and a strong incentive-structure in which innovation (via copyright, among other things) is rewarded is no small challenge -- and I suspect many of these issues (in the U.S.) will ultimately be thrashed out in the U.S. Supreme Court.

In any case, I suspect that nations and economies that respect openness to a very significant degree will always have economic advantages over those that do not. The limited access to information of nations like North Korea or (to a lesser degree) China will, other things being equal, be a substantial drag on their productivity and economic vitality.

Incidentally, Ars Technica's "Law & Disorder" page for legal matters surrounding technology is often interesting:

http://arstechnica.com/tech-policy/

More about "fair use" and associated copyright issues, courtesy of Wikipedia:

http://en.wikipedia.org/wiki/Fair_use

Hope you are all in good spirits....

(: ♗ Bishop Berkeley ♗ :)

May-11-10
Premium Chessgames Member
  WannaBe: Today, is the day, () that Deep Blue defeated Kasparov, to become the first software to defeat flesh and blood.

http://a.espncdn.com/photo/2010/051...

On a side note, someone named Anand won some game that took place some where in Europe...

Aug-08-10  Oxnard: Anyone into Arcade Fire? A song on their new album called 'Deep Blue' references the Kasparov-Deep Blue match-up in 1996:

http://www.youtube.com/watch?v=l_-p...

Jump to page #   (enter # from 1 to 10)
search thread:   
< Earlier Kibitzing  · PAGE 8 OF 10 ·  Later Kibitzing>

NOTE: Create an account today to post replies and access other powerful features which are available only to registered users. Becoming a member is free, anonymous, and takes less than 1 minute! If you already have a username, then simply login login under your username now to join the discussion.

Please observe our posting guidelines:

  1. No obscene, racist, sexist, or profane language.
  2. No spamming, advertising, duplicate, or gibberish posts.
  3. No vitriolic or systematic personal attacks against other members.
  4. Nothing in violation of United States law.
  5. No cyberstalking or malicious posting of negative or private information (doxing/doxxing) of members.
  6. No trolling.
  7. The use of "sock puppet" accounts to circumvent disciplinary action taken by moderators, create a false impression of consensus or support, or stage conversations, is prohibited.
  8. Do not degrade Chessgames or any of it's staff/volunteers.

Please try to maintain a semblance of civility at all times.

Blow the Whistle

See something that violates our rules? Blow the whistle and inform a moderator.


NOTE: Please keep all discussion on-topic. This forum is for this specific player only. To discuss chess or this site in general, visit the Kibitzer's Café.

Messages posted by Chessgames members do not necessarily represent the views of Chessgames.com, its employees, or sponsors.
All moderator actions taken are ultimately at the sole discretion of the administration.

Spot an error? Please suggest your correction and help us eliminate database mistakes!
Home | About | Login | Logout | F.A.Q. | Profile | Preferences | Premium Membership | Kibitzer's Café | Biographer's Bistro | New Kibitzing | Chessforums | Tournament Index | Player Directory | Notable Games | World Chess Championships | Opening Explorer | Guess the Move | Game Collections | ChessBookie Game | Chessgames Challenge | Store | Privacy Notice | Contact Us

Copyright 2001-2025, Chessgames Services LLC