The Key Techniques of Connect Six in Computer ame Playing

摘要：

Due to the state space complexity of the Connect Six and its enormous game playing branches, the performance of the program, which based on the search of the game playing tree, is not only decided by the evaluation function and the searching algorithms, but also the optimization in all. This paper divides the optimization algorith ms of Connect Six into eight parts, and it also summarizes the theories, the strategies of the implement and the importance of the optimization. At last the performance of the optimization in the software of Connect Six has been showed by the contrast experiments.

关键词： Game Playing Tree Searching Technique Evaluation Function Optimization Algorithm

作者: HUANG Hong SUN Zhen

作者单位: School of Information Science and Technology,Beijing Institute of Technology,Beijing 100081,China

会议类型: 国际会议

会议名称: 2008高等智能国际会议(2008 International Conference on Advanced Intelligence)

会议地点: 北京

会议语种:英文

在线出版日期: 2008-10-18（万方平台首次上网日期，不代表论文的发表时间）