Have you played go? When you play Go you start to appreciate how complex it is, how strong Lee Sedol is and what this achievement means. In 2006 a paper was pu

Have you played go? When you play Go you start to appreciate how complex it is, how strong Lee Sedol is and what this achievement means. In 2006 a paper was published (by Remi Coulom) showing that just playing random moves and combining those random playouts with a tree search scaled up in strength arbitrarily as you throw more computational resources at the problem. Google made them a little less random and threw a ton of hardware and optimizations at it. (Basically 20 times as much as anyone before them, which goes a long way of explaining the performance jump) Don't make this something it is not.