按年被提到
20152015 · 3 次2026
强化学习与智能体›博弈与游戏 AI·arXiv:1511.06410 · cs.LG

Better Computer Go Player with Neural Network and Long-term Prediction

Yuandong Tian, Yan Zhu · 2015
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 4 人首次 2015-12-06 · 最近 2016-01-27
4不同的人
2活跃月份
4讨论串
65被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Competing with top human players in the ancient game of Go has been a long-term goal of artificial intelligence. Go's high branching factor makes traditional search techniques ineffective, even on leading-edge hardware, and Go's evaluation function could change drastically with one stone change. Recent works [Maddison et al. (2015); Clark & Storkey (2015)] show that search is not strictly necessary for machine Go players. A pure pattern-matching approach, based on a Deep Convolutional Neural Network (DCNN) that predicts the next move, can perform as well as Monte Carlo Tree Search (MCTS)-based open source Go engines such as Pachi [Baudis & Gailly (2012)] if its search budget is limited. We extend this idea in our bot named darkforest, which relies on a DCNN designed for long-term predictions. Darkforest substantially improves the win rate for pattern-matching approaches against MCTS-based approaches, even with looser search budgets. Against human players, the newest versions, darkfores2, achieve a stable 3d level on KGS Go Server as a ranked bot, a substantial improvement upon the estimated 4k-5k ranks for DCNN reported in Clark & Storkey (2015) based on games against other machine players. Adding MCTS to darkfores2 creates a much stronger player named darkfmcts3: with 5000 rollouts, it beats Pachi with 10k rollouts in all 250 games; with 75k rollouts it achieves a stable 5d level in KGS server, on par with state-of-the-art Go AIs (e.g., Zen, DolBaram, CrazyStone) except for AlphaGo [Silver et al. (2016)]; with 110k rollouts, it won the 3rd place in January KGS Go Tournament.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论fitzwatermellow · 2015-12

“Here's the paper: Better Computer Go Player with Neural Network and Long-term Prediction by Yuandong Tian, Yan Zhu http://arxiv.org/abs/1511.06410 "Adding MCTS to darkforest creates a much stronger player: with only 1000 rollouts, darkforest+MCTS beats pure darkforest 90% of the time; with 5000 rollouts, our best model plus MCTS beats Pachi with 10,000…”

How Facebook’s AI Researchers Built a Game-Changing Go Engine原评论 ↗
评论ColinWright · 2015-12

“Comment[0] by fitzwatermellow[1] yesterday from one of the other submissions[2]: Here's the paper: Better Computer Go Player with Neural Network and Long-term Prediction by Yuandong Tian, Yan Zhu http://arxiv.org/abs/1511.06410[3] "Adding MCTS to darkforest creates a much stronger player: with only 1000 rollouts, darkforest+MCTS beats pure darkfore…”

How Facebook’s AI Researchers Built a Game-Changing Go Engine原评论 ↗
被提交为 story · 2 次