Design and Implementation of Revealed Chess Algorithm Based on Alpha-beta Pruning Tree
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.
incomplete information gameAlpha-beta pruningrevealed chessChinese chess
国家科技期刊平台
NSTL
万方数据
