RESEARCH ON CONNECT 6 PROGRAMMING BASED ON MTD(F) AND DEEPER-ALWAYS TRANSPOSITION TABLE

摘要：

　　Chess computer game has always been the hot research topic in the field of artificial intelligence.Connect 6 as an emerging types of chess,has some characteristics such as simple rules,complex changes and fair play.Search engine is the core part on computer game programming.This paper introduces some of the traditional search algorithm in chess computer game,and introduced emphatically a search algorithm based on the MTD(F) and Deeper-Always Transposition Table.Then take Connect 6 as an example,experiments prove its efficiency is higher than alpha-beta pruning algorithm.

关键词： Computer game Connect 6 Search engine MTD(F) deeper-always transposition table

作者: Ruimei Zhang Changcheng Liu Chuandui Wang

作者单位: School of Elecronic and Information Engineering,Anhui University Of Architecture,Hefei 230601,China School of Environment and Energy Engineering,Anhui University Of Architecture,Hefei 230601,China

会议类型: 国际会议

会议名称: 2012 2nd IEEE International Conference on Cloud Computing and Intelligence Systems (2012年第2届IEEE云计算与智能系统国际会议(IEEE CCIS2012))

会议地点: 杭州

会议语种:英文

页码: 254-256

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