Mastering the game of Go with deep neural networks and tree search

The AlphaGo paper (Nature, January 2016) is where Hassabis's scientific approach to AGI became visible to the world. The team combined deep convolutional neural networks (trained first via supervised learning from human expert games, then reinforced via self-play) with Monte Carlo Tree Search to create a system that defeated European Go champion Fan Hui — the first time a computer program beat a professional Go player on a full 19×19 board. The paper's significance for AGI research is methodological: it demonstrated that combining pattern recognition (neural nets) with lookahead planning (MCTS) could tackle problems previously considered intractable by machines. Go was considered the hardest major board game — its branching factor (~250) and game-length made brute-force search impossible, requiring 'intuition.' AlphaGo showed that deep learning could substitute for intuition in high-dimensional search spaces. The decisive moment came four months later when AlphaGo defeated Lee Sedol 4-1 in Seoul, watched live by 200 million viewers worldwide — the first major AI milestone that reached mainstream attention since Deep Blue beat Kasparov in 1997.