Research on search engine techniques of Surakarta game

Abstract

Computer game (CG) is one of the most challenging research directions in the fields of computer science and artificial intelligence (AI). Relational techniques of computer game are discussed in this article. The main work is listed below as three aspects: First of all, we analyzed the characteristics of Surakarta and modeled the game process of Surakarta. Next then, we discussed the techniques of search engine, which include game state evaluation and game tree search. Lastly, a series of experiments for the search engine were done. And then, combined with the experiments we get the empirical equation. These techniques made the evaluation of the game state more accurate, and the performance of the search engine was more effective and intelligent. The results and conclusions of these experiments have some reference values to other computer game procedures. And they have been proved by a series of experiments and competitions.