苏拉卡尔塔棋系统的设计与实现

Design and Realization of Surakarta Chess System

苏拉卡尔塔棋算法是计算机博弈算法的一个重要分支,笔者采用二维数组表示该棋盘及其棋子信息,设计思路简洁,占用空间较小。首先,针对苏拉卡尔塔棋的基本规则,通过棋盘扫描法利用棋盘的内轨和外轨,找出当前棋盘状态下的有效走法;其次,采用置换表和历史启发与NegaScout搜索算法结合的NegaScout_TT_HH,降低搜索过程中的节点数;最后从棋盘的基本价值、棋子的数量、移动范围和攻击力几方面进行考虑,对该棋的棋局状态进行评估。

The Surakarta chess algorithm is an important branch of the computer game algorithm.The author uses a twodimensional array to represent the chessboard and its pieces information.The design idea is simple and it takes up less space.First of all,according to the basic rules of Surakarta chess,the inner and outer tracks of the chessboard are used through the board scanning method to find out the effective moves in the current chessboard state;secondly,the combination of permutation table and historical heuristics and NegaScout search algorithm is adopted.NegaScout_TT_HH,reduce the number of nodes in the search process;finally,consider the basic value of the chessboard,the number of chess pieces,the moving range and the attack power,and evaluate the state of the chess game.