| Summary: | 博士 === 國立交通大學 === 資訊科學與工程研究所 === 99 === Wu and Huang presented a new family of k-in-a-row games, among which Connect6 (a kind of six-in-a-row) attracted much attention. For Connect6 as well as the family of k-in-a-row games, this thesis proposes a new threat-based proof search method, named Relevance-Zone-Oriented Proof (RZOP) search, developed from the lambda search proposed by Thomsen. The proposed RZOP search is a novel, general and elegant method of constructing and promoting relevance zones. This thesis solved effectively and successfully many new Connect6 game positions, including several Connect6 openings, especially the Mickey-Mouse Opening, which used to be one of the popular openings before we solved it. In addition to solvability, this thesis further improves the RZOP method, named Segmented Relevance-Zone-Oriented Proof (SRZOP) search, which speeds up the time to solve Connect6 game positions. The experimental results show 2.04 speedups in total to solve 12 openings. Finally, this thesis demonstrates records of our Connect6 program, NCTU6, which won the gold in the 13th Computer Olympiads in 2008; and also won eight games and lost none against top Connect6 players in Taiwan in 2009.
|
|---|
