Search strategy research and analysis for surakarta chess game

As one of the most important part of Computer Game, the search algorithm is the key to every chess game. This paper formulates a new search strategy based on the basic algorithm. It briefly introduces the theory and technique of hybrid search strategy and the dynamic control of the depth of the search strategy. Efforts are also made to establish a kind of search depth which is not limited to integers. Experiments are conducted to have tested and evaluated the above strategies. They have been successfully used in Surakarta game program, which have helped us win the champion in the 2013 National Undergraduate Computer Game Competition.