A cellular automaton for blocking queen games

DOI10.1007/S11047-016-9581-2zbMath1530.91106MaRDI QIDQ6191204

Urban Larsson, Matthew Cook, Turlough Neary

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/191144

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Combinatorial games (91A46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Impartial games emulating one-dimensional cellular automata and undecidability
• From heaps of matches to the limits of computability
• Blocking Wythoff Nim
• Lattice games without rational strategies
• An Algebraic Geometric Approach to Multidimensional Words
• Restrictions of $m$-Wythoff Nim and $p$-complementary Beatty Sequences
• 2-Pile Nim with a Restricted Number of Move-Size Imitations
• A Cellular Automaton for Blocking Queen Games
• Formal Reductions of the General Combinatorial Decision Problem

Related Items (2)

A Pedagogical Example: A Family of Stochastic Cellular Automata that Plays Alesia ⋮ Subtraction games in more than one dimension

This page was built for publication: A cellular automaton for blocking queen games