Well, your comment bothered me, so we are all bothered!
I still disagree with your argument. The problem with Go isn't just the high number of permutations involved, there are real-world problems, with just as many permutations, which have been solved.
The extra problem with Go (and chess to a lesser degree) is that's it's incredibly hard to be sure, with any certainty, to be sure that a move is a "good" choice.
Comparing to the sudoku example again, when "playing" sudoku it's usually obvious as soon as you make a bad move, you've put two '1's in the same row/column/box for example. With Go if we want to play well, or perfectly, we really have to explore the entire search space.