Abstract
In this paper we present a combinatorial game-theoretic analysis of special Domineering positions. In particular we investigate complex positions that are aggregates of simpler fragments, linked via bridging squares.
We aim to extend two theorems that exploit the characteristic of an aggregate of two fragments having as game-theoretic value the sum of the values of the fragments. We investigate these theorems to deal with the case of multiple-connected networks with arbitrary number of fragments, possibly also including cycles.
As an application, we introduce an interesting, special Domineering position with value \(*2\). We dub this position the Snowflake. We then show how from this fragment larger chains of Snowflakes can be built with known values, including flat networks of Snowflakes (a kind of crystallization).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Albert, M.H., Nowakowski, R.J., Wolfe, D.: Lessons in Play: An Introduction to Combinatorial Game Theory. A K Peters, Wellesley (2007)
Breuker, D.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: Solving \(8\times 8\) Domineering. Theor. Comput. Sci. (Math Games) 230, 195–206 (2000)
Barton, M., Uiterwijk, J.W.H.M.: Combining combinatorial game theory with an \(\alpha \)-\(\beta \) solver for Domineering. In: Grootjen, F., Otworowska, M., Kwisthout, J. (eds.) BNAIC 2014: Proceedings of the 26th Benelux Conference on Artificial Intelligence, Radboud University, Nijmegen, pp. 9–16 (2014)
Berlekamp, E.R.: Blockbusting and Domineering. J. Combin. Theory (Ser. A) 49, 67–116 (1988)
Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for your Mathematical Plays. Academic Press, London (1982). 2nd edn. in four volumes: vol. 1 (2001), vols. 2, 3 (2003), vol. 4 (2004). A K Peters, Wellesley
Bullock, N.: Domineering: solving large combinatorial search spaces. ICGA J. 25, 67–84 (2002)
Conway, J.H.: On Numbers and Games. Academic Press, London (1976)
Drummond-Cole, G.C.: Positions of value *2 in generalized Domineering and chess. Integers Electr. J. Combin. Number Theory 5, #G6, 13 (2005)
Gardner, M.: Mathematical games. Sci. Am. 230, 106–108 (1974)
van den Herik, H.J., Uiterwijk, J.W.H.M., van Rijswijck, J.: Games solved: now and in the future. Artif. Intell. 134, 277–311 (2002)
Kim, Y.: New values in Domineering. Theor. Comput. Sci. (Math Games) 156, 263–280 (1996)
Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell. 6, 293–326 (1975)
Siegel, A.N.: Combinatorial game suite: a computer algebra system for research in combinatorial game theory. http://cgsuite.sourceforge.net/
Uiterwijk, J.W.H.M., Barton, M.: New results for Domineering from combinatorial game theory endgame databases. Theor. Comput. Sci. 592, 72–86 (2015)
Uiterwijk, J.W.H.M., van den Herik, H.J.: The advantage of the initiative. Inf. Sci. 122, 43–58 (2000)
Wolfe, D.: Snakes in Domineering games. Theor. Comput. Sci. (Math Games) 119, 323–329 (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Uiterwijk, J.W.H.M. (2015). Crystallization of Domineering Snowflakes. In: Plaat, A., van den Herik, J., Kosters, W. (eds) Advances in Computer Games. ACG 2015. Lecture Notes in Computer Science(), vol 9525. Springer, Cham. https://doi.org/10.1007/978-3-319-27992-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-27992-3_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27991-6
Online ISBN: 978-3-319-27992-3
eBook Packages: Computer ScienceComputer Science (R0)