In 1997, IBM’s Deep Blue defeated the reigning world champion, Gary Kasparov. Typically, the game tree complexity of chess is about 1040—which means, essentially, if every one of the 7 plus billion people on Earth paired up and started playing chess, it would take them trillions and trillions of years to play every single variation of the game. Yet, in 2017, Google’s AlphaGo defeated the world Go champion, Lee Sedol. Go has a game tree complexity of 10360—it’s chess for superheroes. Put differently, we humans are the only species known to have the cognitive capacity to play Go. It only took a
...more
This highlight has been truncated due to consecutive passage length restrictions.