{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:14:02Z","timestamp":1749615242633,"version":"3.41.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,10,3]],"date-time":"2016-10-03T00:00:00Z","timestamp":1475452800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung (CH)","doi-asserted-by":"publisher","award":["200021_153295"],"award-info":[{"award-number":["200021_153295"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s11047-016-9581-2","type":"journal-article","created":{"date-parts":[[2016,10,3]],"date-time":"2016-10-03T06:51:59Z","timestamp":1475477519000},"page":"397-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A cellular automaton for blocking queen games"],"prefix":"10.1007","volume":"16","author":[{"given":"Matthew","family":"Cook","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Urban","family":"Larsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Turlough","family":"Neary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,3]]},"reference":[{"issue":"1","key":"9581_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.25088\/ComplexSystems.15.1.1","volume":"15","author":"M Cook","year":"2004","unstructured":"Cook M (2004) Universality in elementary cellular automata. Complex Syst 15(1):1\u201340","journal-title":"Complex Syst"},{"key":"9581_CR2","doi-asserted-by":"crossref","unstructured":"Cook M, Larsson U, Neary T (2015) A cellular automaton for blocking queen games. In: Kari J (ed) Cellular automata and discrete complex systems, AUTOMATA 2015, Lecture Notes in Computer Science, vol 9099, pp 71\u201384","DOI":"10.1007\/978-3-662-47221-7_6"},{"key":"9581_CR3","unstructured":"Cook M, Larsson U, Neary T (NA) Generalized cyclic tag systems, with an application to the blocking queen game. In preparation"},{"issue":"2","key":"9581_CR4","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1016\/j.jcta.2011.10.005","volume":"119","author":"A Fink","year":"2012","unstructured":"Fink A (2012) Lattice games without rational strategies. J Comb Theory A 119(2):450\u2013459","journal-title":"J Comb Theory A"},{"key":"9581_CR5","unstructured":"Gavel H, Strimling P (2004) Nim with a modular Muller twist. Integers 4(G4)"},{"key":"9581_CR6","unstructured":"Gurvich V (2010) Further generalizations of Wythoff\u2019s game and minimum excludant function. Tech. Rep. RUTCOR Research Report, 16-2010, Rutgers University"},{"key":"9581_CR7","unstructured":"Hegarty P, Larsson U (2006) Permutations of the natural numbers with prescribed difference multisets. Integers 6(A3)"},{"issue":"5","key":"9581_CR8","first-page":"382","volume":"32","author":"A Holshouser","year":"2001","unstructured":"Holshouser A, Reiter H (2001) Problems and solutions: problem 714 (Blocking Nim). Coll Math J 32(5):382","journal-title":"Coll Math J"},{"key":"9581_CR9","unstructured":"Holshouser A, Reiter H (NA) Three pile Nim with move blocking. http:\/\/citeseer.ist.psu.edu\/470020.html"},{"key":"9581_CR10","doi-asserted-by":"crossref","unstructured":"Kari J, Szabados M (2015) An algebraic geometric approach to multidimensional words. In: Maletti A (ed) Algebraic Informatics, CAI 2015, Lecture Notes in Computer Science, vol 9270, pp 29\u201342","DOI":"10.1007\/978-3-319-23021-4_3"},{"issue":"6","key":"9581_CR11","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1515\/INTEG.2009.053","volume":"9","author":"U Larsson","year":"2009","unstructured":"Larsson U (2009) 2-pile Nim with a restricted number of move-size imitations. Integers 9(6):671\u2013690","journal-title":"Integers"},{"key":"9581_CR12","doi-asserted-by":"crossref","unstructured":"Larsson U (2011) Blocking Wythoff Nim. Electron J Comb 18, paper p120","DOI":"10.37236\/607"},{"key":"9581_CR13","doi-asserted-by":"crossref","unstructured":"Larsson U (2012) A generalized diagonal Wythoff Nim. Integers 12(G2)","DOI":"10.1515\/integers-2012-0020"},{"key":"9581_CR14","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1016\/j.jcta.2013.02.009","volume":"120","author":"U Larsson","year":"2013","unstructured":"Larsson U (2013) Impartial games emulating one-dimensional cellular automata and undecidability. J Comb Theory A 120:1116\u20131130","journal-title":"J Comb Theory A"},{"key":"9581_CR15","doi-asserted-by":"crossref","unstructured":"Larsson U (2015) Restrictions of m-Wythoff Nim and p-complementary beatty sequences. In: Nowakowski RJ (ed) More games of no chance 4, Proceedings BIRS Workshop on combinatorial Games, 2008, Cambridge University Press, MSRI Publications, vol\u00a063, pp 137\u2013160","DOI":"10.1017\/9780511820809.012"},{"key":"9581_CR16","doi-asserted-by":"crossref","unstructured":"Larsson U, W\u00e4stlund J (2013) From heaps of matches to the limits of computability. Electron J Comb 20, paper p41","DOI":"10.37236\/2244"},{"issue":"2","key":"9581_CR17","doi-asserted-by":"crossref","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"EL Post","year":"1943","unstructured":"Post EL (1943) Formal reductions of the general combinatorial decision problem. Am J Math 65(2):197\u2013215","journal-title":"Am J Math"},{"key":"9581_CR18","unstructured":"Smith F, St\u0103nic\u0103 P (2002) Comply\/constrain games or games with a Muller twist. Integers 2(G4)"},{"key":"9581_CR19","first-page":"199","volume":"7","author":"WA Wythoff","year":"1907","unstructured":"Wythoff WA (1907) A modification of the game of Nim. Nieuw Arch Voor WisKd 7:199\u2013202","journal-title":"Nieuw Arch Voor WisKd"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-016-9581-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9581-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9581-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T22:22:43Z","timestamp":1749594163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-016-9581-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,3]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["9581"],"URL":"https:\/\/doi.org\/10.1007\/s11047-016-9581-2","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2016,10,3]]}}}