基于对局树算法的中国象棋游戏的设计与实现

The Design and Practice Model on the Basis of Game-tree Algorithm in Chinese Chess

文章在研究分析对局树的基础上,先后运用极大极小查找和α-β修剪对查找下一步的算法进行了改进,并对中国象棋的对弈过程进行了有益的探讨。最后在此基础上,运用面向对象的技术,综合结构化程序设计方法,将所有的操作逻辑封装于类,实现基于对局树算法的中国象棋游戏系统。

After analysing the game-tree algorithm in the Chinese chess,this article revises the searching algorithm with Max-Minimumsearchingand α-βtrimmingsearching,and makes a helpful reasearch on the game process ofthe Chinese chess.Finally,the author developes a Chinese Chess Game on the basis of Game-Tree algorithm.