A Cellular Automaton for Blocking Queen Games

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9099)

Abstract

We show that the winning positions of a certain type of two-player game form interesting patterns which often defy analysis, yet can be computed by a cellular automaton. The game, known as Blocking Wythoff Nim, consists of moving a queen as in chess, but always towards (0,0), and it may not be moved to any of \(k-1\) temporarily “blocked” positions specified on the previous turn by the other player. The game ends when a player wins by blocking all possible moves of the other player. The value of \(k\) is a parameter that defines the game, and the pattern of winning positions can be very sensitive to \(k\). As \(k\) becomes large, parts of the pattern of winning positions converge to recurring chaotic patterns that are independent of \(k\). The patterns for large \(k\) display an unprecedented amount of self-organization at many scales, and here we attempt to describe the self-organized structure that appears.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. CoLaNe.
    Cook, M., Larsson, U., Neary, T.: Generalized cyclic tag systems, with an application to the blocking queen game (in preparation)Google Scholar
  2. Fin12.
    Fink, A.: Lattice games without rational strategies. J. of Combin. Theory, Ser. A 119(2), 450–459 (2012)MATHMathSciNetCrossRefGoogle Scholar
  3. Fra73.
    Fraenkel, A.S.: Complementing and exactly covering sequences. J. of Combin. Theory, Ser. A 14(1), 8–20 (1973)MATHMathSciNetCrossRefGoogle Scholar
  4. Gur10.
    Gurvich, V.: Further generalizations of Wythoff’s game and minimum excludant function, RUTCOR Research Report, 16–2010, Rutgers UniversityGoogle Scholar
  5. GaSt04.
    Gavel, H., Strimling, P.: Nim with a modular Muller twist. Integers 4(G4) (2004)Google Scholar
  6. HeLa06.
    Hegarty, P., Larsson, U.: Permutations of the natural numbers with prescribed difference multisets. Integers 6, Paper A3 (2006)Google Scholar
  7. HoRe01.
    Holshouser, A., Reiter, H.: Problems and solutions: Problem 714 (Blocking Nim). The College Mathematics Journal 32(5), 382 (2001)Google Scholar
  8. HoRe.
    Holshouser, A., Reiter, H.: Three pile Nim with move blocking. http://citeseer.ist.psu.edu/470020.html
  9. Lan02.
    Landman, H.A.: A simple FSM-based proof of the additive periodicity of the Sprague-Grundy function of Wythoff’s game. In: Nowakowski, R.J. (Ed.) More Games of No Chance, vol. 42. MSRI Publications (Cambridge University Press), pp. 383–386 (2002)Google Scholar
  10. Lar09.
    Larsson, U.: 2-pile Nim with a restricted number of move-size imitations. Integers 9(G4), 671–690 (2009)MATHMathSciNetGoogle Scholar
  11. Lar11.
    Larsson, U.: Blocking Wythoff Nim. Electron. J. Combin. 18(1), P120 (2011)MathSciNetGoogle Scholar
  12. Lar13.
    Larsson, U.: Impartial games emulating one-dimensional cellular automata and undecidability. J. of Combin. Theory, Ser. A 120(5), 1116–1130 (2013)MATHMathSciNetCrossRefGoogle Scholar
  13. Lar15.
    Larsson, U.: Restrictions of \(m\)-Wythoff Nim and \(p\)-complementary Beatty sequences. In: Games of no Chance 4. MSRI Publications (Cambridge University Press)Google Scholar
  14. LaWa13.
    Larsson, U., Wästlund, J.: From heaps of matches to the limits of computability. Electron. J. Combin. 20(3), P41 (2013)Google Scholar
  15. SmSt02.
    Smith, F., Stănică, P.: Comply/constrain games or games with a Muller twist. Integers 2(G4) (2002)Google Scholar
  16. Wyt07.
    Wythoff, W.A.: A modification of the game of Nim. Nieuw Arch. Wisk. 7, 199–202 (1907)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2015

Authors and Affiliations

  1. 1.Institute of NeuroinformaticsUniversity of Zürich and ETH ZürichZürichSwitzerland
  2. 2.Department of Mathematics and StatisticsDalhousie UniversityHalifaxCanada

Personalised recommendations