Kasparov OpEd On His Latest Match

molrak writes "Garry Kasparov has written his thoughts and observations on the difference between his recent battle with Deep Junior as opposed to his battle against Deep Blue, including some of the fundamental differences between the two programs. If you missed out on the event, you can catch up with it at the site of the event's sponsor, including both 2d and 3d viewing options. (Note, viewing options require both site registration with x3dworld and proprietary Microsoft software.)"

Comments

Kasparov Biography

[syr]

Here is a biography of everyone's favorite chess savior protecting humanity against the robotic horde. Included is a list of matches and results throughout the years.

GameTab - Game Reviews Database

View the games with Javascript

[product byproduct]

The submitter didn't scour the web properly. You can view the games with professional commentaries with nothing more than a Javascript enabled browser at these links:

Amir Ban annotation
Karsten Müller et al

Shay Bushinsky

[jbs666]

Chessbase has an interesting interview with Shay Bushinsky, one of the programmers of Junior.

Re:an assumption

[Jester99]

You assume that there is such a thing as an "unsolvable" game. This is not, as far as I know, established. This is not, as far as I know, established.

Sure it has. I'll give you an unsolvable game right now.

The source code to an entire program is written out by a game master. Two copies of the source are printed out. Two players are then each given an identical copy of the source, and a set of arguments that would be passed to the source were it compiled & executed. The goal is to determine if the program will exit correctly, or if it will halt in the middle. The first player to show either a) where it will halt or b) that it won't halt, wins.

This is a game version of the halting problem. It's been mathematically proven intractable; that is, there's no deterministic (e.g., algorithmic or procedural) method of doing this. You cannot write a computer program that will execute a set series of steps every time and determine what's the case here.

Is this game fun? Probably not. :) But that doesn't take away from the fact that an intelligent human could look at a source printout and figure out if it halted or not, but no general algorithm can be deduced that would do so. Thus, for a computer to win at this game, it would actually have to show intelligence, and not raw computational skill.