In 2016 Google made a system that was better at any person at playing Go. Go has roughly 130,000 moves possible at any point. That's approximately equal to 400 * 2^9.
Moore's law states that the number of transistors (which is a proxy for computing power) in CPUs doubles every year. 2016 - 1996 = 20 years of computing power growth.
In short, after our computing power has increased roughly by a factor of 2 ^ 20 someone made a system that plays a game that's 2 ^ 9 time more complicated than chess. Why is this seen as some giant, surprising leap forward?
For example, a brute force search of a 19x19 Go board to a depth of 20 would yield on the order of 361^20 = 1.4E51 game states. With a reduction in search depth and better algorithms, state-of-the-art engines might cut this down by ten orders of magnitude, but can still be beaten by rank amateurs.
Deepmind's approach to board game engines blows all previous approaches out of the water. The claim that their success is incidental to Moore's law is categorically false.
We had 20 years of doubling of computing power before Lee Sedol match. In those 20 years there were many other AI programs that have beaten various world champions at other board games (and no one cared). There were other good Go engines before Alpha Go. They would beat most human players in the world.
Why AlphaGo of all other programs is seen not as increment, but as some giant leap forward? It doesn't solve a new class of problems and it doesn't use any fundamentally new algorithms.