Connect6

被引：55

作者：

Wu, IC ^{[1
]}

Huang, DY ^{[1
]}

Chang, HC ^{[1
]}

机构：

[1] Natl Chiao Tung Univ, Dept Comp Sci & Informat Engn, Hsinchu 30050, Taiwan

来源：

ICGA JOURNAL | 2005年 / 28卷 / 04期

关键词：

D O I：

10.3233/ICG-2005-28405

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：235 / 242

页数：8

共 20 条

[1]

Allis LV, 1996, COMPUT INTELL, V12, P7, DOI 10.1111/j.1467-8640.1996.tb00250.x

[2]

Allis LV., 1994, SEARCHING SOLUTIONS

[3]

[Anonymous], 1982, WINNING WAYS YOUR MA

[4]

CSIRMAZ L, 1980, DISCRETE MATH, V29, P19

[5]

Hales A. W., 1963, Trans Amer. Math. Soc, V106, P222, DOI 10.2307/1993764

[6]

HERIK HJ, 2002, ARTIF INTELL, V134, P277

[7]

*JAP PROF RENJ ASS, 1903, HIST RENJ RUL

[8]

LEE SW, 2005, JOSEKI TSUMEGOS CONN

[9] The accelerated κ-in-a-row game [J].

Pluhár, A .

THEORETICAL COMPUTER SCIENCE, 2002, 270 (1-2) :865-875

[10]

PLUHAR A, 1994, GENERALIZATIONS GAME

← 1 2 →