华东师范大学学报(自然科学版) ›› 2019, Vol. 2019 ›› Issue (1): 58-65.doi: 10.3969/j.issn.1000-5641.2019.01.007

• 计算机科学 • 上一篇    下一篇

基于价值评估的不围棋递归算法

郭倩宇, 陈优广   

  1. 华东师范大学 计算中心, 上海 200062
  • 收稿日期:2017-10-27 出版日期:2019-01-25 发布日期:2019-01-24
  • 通讯作者: 陈优广,男,高级工程师,硕士生导师,研究方向为图像处理.E-mail:ygchen@cc.ecnu.edu.cn E-mail:ygchen@cc.ecnu.edu.cn
  • 作者简介:郭倩宇,女,硕士研究生,研究方向为人工智能.E-mail:guoqianyu72@163.com.

Recursive algorithm for NoGo based on value evaluation

GUO Qian-yu, CHEN You-guang   

  1. Computing Center, East China Normal University, Shanghai 200062, China
  • Received:2017-10-27 Online:2019-01-25 Published:2019-01-24

RichHTML

136

PDF

797

摘要： 介绍了不围棋及其规则，并且给出了当前不围棋人工智能的方法及其不足之处.通过分析不围棋博弈的特点，提出了价值评估模型函数；基于此，构造出了递归算法，实现了不围棋人工智能，解决了当前已有算法时间和空间复杂度过高的问题；给出了实现此算法的程序与著名开源软件OASE-NoGo的对弈结果：达到了90%以上的胜率.同时，通过一个常见局面展示了本文算法较传统算法在程序计算上的优势，证明了本文算法的可行性和高效性.

关键词: 人工智能, 机器博弈, 不围棋, 价值评估, 递归

Abstract: First, this paper introduces the rules of the game NoGo. Next, we review current methods of artificial intelligence and their respective shortcomings. Then, the article shows an analysis of the game theory characteristics of NoGo and proposes a value evaluation function. Based on this function, a multi-layer recursive algorithm to the artificial intelligence of NoGo can be constructed, which addresses the problem of high complexity in time and space in the present algorithm. Finally, the paper demonstrates the capability of this algorithm and provides results that the program against with the famous open source software OASE-NoGo, which achieved a winning rate of more than 90%. In a typical situation, it demonstrates that the algorithm is better than existing algorithms in computing, and proves the feasibility and effectiveness of this method.

Key words: artificial intelligence, machine game, NoGo, value evaluation, recursion

中图分类号: