On Drawn K-In-A-Row Games
In 2005, Wu and Huang  presented a generalized family of k-in-a-row games. The current paper simplifies the family to Connect(k, p). Two players alternately place p stones on empty squares of an infinite board in each turn. The player who first obtains k consecutive stones of his own horizontally, vertically, diagonally wins. A Connect(k, p)game is drawn if both have no winning strategy. Given p, this paper derives the value k draw(p), such that Connect(k draw(p), p) is drawn, as follows. (1) k draw(2) = 11. (2) For all p ≥ 3, k draw(p) = 3p+3d+8, where d is a logarithmic function of p. So, the ratio k draw(p)/p is approximate to 3 for sufficiently large p. To our knowledge, our k draw(p) are currently the smallest for all 2 ≤ p < 1000, except for p = 3.
KeywordsLogarithmic Function Gray Zone Winning Strategy Tight Bound Active Line
Unable to display preview. Download preview PDF.
- 1.Allis, L.V.: Searching for solutions in games and artificial intelligence. Ph.D. Thesis, University of Limburg, Maastricht, The Netherlands (1994)Google Scholar
- 4.Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for your Mathematical Plays, 2nd edn., vol. 3. A K Peters. Ltd., Canada (2003)Google Scholar
- 5.Diestel, R.: Graph Theory, 2nd edn. Springer, New York (2000)Google Scholar
- 9.Wu, I.-C., Huang, D.-Y.: A New Family of k-in-a-row Games. In: The 11th Advances in Computer Games (ACG11) Conference, Taipei, Taiwan (2005)Google Scholar
- 10.Wu, I.-C., Huang, D.-Y., Chang, H.-C.: Connect6. ICGA Journal 28(4), 234–242 (2006)Google Scholar