Last week, Google’s AlphaGo program beat Ke Jie, the Go world champion. The victory is a significant one, due to the special difficulties of developing an algorithm that can tackle the ancient Chinese game. It differs significantly from the feat of DeepBlue, the computer that beat then-chess world champion Garry Kasparov in 1997, largely by brute force calculations of the possible moves on the 8×8 board. The possible moves in Go far eclipse those of chess, and for decades most researchers didn’t consider it possible for a computer to defeat a champion-level Go player, because designing a computer with such complexity would amount to such great leaps towards creative intuition on the computer’s part.
Continue reading “The Artificial Intelligence of Google’s AlphaGo”