> No we aren't. But games of complete information that ARE computable, such as chess and GO can be removed from discussion. There is no question that these games of complete information are "solvable" with or without AI, since every move, from start to finish, can be calculated before the game even begins - its just a matter of processing power.
In a theoretical universe, sure. In the one that we live in - no.
Let's assume that we can turn every atom in the entire universe that we know of into a 4Ghz processor, further assume that we can perfectly parallelize the search and that we can check one board position in one cycle on one of those processors.
How long would it take to check all possible 19x19 go positions?
Fair enough, if there is ever a quantum entaglement (or other type of course) based solution to go, then I will have been proven wrong. We'll see, but I'm not feeling very worried ;)
In a theoretical universe, sure. In the one that we live in - no.
Let's assume that we can turn every atom in the entire universe that we know of into a 4Ghz processor, further assume that we can perfectly parallelize the search and that we can check one board position in one cycle on one of those processors.
How long would it take to check all possible 19x19 go positions?
(1 * 10^80 processors) * (4 * 10^9 checks) = 10^89 checks per second.
Total number of valid go board states: 10^170, therefore it would still take 10^79 seconds to check all the positions in order to find a perfect game.
Clearly, it is not possible to ever brute-force go, no matter what kind of advances computing technology will take.