摘要
针对不围棋,设计一种高效、可行、易于理解和使用的着法可行性判定算法。分析不围棋的三要素,设计对应的物理结构,介绍一种实战采用的博弈策略,并对同色邻接棋子位置入栈算法、气的计算算法及着法可行性判定算法进行详细分析,最终实现不围棋计算机博弈程序中这些关键算法。实验结果表明算法满足棋规要求,安全可靠,且运算速度快。这种算法的设计与实现对其他棋类博弈程序的设计与实现具有一定的参考价值。
For No Go,an efficient,feasible,easily to understand and used algorithm of the move feasibility judgment was designed.The three key ele⁃ments of No Go were analyzed,and the corresponding physical structure was designed.A game strategy used in actual combat was intro⁃duced.In addition,the algorithm with pushing the same color adjacent chess piece locations into stack,the algorithm of liberties calcula⁃tion and the algorithm of the move feasibility judgment were analyzed in detail,and these key algorithms in the computer game program of No Go were finally realized.The experimental results show that these algorithms satisfy the requirements of the chess rules,are safe,reli⁃able,and fast.The design and implementation of these algorithms have certain reference value for that of other chess game programs.
作者
陈雪健
张利群
曹杨
CHEN Xue-jian;ZHANG Li-qun;CAO Yang(School of Computer and Communication Engineering,Liaoning Shihua University,Fushun 113001)
出处
《现代计算机》
2020年第22期9-13,22,共6页
Modern Computer
基金
国家级大学生创新创业训练项目(No.201910148026)。
