Research On Opening Book And Move Generator In Chinese Chess Software

CG(Computer game) is one of the most challenging research directions in the field ofArtificial Intelligence. The development of CCG(chess computer game) has been mature,but the research of more complex CCCG (Chinese chess computer game) is laggingbehind. The paper uses the successful experience of CCG for reference and studies theopening book and game-tree search, which are the significant component of Chinese chessprograms. The research of Chinese chess human-machine game has theoretical andpractical significance.Firstly, the paper proposes the method of‘states of CCG’in order to solve the wasteof memory space as a result of the phenomenon that“all paths leading to the sameposition”in the opening book. Aiming at the problems of stiffness layout and deficiencyof strategy and flexibility, the paper designs and achieves the opening book based on SQLServer database. The paper discusses the superiority of the opening book designed bymyself from the complexity of time and space.Secondly, in order to accelerate the speed of CCCG, the paper studies the Alpha-Betapruning search, the aspiration search and the principal variation search applied in chess indepth. In this paper, we propose the method of optimizing move sequence and resolve theproblem of low efficiency. The paper also utilizes iterative deepening to avoid“horizoneffect”and puts forward a mixed search algorithm named“move ordering + iterativedeepening + principal variation”.Finally, the paper achieves Chinese Chess software based on VC 6.0 + SQL 2000platform and makes use of three assessment indicators to analyze the efficiency of thegame tree search algorithms above. Experimental results show that the computer appliedthe proposed mixed game-tree search algorithm has the highest speed and playingstrength.