In March 2016, AlphaGo beat Lee Sodol, one of the world’s top players of the Chinese game Go, by 4-1, marking the end of what was probably the last great board game AI had to conquer.

What makes Go a particularly difficult problem for computers to at least in the traditional (simplistic) approach is that the number of possible combination moves number more than the atoms in the universe. So it’s impossible to brute force it with the entirety of the computing power we have. Thus it was a good problem for finding alternative approaches.