1 / 19

A Brief History o f Computer Go

A Brief History o f Computer Go. Dr. Chun Sun (Microsoft Inc, Boston) For HXGNY GO EXPO, June 2013. The “Armor”. The “Force”. “Goliath”. 5D. 19 91. “ HandTalk ”. 3D. 19 93. May 11 th 1997, New York City, NY First computer program t o defeat a world champion. In C hess!. 19 97.

elam
Download Presentation

A Brief History o f Computer Go

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Brief History of Computer Go Dr. Chun Sun (Microsoft Inc, Boston) For HXGNY GO EXPO, June 2013

  2. The “Armor” The “Force”

  3. “Goliath” 5D 1991 “HandTalk” 3D 1993

  4. May 11th 1997, New York City, NY First computer programto defeat a world champion In Chess!

  5. 1997

  6. What about Go?

  7. “HandTalk” “MFGO” Taiwan Insei Janice Kim 1p 1997 1997

  8. 1997

  9. What makes the difference? 19 x 19 free ~200 ~200 Board size Rule. Average Moves Per Game.. Average Possible Moves. Defined for each piece 8 x 8 ~30 ~30 10170 Possible Variations 1043

  10. 10170 Numbers! What do they mean? 1043 1017 age of the universe in seconds 1023 diameter of the galaxy in centimeters 1048 number of water molecules on the Earth 1080 number of atoms in observable universe

  11. 1043 10170 Go is way more complicated than Chess

  12. How does computer play chess? 1. Look for variations, as many as possible. … … … … … … … … … … … 2. Evaluate board position. … … … … … 3.1 … 1 … … … … … … … … … … 3.3 … 5.0 … 3. Propagate back to find the best move. … … … … …

  13. Why can’t computer play Go in the same way? … 10170 Too much more variations … … … … … … … … … … Evaluation is difficult … … … … … … … … … … … … … … … … … … How do you count? … … … … …

  14. 2006 Monte Carlo Tree Search (MCTS) … 0.86245… 0.61733… (from a position) Play a bunch of Randomgames (to a state) where precisescoring can be done White Win Assign “winning rate” to a certain move Black Win

  15. “MoGo” “MoGo” “Zen” Many p’s, including 9p Guo Juan 5p 2007 2009 2011 Chou Chun-hsun 9p

  16. 640 core “MoGo” “CrazyStone” “MoGo” Kim Myungwan 8p Wang Ming-wan 9p 2008 2008 Chou Chun-hsun 9p 2009.2

  17. 128 core 12 core “MoGo” 12 core “MFGO” 2009.12 “MoGo” Chou Chun-hsun 9p Joanne Missingham 6p 2011.6 Many programs 26 core “Zen”

  18. 6/6/2013 (3 days ago) Zen beats a strong amateur (Tygem 9d) with 3 handicaps “Zen”“CrazyStone” Chou Chun-hsun 9pMasaki Takemiya 9pIshida Yoshio 9p 2012

  19. Do we have models for heuristics, domain specific knowledge as the “Black Magic”? Will Artificial Intelligence ever exceed human intelligence? Find Answers, You will. Do we need more computing power?

More Related