AlphaGo beats Lee Sedol
- games
- machine learning
In March 2016, DeepMind’s AlphaGo defeated Lee Sedol by four games to one in Seoul. The system combined learned neural-network evaluations with tree search, using both human game records and self-play during its development. Go’s enormous search space had made straightforward enumeration an inadequate route to expert play. The match showed that learning and search could work together against a leading human professional in a demanding domain. It was a specific achievement in Go, not proof of human-level ability in every activity. Later AlphaGo and AlphaZero systems used different training arrangements and should not be read back into this match. *Image: Wikimedia Commons (Lee Sedol in 2016; LG Electronics; CC BY 2.0).* **Timeline anchor:** 15 March 2016 CE. The date the match ended (9–15 March 2016). **References:** [Source 1](https://en.wikipedia.org/wiki/AlphaGo_versus_Lee_Sedol), [Source 2](https://en.wikipedia.org/wiki/AlphaGo).
- Date precision
- The date the match ended (9–15 March 2016).
Sources
Related
On other timelines
- AlphaGo beats Lee Sedol on The history of computer science by @athan