SLIDE 1 Mastering the game of Go with deep neural networks and tree search
Nature, Jan, 2016
SLIDE 2 Roadmap
- Deep Learning
- Search problem
- How to explore a huge tree (graph)
What this paper is about?
SLIDE 3
AlphaGo Video
https://www.youtube.com/watch?v=g-dKXOlsf98 https://www.youtube.com/watch?v=53YLZBSS0cc
SLIDE 4 Al AlphaGo vs vs*European*Champion*(Fan*Hui 27Da Dan)
October$5$– 9,$2015
<Official$match> I Time+limit:+1+hour I AlphaGo Wins (5:0) * rank
SLIDE 5 Al AlphaGo vs vs*Wo World*Champion*(Lee*Se Sedol 97Da Dan)
March$9$– 15,$2016
<Official$match> I Time+limit:+2+hours Venue:+Seoul,+Four+Seasons+Hotel
SLIDE 6
SLIDE 7 Lee*Sedol
Photo+source: Maeil+Economics 2013/04
wiki
SLIDE 8
Lee Sedol
SLIDE 9 =$multiple$machines European$champion
SLIDE 10
The Game
SLIDE 11
SLIDE 12
SLIDE 13
SLIDE 14
SLIDE 15
Go Elo Ranking
http://www.goratings.org/history/
SLIDE 16
Lee Sedol VS Ke Jie
SLIDE 17
How about Other Games?
SLIDE 18
Tic Tac Toe
SLIDE 19
Chess
SLIDE 20
Chess (1996)
SLIDE 21
Deep Blue (1996)
SLIDE 22
SLIDE 23
AlphaGo is the Skynet?
SLIDE 24
Go Game
SLIDE 25
Simple Rules
SLIDE 26
High Complexity
SLIDE 27
High Complexity
SLIDE 28
SLIDE 29
Different Games
SLIDE 30
Search Problem (the search space)
SLIDE 31
Tic Tac Toe
SLIDE 32
Tic Tac Toe
SLIDE 33
The “Tree” in Tic Tac Toe
SLIDE 34
The “Tree” of Chess
SLIDE 35
The “Tree” of Go Game
SLIDE 36
Search Problem (how to search)
SLIDE 37
MiniMax in Tic Tac Toe
SLIDE 38 Adversarial"Search"–"MiniMax""
J1" 0" 1" 0" 0" 0" J1" J1" J1" J1" 1" 1"
5"
SLIDE 39 Adversarial"Search"–"MiniMax""
J1" 0" 1" 0" 0" 0" J1" J1" J1" J1" 1" 1" J1" 0" J1" J1" 1" 1" 0" J1" 1" J1"
6"
SLIDE 40
What is the problem?
1. Generate the Search Tree 2. use MinMax Search
SLIDE 41
The Size of the Tree
Chess: b = 35, d =80 Go: b = 250, d =150 b : number of legal move per position d : its depth (game length) Tic Tac Toe: b = 9, d =9
SLIDE 42
One Grain of Rice
https://www.youtube.com/watch?v=byk3pA1GPgU
SLIDE 43
The “Space” of GO Game
SLIDE 44 How about other Games?
- Flappy bird?
- Angry Bird?
- Starcraft?
- learning a language
- Write a paper
- Get a MS/PhD degree
- Finding a job
- Life
Chess: b = 35, d =80 Go: b = 250, d =150 Tic Tac Toe: b = 9, d =9
SLIDE 45
How to solve?
SLIDE 46
Chess (1996)
SLIDE 47
Monte Carlo
SLIDE 48
Las Vegas
SLIDE 49
SLIDE 50 Monte"Carlo"Tree"Search"
……." ……." ……." ……." ……." ……." ……." ……."
Tree"search" Monte"Carlo"search"
……."
7"
SLIDE 51 Monte"Carlo"Tree"Search"
- Tree"Search"+"Monte"Carlo"Method""
– SelecIon" – Expansion" – SimulaIon" – BackJPropagaIon"
3/5" 1/2" 2/3" 0/1"
white"wins"/"total"
1/2" 1/1" 1/1" 1/1" 0/1"
8"