[Computer-go] Mastering the Game of Go with Deep Neural Networks and Tree Search
xavier.combelle at gmail.com
Tue Feb 2 11:07:48 PST 2016
2016-02-01 12:24 GMT+01:00 Olivier Teytaud <teytaud at lri.fr>:
> If AlphaGo had lost at least one game, I'd understand how people can have
> an upper bound on its level, but with 5-0 (except for Blitz) it's hard to
> have an upper bound on his level. After all, AlphaGo might just have played
> well enough for crushing Fan Hui, and a weak move while the position is
> still in favor of AlphaGo is not really a weak move (at least in a
> game-theoretic point of view...).
I just want to point that according to Myungwan Kim 9p (video referenced in
this thread) on the first game, Alpha Go did some mistake early in the game
and was behind during nearly the whole game so some of his moves should be
weak in game-theoric point of view.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Computer-go