The iterative sort search techniques based on percentage evaluation

Aiming at search problem of Chinese chess computer game, we present the iterative sort search techniques based on percentage evaluation and integrate percentage evaluation and iterative sort into problem of Chinese chess computer game. The technique could reflect weight of game sides on both chess force, search similarity on two neighbor ply, feature of high sensibility for the node sort on minimal window search by percentage evaluation on both chess force for game sides. On the basis of higher pruning efficiency, we solve lost of both optimal route and optimal solution problem for traditional searching problem and reach purpose of actual game. It has the actual application value in Chinese chess computer game and game research on every other fields.