The Othello game on an n × n board is PSPACE-complete
Theoretical Computer Science
Journal of the ACM (JACM)
Games solved: now and in the future
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Introduction to the Theory of Computation
Introduction to the Theory of Computation
The accelerated k-in-a-row game
Theoretical Computer Science
A new family of k-in-a-row games
ACG'05 Proceedings of the 11th international conference on Advances in Computer Games
A method to construct knowledge table-base in k-in-a-row games
Proceedings of the 2009 ACM symposium on Applied Computing
Construction of opening book in connect6 with its application
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Note: The biased, distance-restricted n-in-a-row game for small p
Theoretical Computer Science
Theoretical Computer Science
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
Hi-index | 5.23 |
Recently, Wu and Huang [I.-C. Wu, D.-Y. Huang, A new family of k-in-a-row games, in: The 11th Advances in Computer Games Conference, ACG'11, Taipei, Taiwan, September 2005] introduced a new game called Connect6, where two players, Black and White, alternately place two stones of their own color, black and white respectively, on an empty Go-like board, except for that Black (the first player) places one stone only for the first move. The one who gets six consecutive (horizontally, vertically or diagonally) stones of his color first wins the game. Unlike Go-Moku, Connect6 appears to be fairer and has been adopted as an official competition event in Computer Olympiad 2006. Connect(m,n,k,p,q) is a generalized family of k-in-a-row games, where two players place p stones on an mxn board alternatively, except Black places q stones in the first move. The one who first gets his stones k-consecutive in a line (horizontally, vertically or diagonally) wins. Connect6 is simply the game of Connect(m,n,6,2,1). In this paper, we study two interesting issues of Connect(m,n,k,p,q): fairness and complexity. First, we prove that no one has a winning strategy in Connect(m,n,k,p,q) starting from an empty board when k=4p+7 and p=q. Second, we prove that, for any fixed constants k,p such that k-p=max{3,p} and a given Connect(m,n,k,p,q) position, it is PSPACE-complete to determine whether the first player has a winning strategy. Consequently, this implies that Connect6 played on an mxn board (i.e., Connect(m,n,6,2,1)) is PSPACE-complete.