#
I have a question about "solved" games, and the significance of games to artificial intelligence. I take it games provide one way to assess artificial intelligence: if a computer is able to win at a certain game, such as chess, this provides evidence that the computer is intelligent.
Suppose that in the future scientists manage to solve chess, and write an algorithm to play chess according to this solution. By hypothesis, then, a computer running this algorithm wins every game whenever possible. Would we conclude on this basis that the computer is intelligent? I have an intuition that intelligence cannot be reduced to any such algorithm, however complex. But that seems quite strange in a way, because it suggests that imperfect play might somehow demonstrate greater intelligence or creativity than perfect play.
[If the notion of "solving" chess is problematic, another approach is to consider a computer which plays by exhaustively computing every possible sequence of moves. This is unfeasible with...

I have a question about "solved" games, and the significance of games to artificial intelligence. I take it games provide one way to assess artificial intelligence: if a computer is able to win at a certain game, such as chess, this provides evidence that the computer is intelligent.
Suppose that in the future scientists manage to solve chess, and write an algorithm to play chess according to this solution. By hypothesis, then, a computer running this algorithm wins every game whenever possible. Would we conclude on this basis that the computer is intelligent? I have an intuition that intelligence cannot be reduced to any such algorithm, however complex. But that seems quite strange in a way, because it suggests that imperfect play might somehow demonstrate greater intelligence or creativity than perfect play.
[If the notion of "solving" chess is problematic, another approach is to consider a computer which plays by exhaustively computing every possible sequence of moves. This is unfeasible with...

Response from Richard Heck on :

This is a very good question. It is reminiscent of the debate over the so-called "Turing Test", in particular, of an objection to the Turing Test made by Ned Block: his "Blockhead". See the SEP article on the Turing Test for more on this. In the case of chess, it is generally believed that chess is solvable in principle. There are only finitely many possible moves at any stage, etc. So, in principle, a computer could check through all the possibilities and determine the optimum move at each stage. Practically, this is impossible at present, as there are too many moves. But if chess had been solved, and if a computer were simply programmed to make the best move at each stage, then it seems quite clear that no "intelligence" would be involved. Of course, this does not by itself show that "intelligence cannot be reduced to any...algorithm", and the question whether it could be is hotly disputed. There are some famous (or infamous) arguments due to Lucas and Penrose that attempt to establish...