A nd game (or nk game) is a generalization of the combinatorial game tic-tac-toe to higher dimensions.[1][2][3] It is a game played on a nd hypercube with 2 players.[1][2][4][5] If one player creates a line of length n of their symbol (X or O) they win the game. However, if all nd spaces are filled then the game is a draw.[4] Tic-tac-toe is the game where n equals 3 and d equals 2 (3, 2).[4] Qubic is the (4, 3) game.[4] The (n > 0, 0) or (1, 1) games are trivially won by the first player as there is only one space (n0 = 1 and 11 = 1). A game with d = 1 and n > 1 cannot be won if both players are playing well as an opponent's piece will block the one-dimensional line.[5]
Game theory
editAn nd game is a symmetric combinatorial game.
There are a total of winning lines in a nd game.[2][6]
For any width n, at some dimension d (thanks to the Hales-Jewett theorem), there will always be a winning strategy for player X. There will never be a winning strategy for player O because of the Strategy-stealing argument since an nd game is symmetric.
See also
edit- Treblecross – Degenerate tic-tac toe variant
References
edit- ^ a b "Mathllaneous" (PDF). Retrieved 16 December 2016.
- ^ a b c Beck, József (20 March 2008). Combinatorial Games: Tic-Tac-Toe Theory. Cambridge University Press. ISBN 9780521461009.
- ^ Tichy, Robert F.; Schlickewei, Hans Peter; Schmidt, Klaus D. (10 July 2008). Diophantine Approximation: Festschrift for Wolfgang Schmidt. Springer. ISBN 9783211742808.
- ^ a b c d Golomb, Solomon; Hales, Alfred. "Hypercube Tic-Tac-Toe" (PDF). Archived from the original (PDF) on 29 April 2016. Retrieved 16 December 2016.
- ^ a b Shih, Davis. "A Scientific Study: k-dimensional Tic-Tac-Toe" (PDF). Retrieved 16 December 2016.
- ^ Epstein, Richard A. (28 December 2012). The Theory of Gambling and Statistical Logic. Academic Press. ISBN 9780123978707.
External links
edit- Higher-Dimensional Tic-Tac-Toe from the PBS Infinite Series on YouTube
 | This game-related article is a stub. You can help Wikipedia by expanding it. |