Abstract
This paper contains three contributions. First, it introduces a new family of k-in-a-row games, Connect(m,n,k,p,q). In Connect(m,n,k, p,q), two players alternately place p stones on an m ×n board in each turn, except for the start when the first player places q stones at her first move. The player who first obtains k consecutive stones of her own first wins. The traditional game five-in-a-row, also called Go-Moku, in the free style is Connect(15,15,5,1,1). For brevity, Connect(k,p,q) denotes the game Connect(∞,∞,k,p,q), played on infinite boards.
Second, this paper analyzes the characteristics of these games, especially for the fairness. In the analysis of fairness, we first exclude the ones which are apparently unfair or solved. Then, for the rest of games, we argue that p=2q is a necessary condition for fairness in the sense that one player always has q more stones than the other after making a move. Among these games, Connect(6,2,1) is most interesting to this paper and is named Connect6.
Third, this paper proposes a threat-based strategy to play Connect(k,p,q) games and implements a computer program for Connect6, based on the strategy. In addition, this paper also illustrates a new null-move search approach by solving Connect(6,2,3) where the first player wins. The result also hints that for Connect6 the second player usually should not place the initial two stones far away from the first stone played by the first player.
Keywords
- Board Size
- Winning Strategy
- Empirical Experiment
- Move Node
- Large Board
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Preview
Unable to display preview. Download preview PDF.
References
Allis, L.V.: Searching for Solutions in Games and Artificial Intelligence. Ph.D. Thesis, University of Limburg, Maastricht (1994)
Allis, L.V., van der Meulen, M., van den Herik, H.J.: Proof-Number Search. Artificial Intelligence 66(1), 91–124 (1994)
Allis, L.V., van den Herik, H.J., Huntjens, M.P.H.: Go-Moku Solved by New Search Techniques. Computational Intelligence 12, 7–23 (1996)
Avetisyan, H., Lorentz, R.: Selective Search in an Amazons Program. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 123–141. Springer, Heidelberg (2003)
Beal, D.F.: Experiments with the Null Move. In: Beal, D.F. (ed.) Advances in Computer Chess 5, pp. 65–79. Elsevier Science Publishers B.V., Amsterdam, The Netherlands (1989)
Beck, J.: On Positional Games. J. of Combinatorial Theory A–30, 117–133 (1981)
Csirmaz, L.: On a Combinatorial Game with an Application to Go-Moku. Discrete Math. 29, 19–23 (1980)
Cazenave, T.: Iterative Widening. In: Proceedings of IJCAI 2001, vol. 1, pp. 523–528 (2001)
Cazenave, T.: Abstract Proof Search. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 39–54. Springer, Berlin (2002)
Cazenave, T.: A Generalized Threats Search Algorithm. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 75–87. Springer, Heidelberg (2003)
van den Herik, H.J., Uiterwijk, J.W.H.M., van Rijswijck, J.: Games Solved: Now and in the Future. Artificial Intelligence 134, 277–311 (2002)
Internet Application Technology Lab. Connect6 Homepage. National Chiao Tung University (2005), http://connect6.csie.nctu.edu.tw
Japanese Professional Renju Association. History of Renju Rules (2003), http://www.renjusha.net/database/oldrule.htm
Pluhar, A.: Generalizations of the Game k-In-A-Row. Rutcor Res. Rep., 15–94 (1994)
Pluhar, A.: The Accelerated k-In-A-Row Game. Theoretical Computer Science 271(1–2), 865–875 (2002)
Renju International Federation. The International Rules of Renju (1998), http://www.renju.nu/rifrules.htm
Renju International Federation. MOM for the RIF General Assembly (2003), http://www.renju.nu/wc2003/MOM_RIF_030805.htm
Sakata, G., Ikawa, W.: Five-In-A-Row. Renju. Ishi Press, Tokyo, Japan (1981)
Thomsen, T.: Lambda-Search in Game Trees - with Application to Go. ICGA Journal 23(4), 203–217 (2000)
Uiterwijk, J.W.H.M., van den Herik, H.J.: The Advantage of the Initiative. Information Sciences 122(1), 43–58 (2000)
Wagner, J., Virag, I.: Solving Renju. ICGA Journal 24(1), 30–34 (2001)
Wu, I.-C., Chang, H.-C.: Threat-based proof search for Connect6. Technical report, Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan (2006), http://java.csie.nctu.edu.tw/~icwu/technical-reports/tr1-2006.pdf
Zetters, T.G.L.: Problem S.10 Proposed by R.K. Guy and J.L. Selfridge. Amer. Math. Monthly 86, 87, 575–576 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, IC., Huang, DY. (2006). A New Family of k-in-a-Row Games. In: van den Herik, H.J., Hsu, SC., Hsu, Ts., Donkers, H.H.L.M.(. (eds) Advances in Computer Games. ACG 2005. Lecture Notes in Computer Science, vol 4250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11922155_14
Download citation
DOI: https://doi.org/10.1007/11922155_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48887-3
Online ISBN: 978-3-540-48889-7
eBook Packages: Computer ScienceComputer Science (R0)