基于“连珠”模式的六子棋机器博弈增量模型.pdfVIP

基于“连珠”模式的k子棋机器博弈增量模型 徐长明，马宗民，徐心和 东北大学信息科学与工程学院 摘要：在连珠棋的机器博弈中，由于以交叉点为基本单位来描述或分析局面的常规方法的低效性，以及普通“模 式”在知识表达、局面状态描述和局面评价能力上的有限性，本文提出了一个特殊模式——连珠，在此基础上设 计了一个k子棋的机器博弈模型CPBIM 。基于连珠，构建了若干模式库，用于保存离线生成的领域知识；通过探 讨连珠之间的演化关系，得到了连珠及其内部各空交叉点的评价体系；鉴于任何局面都可等价地由若干连珠的排 列所表示，本文设计了以连珠为核心的高效的局面状态描述方法；为了降低搜索树中各结点的更新代价，还提出 了一种高效的增量更新方法。实验表明，在基于威胁的搜索算法中，CPBIM模型使搜索速度提高到普通模型的5 倍左右。 关键字：机器博弈；六子棋；模式；知识表示；增量更新。 The Connection-Pattern Based Incremental Model in K-in-a-row Computer Games Chang-ming Xu, Z.M. Ma, Xin-he Xu College of Information Science and Engineering, Northeastern University Abstract: Due to the ineffectiveness of the conventional method to describe and analysis a game position from the view of intersections on board, as well as the limitation of the ability to represent the knowledge, describe the state of position, and evaluate the position, this paper proposed a special pattern, called Connection, to overcome those drawbacks. Then, the Connection-Pattern Based Incremental Model in k-in-a-row games, abbreviated as CPBIM, is designed. Thus, a pattern database also can be built to store the domain knowledge generated off-line. Through discussing the evolutionary between each two Connections, a general method to estimate Connection and every intersection of Connection can be proposed. Because of finding that any position can be presented by the permutation of a certain number of Connections in CPBIM, we can easily design an efficient Connection-based presentation for the state of this position. Furthermore, to reduce the cost of updating the state at each tree node when making a search, we put forward an efficient incremental updating method. The results of experiments show that the search algorithm in CPBIM is 5 times faster than that in the normal model on the speed of visiting nodes of tree.