Jump to content

Talk:Deep Blue (chess computer): Difference between revisions

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
Content deleted Content added
Please Read the book "Behind Deep Blue": What does man vs. machine mean?
Cost?: new section
Line 339: Line 339:
: Someone else could help the computer by telling it which moves to consider and which to ignore. [[User:Bubba73|Bubba73]] <sup>[[User talk:Bubba73|You talkin' to me?]]</sup> 04:20, 21 October 2011 (UTC)
: Someone else could help the computer by telling it which moves to consider and which to ignore. [[User:Bubba73|Bubba73]] <sup>[[User talk:Bubba73|You talkin' to me?]]</sup> 04:20, 21 October 2011 (UTC)
::To Benjamin Pessin: What does man vs. machine mean? All machines and computers are tools of man. The implications for chess are great. Strong chess computers changed the way we learn, analyze and watch chess. I think computers have reached the point where they can see past the human horizon in chess at a key point during the game. At that point, the game turns decisively in the computer’s favor. Ibm may have cheated because deep blue cannot be independently tested, as deep blue does not exist anymore. Garry lost the match because he was an extremely emotional during the match. How do you know IBM attempted a rematch? Garry challenged ibm to a rematch. Ibm refused to play Garry or anyone else. Garry did not accept Hsu’s challenge because Hsu did not have a computer ready to challenge the world champion. A team of computers and humans could beat the world champion or deep blue. Therefore, it is possible to help the computer cheat. --[[User:Mschribr|Mschribr]] ([[User talk:Mschribr|talk]]) 19:18, 26 October 2011 (UTC)
::To Benjamin Pessin: What does man vs. machine mean? All machines and computers are tools of man. The implications for chess are great. Strong chess computers changed the way we learn, analyze and watch chess. I think computers have reached the point where they can see past the human horizon in chess at a key point during the game. At that point, the game turns decisively in the computer’s favor. Ibm may have cheated because deep blue cannot be independently tested, as deep blue does not exist anymore. Garry lost the match because he was an extremely emotional during the match. How do you know IBM attempted a rematch? Garry challenged ibm to a rematch. Ibm refused to play Garry or anyone else. Garry did not accept Hsu’s challenge because Hsu did not have a computer ready to challenge the world champion. A team of computers and humans could beat the world champion or deep blue. Therefore, it is possible to help the computer cheat. --[[User:Mschribr|Mschribr]] ([[User talk:Mschribr|talk]]) 19:18, 26 October 2011 (UTC)

== Cost? ==

How much did it cost? Or, since IBM built it themselves, what would they sell a comparable machine for? As I recall, it was in the $100 million range. That it took such a machine to beat Kasparov is noteworthy. [[User:Don&#39;t Be Evil|Don&#39;t Be Evil]] ([[User talk:Don&#39;t Be Evil|talk]]) 03:22, 11 December 2011 (UTC)

Revision as of 03:22, 11 December 2011

IBM cheats!

The mere fact that IBM would not allow anyone to inspect the logic or the code, then dismantling the machine constitutes a cover up. In short, this is fraudulent gameplay, or cheating. This is akin to the old chess machines where a player would hide in the machine and make the moves. Deep Blue is a load of deep crap. Ask yourself: as a shareholder, would I support a company that spends millions of dollars to create a game that will not be sold, and a system that has absolutely no return on investment? If so, I have some “cloud computing” applications that I would like to sign you up for . . . —Preceding unsigned comment added by 66.41.35.200 (talk) 14:19, 5 January 2010 (UTC)[reply]

     You're insane and this information isn't useful to anybody.

Deep Blue Controversy?

I am some what surprised that the page doesn't address some of the controversial issues that went with the Deep Blue VS Kasparov match. Perhaps it is out of place to mention it on this page. Is there a more appropriate page? I know that it is pure circumstantial, but I don't think it should go completely unnoticed. What do you guys think? Gagueci

Maybe you want to elaborate on what you mean after re-reading the section of the Deep Blue article that discusses the accusations made by Kasparov. I think the issues are addressed in the article even though I think it could be phrased a bit more clearly. In particular, it should be made clear that IBM was not cheating by modifying the program in between (not during) games. This was an accepted part of the match terms. Perhaps Kasparov was silly to have agreed to those terms - but that's the way it is. But what Kasparov was accusing IBM of doing was having some human grand master aiding the computer during the games. He made these accusations because he didn't think it possible for a computer to have come up with some of the more positional moves. IBM was understandably upset by being accused of cheating and I think this made it much less likely that they would be interested in a rematch. And the moves in question are now often suggested by modern chess programs running on much lesser hardware. - Hayne 04:22, 16 June 2006 (UTC)[reply]

Kasparov was not beaten

He won the first match and Blue won the second, 1 - 1. The representatives of Blue declined/withdrew from a another game which would have determined the winner and end the tie. Kasparov would undoubtedly have won the third match considering the second math, "Blue didn't beat Kasparov, Kasparov beat Kasparov". The weight on his shoulders and the propaganda stirring around this machine resulted in a self jinx. Nevertheless, Kasparov was unbeaten.

-G

He neither won nor lost, but it can be said that he did technically succeed over Blue.

Wasn't the machine used in the 1997 match called "Deeper blue" ? --Imran 03:44, 14 Mar 2004 (UTC)

"Deeper Blue" sounds familiar, and Daniel King's book on the match was called Kasparov vs Deeper Blue, but the IBM site calls it Deep Blue throughout, and I guess that can be taken as authoritative. --Camembert

When was Kasparov first beaten ?

Deep Blue - Kasparov, 1996, Game 1 shows Feb.2, 1996 as the date, but it says February 10 on Deep Blue. Can someone confirm this, please ? -- PFHLai 09:28, 2005 Feb 7 (UTC)

According to the Chessbase Megabase 2004 it was the 10th. I'll change the article accordingly. --Camembert
Thanks. I also found the same February 10th date on http://www.uschess.org/results/tnmt/96kdb/game1.html and http://www.queensac.com/deepblueday.html . The event will be featured on the MainPage as a selected anniversary on this date. Thanks, again. -- PFHLai 17:53, 2005 Feb 7 (UTC)

Where are the Deep Blue racks?

The movie Game Over: Kasparov and the Machine notes that one Deep Blue rack is still standing in an IBM computer farm room, doing non-chess work. Today's edit indicates it sits in a museum, not at IBM.

Is the editor wrong, or have events changed since the release of the movie? Spamguy 22:23, August 17, 2005 (UTC)

Dunno. I was also wondering if the IBM rack is still there and the other one is on loan; although I did an online search in the catalogue for where the rack was supposed to be now, and they don't claim to have it at all. They do apparently have one of the chips though.WolfKeeper

The IBM rack is on loan to the Computer History Musuem. See http://www.computerhistory.org/chess/full_record.php?iid=art-43305f13ef377

On the British TV program QI it said that part of Deep Blue was being used by United Airlines handling check in and reservations. Is this just incorrect information being used for comic effect or can anyone back this up? FlamingGoldFish 15:01, 10 May 2007 (UTC)[reply]

How could everyone miss this

right|thumb|300px|Kasparov vs. Deep Blue

Somehow I doubt Deep Blue actually had a Swastika at his table. This look like photoshop to me. If the original author could re-upload the image, that would be great. UnHoly 06:10, 10 February 2006 (UTC)[reply]

Aww but it was waaaay funnier this way. Besides, the computer definitely expressed National Socialist tendencies. nsandwich 10:58, 10 February 2006 (UTC)[reply]
Well, questions of funny or not aside, there's still the issue of tampering with a copyrighted image. How do you change an image thumbnail anyway without changing the original image? Bernhard Bauer 20:19, 10 February 2006 (UTC)[reply]
I didn't change the thumbnail only. I uploaded a new copy of the image. I think it might have just been a problem with reloading the page that made it look like the thumb and the image were different. nsandwich 00:15, 11 February 2006 (UTC)[reply]

game 2? could somebody please write up an article on game 2? --Nerd42 19:06, 10 February 2006 (UTC)[reply]

How many flops (tflops) does deep blue run at

the deep blue that beat "gary kas.."

i would like to know how many flops it runs at

so i can compare it with blue gene

thankyou

Blue Gene is undoubtedly many times more powerful than Deeper Blue. Deeper Blue was not even that impressive of a super computer in 1997, it was merely calculated by IBM to be powerful enough to be more than a worthy challenge to the living chess legend Garry Kasparov, and they were right. Had the most powerful super computer of 1997 had been used, I doubt even Garry Kasparov would have been able to draw a single game. I believe the scientists already knew this, and thus instead of choosing a much more powerful computer they settled with something that would at least give Kasparov a chance, most people prefer to watch close matches rather than complete blowouts, plus close matches give the additional side-benefit of return matches, whereas no one would demand a return match if there were a complete shut-out. Dionyseus 02:07, 16 March 2006 (UTC)[reply]

The notion in the post above, that IBM was "holding back" a more powerful computer from playing Kasparov is nonsense. The integrated circuit processors in Deep Blue were specifically designed to process chess board evaluations as fast as possible, to optimally augment the Deep Blue software. It was a designed and highly optimized piece of computing hardware for this single purpose. Sorry, but any other computer at that time would have been blown off the board by Kasparov.

To answer the original question: how many flops? Well flops are floating-point operations per second, and that only matters for scientific and engineering type calculations with what mathematicians call "real numbers" and is utterly irrelevant to evaluate a chess position. Technically there is no reason Deep Blue would even require a floating-point processor, it could do all calculation with integer math! What you really want to know to answer your question is how fast can it evaluate chess positions versus another machine running the same exact software for position evaluation. Other comparisons are meaningless.

Merge Proposal

There are a lot of stubs for the Deep computers of IBM that were produced before Deep Blue. Since there's not so much to say about any of them, I think it might be better just to assemble a single page of Deep computers. Frobite 01:24, 8 June 2006 (UTC)[reply]

First of all Deep Fritz and Deep Junior have nothing to do with IBM, furthermore Deep Fritz is as related to Deep Junior as the Spanish language is related to Chinese. Second, while it is true that Deep Blue is Deep Thought's successor, they are much too different in my opinion to be merged. So in conclusion my vote is nay on the merge. Dionyseus 04:05, 23 June 2006 (UTC)[reply]
I second the nay on the same grounds. Hardwick 14:03, 27 June 2006 (UTC)[reply]
I agree that it would be a bad idea to merge the "Deep" pages since these are unrelated programs. The "Deep" is just a marketing term used by the other programs to benefit from the fame of Deep Blue. - Hayne 18:02, 27 June 2006 (UTC)[reply]
As per the replies here, I removed the merge proposal. If anyone has any sound arguments for it, post them here. Rbarreira 09:10, 12 July 2006 (UTC)[reply]
It's reasonable to merge the Deep Blue family (Chiptest, Deep Thought, DB1 and DB2). "Deep Fritz" etc. are just marketing terms for unrelated software programs. The strongest chess computer these days is probably Hydra, a software/hardware hybrid. Phr (talk) 17:09, 20 July 2006 (UTC)[reply]
addendum There was also a "junior" version of Deep Blue which may have been called "Deep Blue Junior" (unrelated to "Deep Junior"). Phr (talk) 03:15, 21 July 2006 (UTC)[reply]
  • Support merge of all the Deep Blue family of computers, basically all the ones built by Hsu et al. This does not include unrelated computers some of which had "deep" in their name. Includes existing articles and we should expand the article to include any we missed. There were actually two versions of Deep Thought that were quite different from each other. Hsu's book Behind Deep Blue is the best single reference. Phr (talk) 03:15, 21 July 2006 (UTC)[reply]

Deep Blue Controversy

Although IBM's Deep Blue officially defeated Garry Kasparov in their 1997 confrontation, there is much controversy surrounding that match. Primarily, Kasparov and all of the Chess Community felt that IBM was cheating during their match by having humans intervene in Deep Blue's thought process. It is universally accepted that a human and a computer together is much more powerful a force than a human and a computer individually.

These suspicions were made particularly clear in Game 2 of Deep Blue’s 1997 match with Kasparov. Kasparov forced Deep Blue in to a closed game, during which computers are tend to have the most trouble in. He also offered Deep Blue two pawn sacrifices, which would have given Deep Blue a short-term advantage, with possible consequences in the future. Computers tend to snatch at the free material while paying less attention to king safety. However, alarms went off when Deep Blue did not take the pawns. Instead, it performed a move that was far more representative of former World Champion Karpov. Eventually, Kasparov resigned the game, saying that it was hopeless at the end. He was genuinely suspicious that there was human intervention in that game, due to the fact that Deep Blue made too many "human" moves, and did not play like a computer.

The suspicious raised in Game 2 are not merely the work of conspiracy theorists: when Kasparov resigned the game, he had missed a simple perpetual check, which would have easily drawn the match. Kasparov was horrified when he realized this, and the Chess Community was deeply concerned: how could a computer play so well, but miss something as basic as a perpetual check? This is unfathomable to think about.

Kasparov and the rest of the Chess Community were seriously suspecting human intervention in Game 2 due to this fact. It is very possible that there was a relatively strong human (not necessarily a grandmaster) watching the screen, and Deep Blue needed permission from this person to make a move. If the human noted that Deep Blue's contemplated move would place its king in danger, the human would drop the main log, and revert to the second-best, safer move. It is effectively impossible for a computer, especially one like Deep Blue, to miss a perpetual check, like Deep Blue did in Game 2. However, it is rather plausible that a human might, especially when playing under pressure (as was Kasparov).

In fact, there is much evidence of unethical behaviour and human intervention during the match. During one of the games, Deep Blue crashed, and IBM mechanics were sent over to repair it. In all fairness, this should have resulted in a resignation by Deep Blue and a victory by Kasparov. However, being the good sport that he is, Kasparov merely chuckled and started chatting merrily with his mother, when the referee of the game shot him down and stated that he was not to communicate with anyone. "Why not?", replied Kasparov, "they're talking to their guy all the time!". He was referring to the IBM mechanics, who were, indeed, constantly modifying Deep Blue, during and in between matches.

There is much more evidence of unethical behaviour on the behalf of IBM: they had promised to release Deep Blue's main logs for all the games after the match had been completed, but they backed out on that deal. When Kasparov defeated Deep Blue by a considerable margin in 1996, he agreed to a re-match. However, when Deep Blue defeated him in the 1997 rematch, IBM refused another showdown, so Kasparov could never redeem himself. Finally, IBM was indeed modifying Deep Blue in between the matches, and playing with Kasparov’s mind in the process: Deep Blue effectively gave Game 1 to Kasparov, furthering the mental implications that Kasparov’s Game 2 defeat had on him.

Kasparov's loss in Game 2 was effectively a loss of the entire match. Chess is famous for psychological warfare between players, but one can obviously not conduct such warfare against a computer. Kasparov collapsed psychologically: Games 3, 4 and 5 were drawn partially due to the fact that Kasparov could not recover after Game 2: he was constantly thinking "something is up here", and he could not quite place his finger on it. IBM furthered Kasparov's suspicious and deliberately fed his paranoia: they were playing with his mind. In the end, Kasparov simply wanted to end the match: he gave Deep Blue the 6th and final game, without even putting up a fight.

Furthermore, chess matches are seldom executed without both players conducting extensive research on their opponent, including their strongest / weakest openings, play style, etc. Deep Blue had a myriad of information on Kasparov (of course: it was built for the sole purpose of defeating him), but Kasparov was not given any information whatsoever about Deep Blue before the match. This would be incredible barrier facing players at the Grandmaster Level: one can not expect a fair match when one player knows everything about his opponent, while the other knows nothing at all.

However, any Chess player could tell that Kasparov was a stronger player than Deep Blue: Kasparov played an emotional game against something with no emotions, and the vast controversy surrounding the matches, as well as IBM's unethical toying with Kasparov's mind, had detrimental effects on Kasparov's game. Perhaps this is why IBM refused another rematch to serve as a tiebreaker: now that Kasparov knew what he was up against, a greedy corporation playing a death-match against him rather than the friendly experiment they had originally claimed that it was, he may have been able to sufficiently prepare himself once he was prepared for all the psychological tricks and had reviewed its past games. In the end, it was not Deep Blue that defeated Kasparov: Kasparov was defeated by his own emotions in the face of unethical play. —Preceding unsigned comment added by Uchiha sasha (talkcontribs)

The perpetual check in game 2 is quite hard to spot and plenty of grandmasters kibitzing the game missed it too. Kasparov himself never figured it out, even after the game--he didn't realize it until someone told him, and then he was shock. (Of course he must not have been thinking about it much, once the game was over).
Computers don't spot the perpetual so easily either (try feeding the position into Fritz or something like that). Humans did not intervene in Deep Blue's thought process while any game was being played. They did intervene between games, improving the software based on what had happened in the previous games, but they were allowed to do that as agreed upon in the match conditions. Have you read Hsu's book? It discusses what they did in great detail. Phr (talk) 08:11, 30 July 2006 (UTC)[reply]
The above comments by user Sasha seem to be identical to those posted on Talk:Game_Over:_Kasparov_and_the_Machine where I have responded to a few of the more egregious accusations. - Hayne 01:13, 1 August 2006 (UTC)[reply]


How many positions per second?

The text currently says: "It was capable of evaluating 200,000,000 positions per second". Does this include positions that were alpha-beta pruned or hits off a transposition table? Or is it just plain raw position evaluation? Warthog32 18:41, 13 December 2006 (UTC)[reply]

Sources

While there are some sources listed on the bottom of the page there are no citations within the text. I'll try to find and tag sources for the information but in the meantime I added the unreferenced tag. Martin 01:23, 25 January 2007 (UTC)[reply]

Article Title

Since the computer was called "Deep Blue" not "IBM Deep Blue",[1] shouldn't the article title be something like "Deep Blue (chess computer)"? Peter Ballard (talk) 03:07, 16 January 2008 (UTC)[reply]

Well I found a clearly labelled path to the article that made it clear what it was. So it all stops? Beat the Russian and then stop. Like the Moon Race again-why not push on to greater and greater complexity and speeds and we might get a machine that really thinks for itself. Bravo Gary K for putting your reputation on the line, well intact I say... —Preceding unsigned comment added by 82.10.205.159 (talk) 18:24, 16 January 2008 (UTC)[reply]

I agree with the name change. Bubba73 (talk), 19:28, 16 January 2008 (UTC)[reply]

Just like Deep Thought (chess computer), but in slight contrast to Hydra (chess). Bubba73 (talk), 21:08, 16 January 2008 (UTC)[reply]

Well that's 2 in favour (me and Bubba73, who offered a good precedent) and no one against after 12 days. So I've done the rename. Peter Ballard (talk) 11:45, 28 January 2008 (UTC)[reply]
OK. There are quite a few articles that link to the old title. Is there an easy way to update those, with AWB? Bubba73 (talk), 14:03, 28 January 2008 (UTC)[reply]

copy-paste from "ply"

There is some identical text here and on Ply_(game_theory), regarding the ELO increase per additional ply. I think this goes a bit too far into details which really better belong there than here. If someone else can confirm this feeling, I encourage him to cut it down a little, providing a link to Ply_(game_theory). — MFH:Talk 14:33, 15 February 2008 (UTC)[reply]

I think something about increasing plies and strength should go in this article. Of course the best places for it are in Ply and computer chess. I think it should at least be mentioned in this article, but perhaps it can be trimmed a little in this article. At a minimum I think that this article should say that increasing the number of plies searched significantly increases the playing strength. Bubba73 (talk), 19:51, 15 February 2008 (UTC)[reply]

Deep blue dismantled a tragedy

I added 3 points to the deep blue article.

1) It was a tragic loss for the chess community that ibm did not allow deep blue to continue playing chess.

2) Deep blue played 6 games. To get an accurate rating it should play at least 20 games with more then one player. We can not say with certainty how strong deep blue was. The claim that Deep Blue was the best can not be substantiated.

3) Many people have speculated why ibm dismantled deep blue. Some have said to hide the reality that deep blue was not playing at the world champion level. Did Hsu or ibm give a reason why deep blue was dismantled? Mschribr (talk) 15:30, 31 July 2008 (UTC)[reply]

(1) is opinion that needs to be removed. (2) is correct. (3) is disputed - the story is different depending on whether you ask Kasparov or the IBM team, so both sides should be presented. Peter Ballard (talk) 01:23, 1 August 2008 (UTC)[reply]
(1) Can be broken into 2 parts.
(1A) Deep blue was dismantled. The article says deep blue was retired. Retired sounds like someone is old, put in many years of service and now wants to relax. Deep blue was 1 year old and played 6 games and then stops playing. Deep blue has an on and off switch, its doesn’t get tired. It could have easily played more matches. I will state that it was dismantled and never again played against a strong player.
(1B) Instead of saying a tragic loss I will explain with 2 reasons. First Deep blue beat the world chess champion so deep blue is the strongest chess player. Deep blue could have helped grandmasters prepare for world champion chess tournaments. Today strong grandmasters routinely use strong chess programs to analyze chess games in preparation for world champion tournaments.
Second Deep blue achieved the 30 year goal of computer scientists, create a computer to beat the world chess champion. The goal is finally researched. Then Ibm destroys deep blue. Computer scientists were disappointed. There is a New York Times article, January 21, 2003, which says this. See query.nytimes.com/gst/fullpage.html?res=9C02E5DB1230F932A15752C0A9659C8B63&sec=&spon=&pagewanted=2
To (3) I can add ibm’s and hsu’s reasons why deep blue was dismantled. Ibm gave the reason deep blue stopped playing because the deep blue team moved on to other projects.
Hsu explains in his book what happened to deep blue. He says “Its death however was exaggerated.” Hsu continues with what deep blue is doing. “Deep blue is alive and kicking in ibm research.” The 1997 deep blue has half of its original chess cards. The deep blue rs/6000 is used as a web site to play 1000 players simultaneously. It uses a single deep blue chess chip and plays at uscf rating of 2000.
Hsu says deep blue is still with us today. It is obvious the deep blue that played the world champion does not exist. Mschribr (talk) 17:29, 1 August 2008 (UTC)[reply]

This question refers to (2). The article says

Due to an insufficient sample of games between Deep Blue and FIDE-rated chess players, a chess rating for Deep Blue was not established.

Why does it say FIDE-rated chess players? If deep blue played a sufficient number of games in any rating system, such as the USCF, then deep blue would get a rating. Mschribr (talk) 10:04, 27 August 2008 (UTC)[reply]

Modern chess programs play more like a human then deep blue

Clarified that the current top programs play smarter and more like a human than deep blue by looking at fewer moves and more moves ahead. They are able to discard more moves than deep blue and therefore play more like a human. Mschribr (talk) 20:44, 31 July 2008 (UTC)[reply]

You may be right, but it needs a citation or it will need to be removed. Peter Ballard (talk) 01:22, 1 August 2008 (UTC)[reply]
I am not really adding anything new. I am just emphasizing what Wikipedia said. The article says Deep blue looks at 200 million positions per second and 12 plies ahead. Fritz looks at only 8 million positions per second and 18 plies. While a human world champion looks at much less than 1 million position per second and 25 moves ahead. So fritz plays closer to a human world champion than deep blue. Maybe I did not explain it well. It is obvious to me. I could add the part about what a world chess champion looks at. Mschribr (talk) 17:41, 1 August 2008 (UTC)[reply]
According to Feng-Hsiung Hsu's book Behind Deep Blue, Deep Blue performed about a 21-ply deep search on main lines, and over 30-ply deep searches on interesting lines. So while Deep Blue did indeed search many more positions per second, it reportedly looked ahead more plies than what you have listed for Deep Fritz and humans, and did so selectively.
Also according to the book, prior to the 1997 rematch with Kasparov, a single chess chip version of Deep Blue that ran at a slower clock speed, nicknamed "Pico" Deep Blue Jr., was tested against two top PC chess programs that were commercially available. The search speeds of "Pico" Deep Blue Jr. and the PC programs were approximately the same. "Pico" Deep Blue Jr. won all of its games, indicating that the evaluation function of Deep Blue did perform better than other commercial programs at the time. Isaac Lin (talk) 18:00, 4 August 2008 (UTC)[reply]
I don’t where you’re getting the 21 ply and 30 ply deep searches? Is it from page 229 in the 1997 match in game 2 on move 36? Hsu says “The main line was really at least 21-ply deep and maybe well over 30-ply deep, since there were additional search extensions on the workstations and the chips.” This statement may be for this particular move and not the average depth of deep blue. These numbers “at least 21-ply deep and maybe well over 30-ply deep” are not clear what they refer to. Words like “really at least” and “maybe well over” sound like guesses, not observations of deep blue's actual performance. Are they full width or singular extension? Are they a range or averages? We cannot say from this sentence what the average look ahead is for deep blue.
I referred to 12 plies that already existed in the wikipedia article. I looked through Hsu’s book and the ibm website. I did not find any mention of the average depth of deep blue.
These pico tournaments were discussed at length on the computer chess forums. These are fantastic claims made in Hsu’s book. All he says is pico deep blue jr. played the top commercial programs and won 10-0. We have no more information. There were no independent witnesses. Which top programs? Were they were blitz or standard time? What opening book was used? What computer hardware was used? What were the program parameters? All of these things if not properly set can affect the outcome. These tournaments results 10-0 cannot be repeated since we don’t have access to pico. We don’t even have the games. What happened to the games? What programs did he play? Why doesn’t he say which programs? There is nothing to substantiate the claims except Hsu’s word. The claims cannot be used as an indication for anything about deep blue. Mschribr (talk) 17:31, 5 August 2008 (UTC)[reply]
I apologize for misreading the statement regarding the 21-ply deep search; it did refer to the specific move under analysis. The key misgiving I have with your changes is that they imply that previous generations of computer chess programs relied solely on brute search and did not attempt to, as you wrote, "play more like a human" by determining which lines of play to investigate more fully. From what I have read, identifying and investigating further into fruitful lines of play has been done for a long time, and was indeed part of Deep Blue's program. I prefer the previous version which discussed the greater efficiency of newer programs (something necessary to achieve comparable results with a slower search speed). I suggest changing the last two paragraphs in the "Future" section to the following (and renaming the section to "After the 1997 match"):
IBM's decision to stop pursuing advanced chess computer research unfortunately prevented a full assessment of Deep Blue's chess rating, as Deep Blue did not participate in any sanctioned chess tournaments.
Deep Blue, with its capability of evaluating 200 million positions per second, was the fastest chess computer to face a world chess champion up to 1997. As of 2008, the latest computer chess research is typically performed with entirely software-based programs, rather than using dedicated hardware. Chess programs such as Rybka, Deep Fritz, and Deep Junior compensate for their slower search speed by improving further on the logic used by previous programs, allowing them to be more efficient at finding the most fruitful lines of play and investigating them at greater length. In a match between Deep Fritz and Vladimir Kramnik in November, 2006, the program ran on a personal computer containing two Intel Core 2 Duo CPUs, capable of evaluating 8 million positions per second, yet searching to an average depth of 17 to 18 plies in the middlegame.
Isaac Lin (talk) 00:47, 6 August 2008 (UTC)[reply]
The claim that modern programs "play more like a human" is incorrect. No strong computer programs play anything like a human at all. No human examines 8 million positions a second or searches 17 plies deep. I fixed the section a little bit but it needs cites and possibly should just be taken out. That computer programs are stronger today than they were 10 years ago is not a surprise. 165.189.91.148 (talk) 15:25, 6 August 2008 (UTC)[reply]
It did not say a human looks at 8 million positions. And humans do look at 17 plies deep and even more deeply. The claim was that the current top programs play more like a human than compared to deep blue is correct. The claim was not that the current top programs play like a human. The proof is when you compare the numbers of moves looked ahead and the number of positions looked at for the top programs, deep blue and the world champion. The numbers for the top programs are closer to the world champion then for deep blue. Both humans and computers evaluate positions and look moves ahead. How they evaluate positions is different. Do you see the difference? Mschribr (talk) 17:40, 6 August 2008 (UTC)[reply]
To Isaac Lin: Your sentence “IBM's decision … chess tournaments” doesn’t have all the details of the second paragraph. You can add your sentence to the 2nd paragraph. I rewrote the 3rd paragraph below. I do not use deep blue as a representative of chess computers from its time. I do not say that deep blue did not prune. But others did pruning better. I say that deep blue’s success was from it executing its program fast. I do not like the word efficiency here. It suggests deep blue and programs like Rybka do the same thing or achieve the same results. They are different. Brute force programs are simpler. Rybka is more selective search more like a human and therefore smarter. You can change the title to after 1997. If there are 2 ways to do sometime, 1 way with brute force and a 2nd way with selective search and everything else is equal such as the results. Then the selective search is smarter than the brute force way because that is how a human would do it.
Deep Blue was the fastest computer to play a world chess champion by evaluating 200 million positions per second. The great speed allowed Deep Blue to look further ahead faster and therefore play better. Software chess programs have traditionally tried to look further ahead faster by pruning away moves from each position. Discarding more moves is similar to why a world chess champion plays better than a master. Strong chess programs like Rybka, Deep Fritz or Deep Junior have refined this process even further. They look at fewer moves per second but more moves ahead than Deep Blue. In this respect they play smarter and closer to a human world champion than Deep Blue. In a recent match, Deep Fritz vs. Vladimir Kramnik in November 2006, the program ran on a personal computer containing two Intel Core 2 Duo CPUs, capable of evaluating only 8 million positions per second, but searching to an average depth of 17 to 18 plies in the middlegame. Mschribr (talk) 03:17, 7 August 2008 (UTC)[reply]
Yes, my proposal for the second paragraph omits the parts that, as Peter said, lack references. As several commenters in this thread are not in agreement with your proposed wording that compares the play of chess programs to humans, I believe that the text should not be modified to include this comparison. Without any references that compare Deep Blue with other programs, I believe that no direct comparisons should be made and only a general description be included of the current state-of-the-art with respect to chess programs. Here is another proposal for changes to the third paragraph (my proposal for the second paragraph remains the same):
Deep Blue, with its capability of evaluating 200 million positions per second, was the fastest chess computer to face a world chess champion up to 1997. Software-based programs that do not use dedicated hardware, such as Rybka, Deep Fritz, and Deep Junior, compensate for their slower search speed with improvements in their logic that makes them more effective in finding the most fruitful lines of play and investigating these options at greater length. In a match between Deep Fritz and Vladimir Kramnik in November, 2006, the program ran on a personal computer containing two Intel Core 2 Duo CPUs, capable of evaluating 8 million positions per second, yet searching to an average depth of 17 to 18 plies in the middlegame.
I would appreciate the comments of other editors on this proposal in order to arrive at a consensus position. Isaac Lin (talk) 04:23, 7 August 2008 (UTC)[reply]
Sorry, but I still don't like it, for two reasons. First, the claim "compensate for their slower search speed with improvements in their logic..." is uncited. Second, even if and when we can find the claim properly cited, detail on later chess engines is unrelated to the Deep Blue (chess computer) article - it more properly belongs in the general article Computer chess. Peter Ballard (talk) 04:53, 7 August 2008 (UTC)[reply]
OK, then if I understand correctly, you would agree with dropping the third paragraph entirely? Regarding my proposed second paragraph, perhaps instead the paragraph can also be dropped, and the proposed sentence be placed in the previous section, immediately after "...IBM declined and retired Deep Blue." (This would fit better with the new section title, "After the 1997 match".) Isaac Lin (talk) 05:21, 7 August 2008 (UTC)[reply]
On further reflection, I would drop the section heading, and move the one remaining paragraph before the one starting with "In 2003...". I also suggest changing this sentence to be "In 2003 a documentary film was made about the match, titled Game Over: Kasparov and the Machine." (I've never seen the film so I'm not sure if the next sentence is an accurate portrayal, but of course any company's funding of a project for publicity purposes is motivated by a desire to ultimately improve the company's finances, including its stock price — there's nothing particularly devious or notable about that.) Isaac Lin (talk) 05:31, 7 August 2008 (UTC)[reply]
It is useful to compare deep blue to other chess computers. We can understand where deep blue fits in history of chess computers. When we compare deep blue to others chess computers we understand why it was successful in beating other chess programs. Then we can understand why deep blue was able to beat the world champion while other chess computers were 2 ranks lower.
The sentence by Isaac Lin “Software-based programs that do not use dedicated hardware, such as Rybka, Deep Fritz, and Deep Junior, compensate for their slower search speed with improvements in their logic that makes them more effective in finding the most fruitful lines of play and investigating these options at greater length” is proven by how far they look ahead. Deep blue looks at 200 million positions per second and looks ahead 12 moves deep while deep fritz looks 8 million positions per second and looks ahead 17 moves deep. The computer that looks more moves ahead plays better. I was saying something similar except I was explaining what “improvements in their logic” meant. It means pruning away inferior moves faster.
I think 2 points from the second paragraph should be kept. The dismantling of deep blue means the chess community could not use it for game analysis and tournament preparation. We don’t know if deep blue played at the world champion level because it played to few games to get a rating. I guess speculation does not belong. We can change tragic loss to loss.
The deep blue project was not then and is not today considered by IBM as a publicity project. It was research project to show that computers can solve very hard problems. Problems like building a computer that plays chess better than the world chess champion. Mschribr (talk) 20:50, 7 August 2008 (UTC)[reply]
Though of course pure research can always add to our knowledge, according to Behind Deep Blue, IBM hired the Deep Thought team to allow it to pursue its goal of playing and defeating the world chess champion. The company was obviously fully aware of the large amount of publicity it would receive through matches against Kasparov. Hsu wrote about needing to be successful at tournaments in order for the project to continue, and how IBM's communication department influenced the name under which their program competed, for marketing purposes. Once the goal of defeating the world chess champion had been completed, IBM stopped further computer chess research. The San Francisco Chronicle article referenced in the section "QI" is one example of how sponsoring Deep Blue gave IBM greater exposure for its RS/6000 SP supercomputer line.
Although numbers alone do not necessarily indicate a consensus, there are three editors who appear to be amenable to having the third paragraph in the section deleted. I believe this is probably the most prudent action. Isaac Lin (talk) 23:31, 7 August 2008 (UTC)[reply]
Give us a source ibm created deep blue for publicity. The reason Hsu needed to be successful at tournaments was to verify his method was moving in the right direction. If he was unsuccessful at tournaments then maybe his assumptions were wrong and he would have to backtrack. IBM's communication department ran a contest to pick a name that would not infringe on someone else’s trademark. Hsu does not say anything about marketing purposes. Ibm stopped chess research because the goal was reached and the team moved on to other projects.
I found a source that show deep blue was more brute force while current top programs are more selective search and closer to how a human plays. See wikipedia article computer chess. In section 2 Brute force versus selective search, the last 3 paragraphs. Mschribr (talk) 19:39, 8 August 2008 (UTC)[reply]

(restarting discussion without indents) From what I can see, the most prudent approach to accommodate the concerns regarding the appropriateness of the text under discussion is to merge the content of the first two paragraphs of the section titled "Future" with the previous section, and to delete the third paragraph, perhaps adding a cross-reference to the article on computer chess for further information:

If the most interested parties are amenable to this approach, I can make the corresponding changes, in accordance with the outline I gave previously. Isaac Lin (talk) 23:52, 10 August 2008 (UTC)[reply]

We should keep the history and future sections, as they are useful to show 2 distinct aspects of deep blue. The history section contains information leading up to deep blue’s success, the 97 match. The future section contains information subsequent to deep blue’s success. Therefore the documentary and the rack disposition should be moved to the future section. The 3rd paragraph should remain because it contains information specific to deep blue. Such as how deep blue compares to subsequent successful chess computers?
I will remove the word tragic. I will change retired deep blue to the more accurate wording dismantled deep blue. I will add the other members of the deep blue team. I will remove the naming of Deep Thought, as it is 1) unrelated to deep blue and 2) not 100% accurate. Hsu did not say the Deep Thought was named after the computer in hitchhiker’s guide to the galaxy. Deep Thought was named after the method singular extensions used by Deep Thought. Singular extensions allowed Deep Thought to analyze more deeply a position. After using the name Deep Thought Hsu realized a computer that could defeat the world champion is worthy of the name Deep Thought used in hitchhiker’s guide. Mschribr (talk) 14:44, 11 August 2008 (UTC)[reply]
Since we are discussing appropriate changes to make to the article, please refrain from making edits. It is harder for us to discuss the article if it is continually changing.
There are two issues with comparing Deep Blue to other computers, as raised by Peter. I agree with Peter that comparisons to later computers can be handled in Computer chess and, to avoid duplication, this article can refer to it.
I believe you may be misunderstanding the rhetorical technique used by Hsu in Behind Deep Blue to describe the origin of the name of Deep Thought. Hsu had listened to the Hitchhiker's Guide to the Galaxy radio series in Taiwan and read the books when in the United States, so his naming of the Deep Thought chess computer was indeed based on the name which he had heard and read about in Douglas Adams's works. Isaac Lin (talk) 22:00, 11 August 2008 (UTC)[reply]
Sorry about making the change before discussing it. Which of my changes do you want to undo? Did peter say that it is not cited? I gave a citation. Did Peter say it belongs in the general article Computer chess? I explained it compares a specific chess computer, deep blue, to subsequent successful chess computers. So it belongs in a specific chess computer, deep blue, article and not in the general article Computer chess. Do you want to put back the reason for naming deep thought in the deep blue article? Yes, hsu did listen to Hitchhiker's Guide before naming deep thought. But he said the name was appropriate for the chess computer. He did not say the chess computer was named for fictional computer. The name deep thought refers to the technique, singular extensions, that made deep thought successful. Mschribr (talk) 23:28, 11 August 2008 (UTC)[reply]
Hsu did not say in his book that Deep Thought referred to singular extensions. He employed an artistic writing technique to say that he named Deep Thought based on his listening to and reading of Douglas Adams's series. Isaac Lin (talk) 23:45, 11 August 2008 (UTC)[reply]
Do you want to put back the reason for naming deep thought in the deep blue article? If not then it becomes academic. We can discuss it in the deep thought article and not in the deep blue article. Mschribr (talk) 09:28, 12 August 2008 (UTC)[reply]

Unfortunately, we do not seem to have quorum to reach a consensus on revisions. In accordance with Wikipedia:Verifiability, I plan to revert the changes made on July 31, 2008:

http://en.wikipedia.org/w/index.php?title=Deep_Blue_%28chess_computer%29&diff=229211038&oldid=228705543

I wish that a compromise could have been reached, but since no progress is being made, it is inappropriate to keep this unsourced information that has been challenged in this discussion thread. I also plan to restore the background on the name, "Deep Thought". Isaac Lin (talk) 21:52, 13 August 2008 (UTC)[reply]

Some of those changes were already removed We do have consensus on the remaining changes. Peter agreed with the following statements. No one else has challenged the following statements.
Deep Blue played 6 games. To get an accurate rating it needed to play at least 20 games with more than one player. The chess playing strength of Deep Blue is uncertain. The claim that Deep Blue was the best cannot be substantiated.
The wikipedia rules also say, “In essence, silence implies consent, if there is adequate exposure to the community.”
Your point about naming deep thought is wrong because there is no source and it is inappropriate in the deep blue article. Mschribr (talk) 16:09, 15 August 2008 (UTC)[reply]
Following the Wikipedia:BOLD, revert, discuss cycle, it is appropriate to revert changes that do not have a reliable source and are challenged. If you wish to restore any part of your edits, please discuss them on this talk page and obtain consensus. Isaac Lin (talk) 17:45, 15 August 2008 (UTC)[reply]
Even if deep blue played in tournaments then it might not have a rating. For example if it played in 3 tournaments and each tournament had 6 rounds then it would have 18 games. It needs 20 games to get a rating. If it had played no tournaments but 20 exhibition games with rated players then it would have a rating. I will change the statement. Mschribr (talk) 21:42, 19 August 2008 (UTC)[reply]

QI

I've just been watching this episode of QI mentioned in the article and I'm not sure Stephen Fry was actually joking, he seemed to be saying UA actually do use a part of Deep Blue in their system. Someone might want to check and see if UA actually do use a bit of Deep Blue and replace this reference. —Preceding unsigned comment added by Jackster (talkcontribs) 23:12, 4 August 2008 (UTC)[reply]

Reference on this here... [2] —Preceding unsigned comment added by 78.86.240.103 (talk) 23:25, 4 August 2008 (UTC)[reply]

I imagine that United Airlines purchased an IBM RS/6000 SP supercomputer, not Deep Blue itself. The custom chess chips after all are customized for evaluating chess positions and so would not be of use for anything else, plus according to Behind Deep Blue, as of the writing of the book in 2002, the actual RS/6000 SP frame remains in operation at IBM Research, and IBM continues to own all of the chess cards. Isaac Lin (talk) 01:13, 5 August 2008 (UTC)[reply]
Yikes. I know that the reference above is the San Francisco Chronicle, which should be a WP:Reliable Source, but in this case they must have got their facts wrong. I agree with Isaac, Deep Blue would be no good for any other application, it was customised hardware. Peter Ballard (talk) 01:27, 5 August 2008 (UTC)[reply]

Confusing

Maybe it's too early in the morning, but I can't understand what this passage means. Is Wchess a person? a program? "In round 5 it had white" What does that mean??

"It played Wchess to a draw while Wchess was running on a personal computer. In round 5 it had white and lost to Fritz in 39 moves while Fritz was running on PC. In the end it was tied for 2nd place with Junior while Junior was running on PC.[9]"

Why didn’t a Wikipedia bot automatically add a date and time? Next time sign and date your comments and questions.
Here is a hint. Wchess was running on a personal computer. You asked “In round 5 it had white" What does that mean??” Well what could that mean? Maybe it means deep blue played chess in round 5 and moved first. Mschribr (talk) 14:36, 3 November 2008 (UTC)[reply]
I think the tone of this response is too harsh. Wchess is insufficiently introduced and causes that sentence to e confusing on the first read. Also, there could easily be people reading this with interest toward the computer and AI without knowledge of what it means for someone to "have white". 24.21.10.30 (talk) 22:00, 10 February 2009 (UTC)[reply]

size of th machine??????

Why is he image with no reference to size. This should be a policy on wiki... Every photo should have a scale and some coins (or other larger common objects) so that we can get an idea of the size. Please load another image. 76.112.206.81 (talk) 13:23, 21 March 2009 (UTC)[reply]

The 'racks' that made up the machine appear to be standard 19-inch relay racks. These are typically about 6 feet tall. So that should define the size pretty clearly. T-bonham (talk) 12:10, 10 February 2010 (UTC)[reply]

How many components, how much parallelism?

Is it just me, or does this sentence somehow not quite make sense?

"It was a massively parallel, RS/6000 SP Thin P2SC-based system with 30-nodes, with each node containing a 120 MHz P2SC microprocessor for a total of 30, enhanced with 480 special purpose VLSI chess chips." (taken from Section 2, "Deep Blue versus Kasparov").

First of all, the hyphen in "30-nodes" is probably a typo (right?), and second, the logic leading up to "for a total of 30" doesn't seem to work. Or am I missing something here?

Ah, but wait... I think I've found the original source, here: [3]. This contains very different numbers: "The latest iteration of the Deep Blue computer is a 32-node IBM RS/6000 SP high-performance computer, which utilizes the new Power Two Super Chip processors (P2SC). Each node of the SP employs a single microchannel card containing 8 dedicated VLSI chess processors, for a total of 256 processors working in tandem."

So I'd suggest we change the sentence to read something like "It was a 32-node RS/6000 SP Thin P2SC-based system, with each node containing a 120 MHz P2SC microprocessor was enhanced with 8 special purpose VLSI chess chips, for a total of 256 processors working together." --RCMoore (talk) 13:46, 16 October 2009 (UTC)[reply]

Arimaa information

Unbiased information about arimaa was deleted. If you object to the information, please discuss it before changing it. Mschribr (talk) 11:05, 28 March 2010 (UTC)[reply]

In accordance with the bold, revert, discuss process, when someone adds new information and it is reverted, the next step is to discuss, not to re-insert the information. The information on Arimaa is most relevant within its article, which a reader can easily reach by following the link. A digression about Arimaa within this article is unnecessary. Isaac Lin (talk) 23:58, 28 March 2010 (UTC)[reply]
The BRD is only for recent changes. My changes were established. The policy says the BRD is a method but not always successful. If you think the information on Arimaa is not relevant here then we can remove it completely. However, we can not leave it with only deceptive information. I was giving a balanced picture. Mschribr (talk) 12:16, 29 March 2010 (UTC)[reply]
Sorry, the changes that were reverted were added on March 12, which I thought was not that long ago. How about removing the additional details on Arimaa and changing the sentence to simply be "Kasparov's loss to Deep Blue inspired the creation of a new game called Arimaa." and leaving it at that? (Personally I don't have much issue with deleting that sentence as well, but I will give the editor who added it the benefit of the doubt in assuming that Arimaa has met notability criteria.) Isaac Lin (talk) 16:21, 29 March 2010 (UTC)[reply]
The changes were there for 2 weeks, which is long time for Wikipedia. I agree with your shortened suggestion. I disagree with the implication that arimaa is harder than chess for the computer. Mschribr (talk) 22:25, 29 March 2010 (UTC)[reply]

Cwncpiracy theories

What of them? —Preceding unsigned comment added by 76.89.178.237 (talk) 07:14, 22 September 2010 (UTC)[reply]

Article Maintenance

Note 15 is out of date. 'Game Over' : Did IBM Cheat Kasparov?, by Mark Weeks, About.com, June 2005 at http://chess.about.com/library/weekly/aa05f04.htm is no longer available. --Trakon (talk) 20:48, 23 March 2011 (UTC)[reply]

Please Read the book "Behind Deep Blue"

I have found two things about this article;

1) There are some inaccuracies. 2) There are people with wrong beliefs.

There is a book written from Hsu's point of view (the creator of the original "chess chip" that eventually led to Deep Blue. From his point of view, this was not man vs. machine, but man as a performer vs. man as a toolmaker. The computer is merely a tool man has made. It has no implications on chess, other than the simple fact that man doesn't always perform at his highest ability. And sometimes, just sometimes, tools are more efficient than a human being.

Furthermore, I do not believe IBM cheated after reading the account. Hsu accounts much for time and energy used in the creation of Deep Blue.

Keep in mind too, that Garry was an extremely emotional World Champion and is not without many faults himself.

To clarify what happened after the match, several times IBM attempted to set up a rematch, but Garry would not take his own challenges seriously. Furthermore, after the original creator, Hsu, attempted to gather backers for a rematch, ON HIS OWN, he contacted Garry. Garry refused/declined the offer. Hsu was willing to, out of his own pocket, fund the making of a new machine that could win against a 2800 world champion. It was probably out of embarrassment that the world champion did not want to play.

There is one other fact that is completely neglected. At the time of the 1997 match, there is noone in the world who was a stronger chess player than Garry Kasparov. Is it logical to accuse another person of cheating by supplying "moves" that would beat a person that another person could not beat. The only possible way to beat this unbeatable person was with a device, i.e., a tool, that would not give in so easily to emotion, stress, or pressure.

-- Benjamin Pessin — Preceding unsigned comment added by Fiddlerben (talkcontribs) 04:12, 21 October 2011 (UTC)[reply]

Someone else could help the computer by telling it which moves to consider and which to ignore. Bubba73 You talkin' to me? 04:20, 21 October 2011 (UTC)[reply]
To Benjamin Pessin: What does man vs. machine mean? All machines and computers are tools of man. The implications for chess are great. Strong chess computers changed the way we learn, analyze and watch chess. I think computers have reached the point where they can see past the human horizon in chess at a key point during the game. At that point, the game turns decisively in the computer’s favor. Ibm may have cheated because deep blue cannot be independently tested, as deep blue does not exist anymore. Garry lost the match because he was an extremely emotional during the match. How do you know IBM attempted a rematch? Garry challenged ibm to a rematch. Ibm refused to play Garry or anyone else. Garry did not accept Hsu’s challenge because Hsu did not have a computer ready to challenge the world champion. A team of computers and humans could beat the world champion or deep blue. Therefore, it is possible to help the computer cheat. --Mschribr (talk) 19:18, 26 October 2011 (UTC)[reply]

Cost?

How much did it cost? Or, since IBM built it themselves, what would they sell a comparable machine for? As I recall, it was in the $100 million range. That it took such a machine to beat Kasparov is noteworthy. Don't Be Evil (talk) 03:22, 11 December 2011 (UTC)[reply]