[maaku]

I suggest actually looking into the architecture of deep blue and followon programs, because right now you are exhibiting the very fallacy I was talking about. Exhaustive search over board states would take longer than the lifetime of the universe to compute a single move.master chess for grams work by using sophisticated algorithms to manage the search process. it's not the process that humans use, but it is intelligent nonetheless. Of course now that it is a solved problem, the common perception is different...

[Houshalter]

It's a guided search, so what? There is no fallacy here, deep blue is not intelligent. You can solve any problem with enough computing power and a basic search. No one has ever claimed otherwise or said that it would be intelligent.

What people did predict wrong is that it would take general intelligence to solve chess. As in, if you solved chess, you could also pass the Turing test and everything else. Here is a quote from Douglas Hofstadter:

>There may be programs which can beat anyone at chess, but they will not be exclusively chess players. They will be programs of general intelligence, and they will be just as temperamental as people. "Do you want to play chess?" "No, I'm bored with chess. Let's talk about poetry." That may be the kind of dialogue you could have with a program that could beat everyone.

And they would have been right if computers hadn't become exponentially faster.