**arXiv ID:** 1706.04052 **Authors:** Jinzhuo Wang, Wenmin Wang, Ronggang Wang, Wen Gao **Published:** 2017-06-13T13:30:04Z **Abstract:** Monte Carlo tree search (MCTS) is extremely popular in computer Go which determines each action by enormous simulations in a broad and deep search tree. However, human experts select most actions by pattern analysis and careful evaluation rather than brute search of millions of future nteractions. In this paper, we propose a computer Go system that follows ...
Scanned 9/11/2026
Install to Claude Code
npx -y skills add hiyenwong/ai_collection --skill beyond-monte-carlo-tree-search-playing-go-with-deep-alternative-neural-network-and-longterm-evaluation --agent claude-codeInstalls into .claude/skills of the current project.
Are you the author of Beyond Monte Carlo Tree Search Playing Go With Deep Alternative Neural Network And Longterm Evaluation?
Add the live security badge to your README — it updates automatically with every re-scan.
[](https://www.skillsdirectory.com/skills/hiyenwong-beyond-monte-carlo-tree-search-playing-go-with-dee)More formats (shields.io, HTML) on the badges page.
# Beyond Monte Carlo Tree Search: Playing Go with Deep Alternative Neural Network and Long-Term Evaluation
**arXiv ID:** 1706.04052
**Authors:** Jinzhuo Wang, Wenmin Wang, Ronggang Wang, Wen Gao
**Published:** 2017-06-13T13:30:04Z
**Abstract:**
Monte Carlo tree search (MCTS) is extremely popular in computer Go which determines each action by enormous simulations in a broad and deep search tree. However, human experts select most actions by pattern analysis and careful evaluation rather than brute search of millions of future nteractions. In this paper, we propose a computer Go system that follows experts way of thinking and playing. Our system consists of two parts. The first part is a novel deep alternative neural network (DANN) used to generate candidates of next move. Compared with existing deep convolutional neural network (DCNN), DANN inserts recurrent layer after each convolutional layer and stacks them in an alternative manner. We show such setting can preserve more contexts of local features and its evolutions which are beneficial for move prediction. The second part is a long-term evaluation (LTE) module used to provide a reliable evaluation of candidates rather than a single probability from move predictor. This is consistent with human experts nature of playing since they can foresee tens of steps to give an accurate estimation of candidates. In our system, for each candidate, LTE calculates a cumulative reward after several future interactions when local variations are settled. Combining criteria from the two parts, our system determines the optimal choice of next move. For more comprehensive experiments, we introduce a new professional Go dataset (PGD), consisting of 253233 professional records. Experiments on GoGoD and PGD datasets show the DANN can substantially improve performance of move prediction over pure DCNN. When combining LTE, our system outperforms most relevant approaches and open engines based on MCTS.
## Skill Description
This skill is generated from the arXiv paper: Beyond Monte Carlo Tree Search: Playing Go with Deep Alternative Neural Network and Long-Term Evaluation (1706.04052).
## How to Use
[To be filled in by the user or by future automation]
## References
- [arXiv:1706.04052](http://arxiv.org/abs/1706.04052v1)
Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.
No comments yet. Be the first to comment!