I like how Ken Jennings dealt with the &#x27;Go complexity&#x27; analogy:<p>&quot;Go is famously a more complex game than chess, with its larger board, longer games, and many more pieces. Google’s DeepMind artificial intelligence team likes to say that there are more possible Go boards than atoms in the known universe, but that vastly <i>understates</i> the computational problem. There are about 10^170 board positions in Go, and <i>only</i> 10^80 atoms in the universe. That means that if there were as many parallel universes as there are atoms in our universe (!), then the <i>total</i> number of atoms in <i>all</i> those universes combined would be close to the possibilities on a single Go board.&quot;<p><a href="http:&#x2F;&#x2F;www.slate.com&#x2F;articles&#x2F;technology&#x2F;technology&#x2F;2016&#x2F;03&#x2F;google_s_alphago_defeated_go_champion_lee_sedol_ken_jennings_explains_what.html" rel="nofollow">http:&#x2F;&#x2F;www.slate.com&#x2F;articles&#x2F;technology&#x2F;technology&#x2F;2016&#x2F;03&#x2F;...</a>