As a programmer and a go player, I knew this day would come, but I'm a bit disappointed that this is how it happened, for two reasons: 1. As the game of go progresses, the number of reasonable moves decreases, so that as the game progresses, players on average play closer and closer to optimally. By the end of the game, even weak amateurs can calculate the optimal move. Logically, I would guess that stronger players…
> I hoped that when an AI beat a pro at go, it would be with a more adaptive algorithm, one not specifically designed to play go. The particular algorithm used by AlphaGo is of course specific to Go (the neural network inputs have a number of hand-crafted features), but the overall structure of the algorithm - MCTS, deep neural nets, reinforcement learning - is very general. So there's two ways to look at it. One is…
It is general in the sense that humans can apply those algorithms to different problems (and have been doing so for decades). It isn't general in the sense that we can't apply AlphaGo to other problems unmodified. AlphaGo can't even play chess badly. It is not really even a step toward strong AI. (Note that "strong AI" is a term with a specific meaning. [1])
> The other is that what you asked for is completely unreasonable.
That's tantamount to saying strong AI is unreasonable.