Kaplansky's game
Kaplansky's game or Kaplansky's n-in-a-line is an abstract board game in which two players take turns in placing a stone of their color on an infinite lattice board, the winner being the player who first gets k stones of their own color on a line which does not have any stones of the opposite color on it.[1][2][3][4] It is named after Irving Kaplansky.
General results
- k ≤ 3 is a first-player win.
- 4 ≤ k ≤ 7 is believed to be draw, but this remains unproven.
- k ≥ 8 is a draw: Every player can draw via a "pairing strategy" or other "draw strategy" of m,n,k-game.
gollark: Are people available then or did I pick a terrible time again?
gollark: 93lZZ (in 4 hours)ToD 15:55:20 (it might be a bit earlier, accurately checking is hard)Unfogging at 15:50:20ARing at 15:52:50 (2mins30 before ToD)If you are a silly 12-hour person, that's 3:50pm and onwards.This is all cave time.
gollark: What raffle?
gollark: That was anticlimactic.
gollark: I have another up in 2 days (non-siyat).
See also
- m,n,k-game
- Hex (board game)
- Harary's generalized tictactoe
References
- Beck, József (1982). "On a generalization of Kaplansky's game". Discrete Mathematics. 42 (1): 27–35. doi:10.1016/0012-365X(82)90050-4.
- Beck, József (2008). Combinatorial Games: Tic-Tac-Toe Theory. Cambridge University Press. p. 64. ISBN 9780521461009.
- Kleitman, D.J.; Rothschild, B.L. (1972). "A generalization of Kaplansky's game". Discrete Mathematics. 22 (2): 173–178. doi:10.1016/0012-365X(72)90082-9.
- András, Pluhár (2004). "The Recycled Kaplansky's Game". Acta Cybernetica. 16.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.