%0 Conference Proceedings
%T A Cellular Automaton for Blocking Queen Games
%+ Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology  [Zürich] (ETH Zürich)
%+ Dalhousie University [Halifax]
%A Cook, Matthew
%A Larsson, Urban
%A Neary, Turlough
%Z Part 2: Regular Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Turku, Finland
%Y Jarkko Kari
%I Springer
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-9099
%P 71-84
%8 2015-06-08
%D 2015
%R 10.1007/978-3-662-47221-7_6
%Z Computer Science [cs]Conference papers
%X 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 <i>Blocking Wythoff Nim</i>, consists of moving a queen as in chess, but always towards (0,0), and it may not be moved to any of <strong><i>k−1</strong></i> 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 <strong><i>k</strong></i> is a parameter that defines the game, and the pattern of winning positions can be very sensitive to <strong><i>k</strong></i>. As <strong><i>k</strong></i> becomes large, parts of the pattern of winning positions converge to recurring chaotic patterns that are independent of <strong><i>k</strong></i>. The patterns for large <strong><i>k</strong></i> display an unprecedented amount of self-organization at many scales, and here we attempt to describe the self-organized structure that appears.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01442483/document
%2 https://inria.hal.science/hal-01442483/file/338243_1_En_6_Chapter.pdf
%L hal-01442483
%U https://inria.hal.science/hal-01442483
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9099
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA