main

Kasparov defeats 'Deep Junior' in first game

Michael Stanclift   on 27 January 2003 - 18:53 · 17 comments & 1017 views

Advertisement (Why?)
World chess champion Garry Kasparov defeated computerized challenger Deep Junior on Sunday in the first of six games pitting human wit against computer logic.

Kasparov forced the Israeli-programmed Deep Junior into a position from which it could not win, compelling the human moving its pieces to resign four hours into the game.

Both players' queens, the most powerful pieces on the board, were captured by the end of the game, leaving them to use less powerful knights, bishops and rooks. That gave the advantage to Kasparov, who used white pieces and moved first.

"Once he was able to remove the queens from the board, it was just arithmetic," said commentator and international grand master Maurice Ashley.

Early in the game, Deep Junior stunned experts when it paused for 25 minutes to contemplate a countermove to Kasparov's attack. Kasparov was able to parlay that into dominance for the remainder of the game, Ashley said.

"The entire time there was no doubt of his superiority during the game," Ashley said.

View: Chess champ takes on 'Deep Junior' (Neowin Archive - 24 Jan)
News source: CNN


Osmani said he has developed an algorithm that speeds up the way information is handled inside the browser. The technique takes advantage of the features of a particular type of server used widely on the Internet.

The browser handles multiple requests for information, he said. So, instead of a single stream of information, several streams are processed simultaneously. In essence, the task of bringing over a Web page is divided into a set of smaller tasks, cutting the time it takes to reassemble a Web page on the computer screen.

But the judges evaluated Osmani's browser without even considering its speed, as they could not independently benchmark it and lacked complete access to the browser's source code, Taylor said.

Osmani won't reveal more of the code because he is exploring the possibility of patenting or copyrighting aspects of his browser. Some judges said they were unsure whether the process would work in the real world, but others believe it could.

One judge, Intel Ireland's head of process engineering, Leonard Hobbs, said: "Certainly the capability is there. The technique he invented seems unique."

But Hobbs de-emphasized the speed claims. "What impressed us most of all is he absolutely knew what he was doing. It was a complete work, a whole." Osmani's project demonstrated "the science of the Web," he said.

MIT principal researcher with Media Lab Europe, Gary McDarby, said he was astonished by the teen's "years ahead" programming skills. Even if the speed claims prove false, McDarby said, "What he's certainly doing conceptually is raising the bar for the commercial companies."

The browser is based on the version of Microsoft Internet Explorer that third-party developers use. But rather than using Visual Basic, Osmani used an older language called Borland C++, which meant he also had to use some Microsoft tools to translate from one language to another.

These processes generate thousands of extra lines of code -- a point raised by critics on sites like Slashdot and Fark, who couldn't see how any single developer could write the one-million-plus lines first claimed for the browser.

Osmani, an entirely self-taught programmer who got his first PC at 10, said his computing heroes are Apple founders Steve Jobs and Steve Wozniak ("because they were hackers and hands-on"), as well as hacker Kevin Mitnick.

The teenager, who says he'd like to attend Harvard University, was inspired to start work on his browser after a previous winner, Sarah Flannery, received worldwide attention for a new cryptographic algorithm. The algorithm eventually proved to be breakable, but only after top international scientists spent months trying to crack it.

Post a comment · Send to friend Comments · There are 17 additional comments
#1 CarbonKnight on 27 Jan 2003 - 18:59
Great news. There's nothing worse than being a world chess champion and then losing to a computer. Hmmm, maybe a girl, I don't know.
#2 notbychoice on 27 Jan 2003 - 19:11
a loss by a computer to a human does not mean the human is better, it means that the computer's software is not coded properly
#3 jkuy9 on 27 Jan 2003 - 19:14
Kasparov ownz!
#4 CheeseCow on 27 Jan 2003 - 19:36
Woohoo! Then he must be good. I'm having a hard time just beating the UT2k3 bots on my modest PC. He faces one of the planets greatest PC's, using all it's force trying to beat his thinking. I think this shows that computers have a long way to go before they can consider enough variables to be considered "intelligent". When playing chess that is all it does. And it can't even do that well. Crappy computer I say. I agree with the poster above. A.t.m., Kasparov 0wn3rz
(1 reply) #5 Neobond on 27 Jan 2003 - 19:42
poor Kasparov.. asked to play against a machine called Deep [b]Junior[/b] were they trying to play down its abilities?
#5.1 lexor on 28 Jan 2003 - 00:37
no, Junior is there because there is an older version of computer called Deep Blue. Deep Blue played against Kasparov twice, it lost the first time, and won the second. This is a rematch. This one is supposed to be better.
#6 rob.derosa on 27 Jan 2003 - 19:58
It took 25 minutes to contemplate one move Kasparov definitely ownz
#7 tmaxxtigger on 27 Jan 2003 - 19:59
I wonder if he wrote the software how it would do???
#8 Skyfrog on 27 Jan 2003 - 20:13
I think I could beat it.
#9 Andre on 27 Jan 2003 - 20:22
Yay for Garry! I don't think computer will ever beat him. Heck, if it took 25 minutes to compute one move and it still lost what else can we talk about.
#10 crunge on 27 Jan 2003 - 21:19
Imagine though that kinda of ai (its still impressive though it lost) in your strategic games, not necessarily shoot em ups.....
#11 pctuk on 27 Jan 2003 - 21:49
Imagine how many moves could be calculated in 25 minutes! And it still lost! [quote]"Once he was able to remove the queens from the board, it was just arithmetic,"[/quote] Can anyone explain this to me? How could he use arithmetic to win a chess game? He's a genious either way.
#12 spotts on 27 Jan 2003 - 22:25
Keep the info coming. I want to follow the progress of all six games. Pottsy
(1 reply) #13 dj_rigo on 27 Jan 2003 - 22:35
i hope that mankind never develop true AI, i don't want people to live in a Matrix world
#13.1 ramesees on 27 Jan 2003 - 23:11
It depends on how "smart" we make it, and how much we allow it to learn
#14 quanta on 27 Jan 2003 - 23:59
QUOTE: "I don't think computer will ever beat him." Umm....you do remember that IBM's Deep Blue beat Kasparov several years ago. It was quite something, Kasparov threw a tantrum and pretty much said, "u GuYz use h4x, u r ghey". Chess is especially suited for a computer, because a well-programmed chess algorithm will be able to determine thousands of possible scenarios and outcomes very quickly for each move made. However, a human being possesses experience, creativity, and intuition.
#15 notbychoice on 28 Jan 2003 - 00:22
once again if the computer loses, its not cause its not better at chess than a human, it just means that the software needs a better algorithm

Commenting has either been disabled on this article or you are not logged in. Click here to login or register, its free!

Note: Anonymous commenting is disabled in order to keep the quality of responses to a high standard.

Advertisement (Why?)