A program called AlphaGo, designed by Google's DeepMind artificial-intelligence team, just won a game against Lee Sedol, one of the world's greatest Go players.
AlphaGo AI won the game in Seoul, South Korea, by resignation after 186 moves. The win marks the first time that a computer program has defeated a top-ranked human Go player on a full 19-by-19 board with no handicap.
DeepMind founder Demis Hassabis took to Twitter to celebrate, saying his team had "landed on the moon."
Lee and AlphaGo are playing a series of matches over the course of five days. Go looks to be the latest in artificial intelligence's mastery of games. Checkers fell in 1994, and it was followed by chess in 1997 and Jeopardy in 2011. In October, AlphaGo became to first program to beat a professional Go player; now it's taking on one of the best players alive.
"It's definitely an important milestone," Brown University computer scientist Michael L. Littman tells Tech Insider.
What makes Go — a game whose dominance by humans seemed secure as recently as 2014— such a beguiling target for artificial intelligence is the nature of the game.
Created in China 2,500 years ago, Go appears simple. A game begins with an empty board. Two players (one using black stones, the other white), alternate placing stones in squares, trying to grab territory without getting their pieces captured.
As Alan Levinovitz noted in Wired, the game quickly gets complex. There are 400 possible board positions after the first round of moves in Chess and 129,960 in Go. There are 35 possible moves on any turn in a Chess game, compared with 250 for Go.
In a blog post in January, DeepMind's David Silver and Hassabis noted that the search space (the number of possible board configurations) in Go is larger than the number of atoms in the universe.
Given that level of complexity, DeepMind couldn't rely on what's called brute-force AI, in which a program maps out the breadth of possible game states in a decision tree.
As Business Insider's Tanya Lewis has noted, AlphaGo combines two AI methodologies:
- Monte Carlo tree search: This involves choosing moves at random and then simulating the game to the very end to find a winning strategy.
- Deep neural networks: A 12-layer network of neuron-like connections that consists of a "policy network" that selects the next move and a "value network" that predicts the winner of the game.
DeepMind didn't "program" AlphaGo with evaluations of "good" and "bad" moves. Instead, AlphaGo's algorithms studied a database of online Go matches, giving it the equivalent experience of doing nothing but playing Go for 80 years straight.
"This deep neural net is able to train and train and run forever on these thousands or millions of moves, to extract these patterns that leads to selection of good actions," says Carnegie Mellon computer scientist Manuela Veloso, who studies agency in artificial-intelligence systems.
"Deep learning has been limited to descriptions, putting captions on images, saying, 'This is a cat or a laptop,'" she tells Tech Insider. But with AlphaGo, "It's the ability, given the description, and the value of the game state, which action should I take."
Google acquired DeepMind in 2014. Founded in 2010 by chess prodigy turned artificial-intelligence researcher Hassabis, the company's mission is to "solve intelligence," and it says its algorithms "are capable of learning for themselves directly from raw experience or data."In February 2015, DeepMind revealed in Nature that the program learned to play vintage arcade games like Pong or Space Invaders as well as human players.
Littman, the Brown computer scientist, says he could see AlphaGo's technology applied toward Google's self-driving cars, where the AI has to make lots of little decisions continuously, similar to a game of Go. It could also be used in a problem-solving search capacity, if, for example, you wanted to ask Google to give you a recipe for baking a cake for your gluten-free cousin.
"It's inevitable that we have Go programs that beat the best people," Littman says. "What we're finding is that any kind of computational challenge that is sufficiently well defined, we can build a machine that can do better. We can build machines that are optimized to that one task, and people are not optimized to one task. Once you narrow the task to playing Go, the machine is going to be better, ultimately."
You can watch AlphaGo's matches against Lee here.
Rob Price and Sam Shead contributed reporting.