Connect6

Article type: Research Article

Authors: Wu, I-Chen^{; *} | Huang, Dei-Yen^{; *} | Chang, Hsiu-Chen^{; *}

Affiliations: Hsinchu, Taiwan

Note: [*] Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan. E-mails: icwu@csie.nctu.edu.tw, deryann@java.csie.nctu.edu.tw, hc@java.csie.nctu.edu.tw.

Abstract: This note introduces the game Connect6, a member of the family of the k-in-a-row games, and investigates some related issues. We analyze the fairness of Connect6 and show that Connect6 is potentially fair. Then we describe other characteristics of Connect6, e.g., the high game-tree and state-space complexities. Thereafter we present some threat-based winning strategies for Connect6 players or programs. Finally, the note describes the current developments of Connect6 and lists five new challenges.

DOI: 10.3233/ICG-2005-28405

Journal: ICGA Journal, vol. 28, no. 4, pp. 235-242, 2005