现代信息科技2024，Vol.8Issue(18)：48-51,58,5.DOI:10.19850/j.cnki.2096-4706.2024.18.010
基于Alpha-beta剪枝树的揭棋算法的设计与实现
Design and Implementation of Revealed Chess Algorithm Based on Alpha-beta Pruning Tree
摘要
Abstract
Revealed chess is a Chinese chess variant,and compared with the pattern of Chinese chess,where strategies and profits are transparent,revealed chess cannot determine profits and subsequent strategies,and belongs to incomplete information game,which requires the development of a new algorithm to enable a revealed chess man-machine game.This paper designs and implements a revealed chess program based on Alpha-beta pruning technology supplemented by heuristic searching to construct a game tree structure suitable for revealed chess by creating a dark matter expansion layer between the maximal layer and the minimal layer.And it designs a scoring system suitable for revealed chess based on the scoring standard of Chinese chess,which solves the problems of scoring dark matter and deep search,and realizes the initial exploration of the complexity of revealed chess state and revealed chess algorithm.关键词
非完全信息博弈/Alpha-beta剪枝/揭棋/中国象棋Key words
incomplete information game/Alpha-beta pruning/revealed chess/Chinese chess分类
信息技术与安全科学引用本文复制引用
刘丰瑞,田少杰,任玉昕..基于Alpha-beta剪枝树的揭棋算法的设计与实现[J].现代信息科技,2024,8(18):48-51,58,5.基金项目
北京信息科技大学促进高校分类发展-大学生创新创业训练计划项目—计算机学院(5112310855) （5112310855）
