I mean this in the sense that Go is unsolvable but AlphaGo seems able to make choices that are consistently more optimal than a human player's choices.
It is my understanding that Game Theory turned out to have limited applications in real world scenarios because of the profound complexity of such scenarios and degree of hidden information. Is it fair to say that there is now a method for dealing with this?
I fully understand that Go is a game of complete information, which has a very specific meaning, but it occurs to me that the inability to generate a complete game tree (computational intractability) could be seen as form of incomplete information, even if it is not traditionally thought of in those terms.
I should probably note that my perspective is one of a "serious" game designer, where complexity serves the same function as chance and hidden information, which is to say as a balancing factor that "levels the playing field".