標題: Dependency-Based Search for Connect6
作者: Wu, I-Chen
Kang, Hao-Hua
Lin, Hung-Hsuan
Lin, Ping-Hung
Wei, Ting-Han
Chang, Chieh-Min
資訊工程學系
Department of Computer Science
關鍵字: Connect6;NCTU6;Dependency based search;Threat-space search
公開日期: 1-一月-2014
摘要: Allis proposed dependency-based search (DBS) to solve Go-Moku, a kind of five-in-a-row game. DBS is critical for threat space search (TSS) when there are many independent or nearly independent TSS areas. Similarly, DBS is also important for the game Connect6, a kind of six-in-a-row game with two pieces per move. Unfortunately, the rule that two pieces are played per move in Connect6 makes DBS extremely difficult to apply to Connect6 programs. This paper is the first attempt to apply DBS to Connect6 programs. The targeted program is NCTU6, which won Connect6 tournaments in the Computer Olympiad twice and defeated many professional players in Man-Machine Connect6 championships. The experimental results show that DBS yields a speedup factor of 4.12 on average, and up to 50 for some hard positions.
URI: http://dx.doi.org/10.1007/978-3-319-09165-5_1
http://hdl.handle.net/11536/125019
ISBN: 978-3-319-09165-5; 978-3-319-09164-8
ISSN: 0302-9743
DOI: 10.1007/978-3-319-09165-5_1
期刊: COMPUTERS AND GAMES, CG 2013
Volume: 8427
結束頁: 13
顯示於類別:會議論文


文件中的檔案:

  1. 000349531700001.pdf