Optimization Studies On The Secondary Estimation In Computer Chinese Chess Game

In the competition of ecology, politics, military and biology, one side always try to triumph over the other side by their intelligence, and the game is the science of research the countermeasure and wits battle. Synchronously, because of the common exist of game phenomenon, it supplies a favorable laboratory to artificial intelligence, whose concepts and methods are abstracted from the process of game. And when researching the rules in game, most of researchers set the chess as the example in the field of artificial intelligence.The Chinese chess is the treasure of china nationality. It develops for years, so it forms a series of particular strategy, style and skill of game step by step. With the deeper study of artificial intelligence, computer Chinese chess becomes the stress of relative studies more and more. And among them, estimation method and Search arithmetic are the core problems of computer Chinese chess.The estimation method determines the level height of gamers under the most situations. Because the static estimation method extensively used in computer Chinese chess game can't objectively reflect the gamers' tendency of strength variation at present, the paper realize the intention of directed search according to the gamers' strategy, introduces a novel method of secondary estimation based on game situation, establishes the model of zero-one goal programming aiming at the bilateral military strength compares, give situational factors as the resolution by using genetics arithmetic on the game platform of computer Chinese chess, and practice them.The result shows that according to tactics and strategic shifting of the two sides, it can realize the intention of directed search. Not only is it applicable in game in artificial intelligence , but also it has extend value in the field of military, ecology and other fields in nature science.