Google reveals secret test of AI bot to beat top Go players

Re:Google reveals secret test of AI bot to beat top Go players by 1024core on Wednesday January 04, 2017 @06:44PM (#13323257)

> Now, they play computer-like moves because "understanding" the position isn't as important as just being able to see 25+ moves ahead.

I don't think you can "see 25+ moves ahead" in Go. The branchout factor is just too big.

[ Parent | on HN ]

Re:Google reveals secret test of AI bot to beat top Go players by dfan on Wednesday January 04, 2017 @07:05PM (#13323399)

Well, stouset is talking about chess, but in Go, Monte Carlo Tree Search plays out all the way to the end of the game; it just does so in a much less exhaustive way, for exactly the reason you mention.

[ Parent | on HN ]

Re:Google reveals secret test of AI bot to beat top Go players by skj on Wednesday January 04, 2017 @09:29PM (#13324209)

One of the nice things about Go is that branches rejoin quite a bit, mitigating some of the branching factor concerns.

[ Parent | on HN ]

Re:Google reveals secret test of AI bot to beat top Go players by rockdoe on Thursday January 05, 2017 @01:21AM (#13325170)

You can prune more effectively. Download a program like Leela and let it analyze some positions. You'll get very deep mainlines just like in chess.

[ Parent | on HN ]

Re:Google reveals secret test of AI bot to beat top Go players by stouset on Wednesday January 04, 2017 @07:25PM (#13323562)

My comment was in a subthread about computers playing chess in a more human-like manner.

[ Parent | on HN ]