Generalized TSS and Its Optimization

摘要：

　　In several sorts of games,such as Connect6,Renju,or Go-moku,etc.,when sequences of consecutive forced moves appeared,TSS (Threat Space Search) could be adopted to find one of such sequences if existed.TSS is inspired from the process of chess master’s pondering on that condition.In some ways,sequences of forced moves are so popular that we can use it to deal with a family of games effectively,named k-in-a-row.So,we propose a generalized algorithm,DFID-TSS,where we apply the strategy of DFID (Depth First Iterative Deepening) into TSS (Threat Space Search).Without loss of the generality,we also propose some optimized rules,by which lots of branches of the proving tree may be terminated earlier.At last,the results show that DFID-TSS is robust,adaptive,and efficient.

关键词： Threat Space Search iterative deepening pruning

作者: XU Chang-ming Z.M. MA MA Hai-tao YU Chang-yong XU Xin-he

作者单位: Institute of Computer and Communication Engineering, Northeastern University at Qinhuangdao, Qinhuan Information Science and Commutation Engineer, Northeastern University, China, 110819

会议类型: 国际会议

会议名称: the 25th Chinese Control and Decision Conference(第25届中国控制与决策会议)

会议地点: 贵阳

会议语种:英文

页码: 2904-2909

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