Let me expand a little more on what I meant and see if it makes more sense to you: Much about Go/Weiqi is still unknown even to the top players. For example Ke

Let me expand a little more on what I meant and see if it makes more sense to you: Much about Go/Weiqi is still unknown even to the top players. For example Ke Jie (the current highest ranked player) feels that the current komi (compensation given to white for playing second) is too generous and he prefers white (last year he won almost all his white games). This is why professional players seem very excited about AlphaGo. If AlphaGo can consistently beat top players it may teach us more about the game. It may discover or settle questions about josekis (pattern conventions). It may tell us what komi is fair. It could settle questions about how a particular board position should be valued. On the other hand since it uses patterns learned from human plays, this could also motivate new theories of play that could defeat past strategies. Or if no one can come up with ways to defeat AlphaGo it may indicate the valuation function it produces is approaching ideal. But AlphaGo is very much about combining existing tools of ConvNet and MCTS, albeit in a highly innovative manner, to solve the search problem of Go. Its success or failure could teach us a lot about how amenable the Go game is to such an approach (and potentially advance theories about the Go game), more than I would say about how in general problems in AI can be solved. That is what is learned here is very specific because Go is a very visual game and/or humans play it in a very visual way to take advantage of the massive parallelism of our vision system to quickly narrow down choices.