A hybrid game-tree search algorithm for playing chess

作者：Liu Yanli^*; Zhang Heng; Fu Ping

来源：Journal of Computational Information Systems, 2012, 8(14): 5803-5811.

• Chess program
• Game-tree search
• Hybrid algorithms
• Hybrid search algorithms
• Iterative deepening
• ITS data
• Playing chess
• Search Algorithms
• Transposition table

By describing and analyzing the module of chess program which is designed by myself such as its data expression, move generation, search engine, the paper expounds the Chinese chess program';s principle of design and implementation, furthermore, a hybrid search algorithm, which is combined by the improved transposition tables, improved iterative deepening, capturing heuristic and some popular search algorithms, is put forward. Our experiments with the hybrid algorithm show that new method outperforms traditional game-tree search algorithm and has some advantages in Chinese chess program. The paper provides a good reference to fellow researchers.

• 出版日期2012