The Research of Pattern Symmetry Problem in Learning in Computer Go
Pattern is a very effective approach to improve the Monte-Carlo tree search. Due to the limitation of affordable memory space, the two typical pattern sizes are 3*3 or 4*4. Pattern libraries may be constructed by hand-craft or machine learning, which are all suffered from pattern symmetry problem. This paper elaborates and classifies the pattern symmetry problem in 3*3-pattern and 4*4-pattern, and introduces the solution for solving it in learning procedure. The experimental results show that the solution is effective and the learning results are improved through solving pattern symmetry problem.
Pattern Monte-Carlo Go UCT Learning.
Wei Xin Sun Yinglong Yang Hui Wang Jiao
College of Information Science and Engineering Northeastern University, Shenyang, 110004
国际会议
The 24th Chinese Control and Decision Conference (第24届中国控制与决策学术年会 2012 CCDC)
太原
英文
3313-3318
2012-05-23（万方平台首次上网日期，不代表论文的发表时间）