四国军棋游戏复杂度研究  

Research on the Complexity of SIGUO

作　　者：邓红[1] DENG Hong(Wuxi Machinery and Electron Higher Professional and Technical School,Wuxi Jiangsu 214028,China)

机构地区：[1]无锡机电高等职业技术学校,江苏无锡214028

出　　处：《河北软件职业技术学院学报》2022年第1期13-15,共3页Journal of Hebei Software Institute

摘　　要：随着部分完全信息游戏得到理论解,完全信息游戏研究取得了丰硕的成果。通过归纳完全信息游戏复杂度求解方法,结合非完全信息游戏特点,提出了非完全信息游戏复杂度的求解公式。非完全信息游戏更好地模拟了现实世界,四国军棋游戏是典型的非完全信息游戏,求解出其复杂度有助于研制出强大的四国军棋博弈程序,对解决现实世界复杂问题具有重要参考意义。With the theoretical solution is obtained, researchers have made fruitful achievements in the research of complete information games. We can summarize the methods on the complexity of complete information game. Combined with the characteristics of incomplete information game, the complexity formula of incomplete information game is deduced. Incomplete information games simulate the real world better. The SIGUO game is a typical incomplete information game, the solving of the SIGUO’s complexity is helpful to develop a powerful program, which has great significance to solve complex problems in the real world.

关 键 词：完全信息游戏 非完全信息游戏 理论解 复杂度 四国军棋 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]