Computer Go
Braun Lecture Hall
Daniel Bump, Computer Go. Go is an ancient game that proved more difficult for computers to play than Chess or Checkers. I will consider the problem of Go programming, why it is difficult, and look at GNU Go's algorithms. Then we will consider two subsequent subject developments, namely Monte Carlo methods and Deep Learning. Finally, we will review a few moves from the recent AlphaGo-Lee Sedol match.
Daniel Bump is a professor of mathematics at Stanford. His research is in representation theory and automorphic forms. He is a co-author of GNU Go, which in the late 1990's became the first free Go program of reasonable strength.
