{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:25Z","timestamp":1759638025386},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T00:00:00Z","timestamp":1519257600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The National Natural Science Fund","award":["KYZKJY11186","NSF11571319"],"award-info":[{"award-number":["KYZKJY11186","NSF11571319"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10878-018-0265-y","type":"journal-article","created":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T07:52:06Z","timestamp":1519285926000},"page":"1241-1249","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Greedy Nim $$_\\mathrm{{k}}$$ k Game"],"prefix":"10.1007","volume":"35","author":[{"given":"Xinzhong","family":"Lv","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongxing","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,22]]},"reference":[{"issue":"2","key":"265_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1600","volume":"8","author":"MH Albert","year":"2001","unstructured":"Albert MH, Nowakowski RJ (2001) The game of end-nim. Electron J Combin 8(2):1","journal-title":"Electron J Combin"},{"key":"265_CR2","first-page":"G01","volume":"4","author":"MH Albert","year":"2004","unstructured":"Albert MH, Nowakowski RJ (2004) Nim restrictions. Integers Electron J Comb Number Theory 4:G01","journal-title":"Integers Electron J Comb Number Theory"},{"issue":"2","key":"265_CR3","first-page":"35","volume":"3","author":"CL Bouton","year":"1902","unstructured":"Bouton CL (1902) Nim, a game with a complete mathematical theory. Ann Math 3(2):35\u201339","journal-title":"Ann Math"},{"key":"265_CR4","doi-asserted-by":"publisher","first-page":"354","DOI":"10.2307\/3612461","volume":"53","author":"AJ Cole","year":"1969","unstructured":"Cole AJ, Davie AJ (1969) A game based on the Euclidean algorithm and a winning strategy for it. Math Gaz 53:354\u2013357","journal-title":"Math Gaz"},{"key":"265_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0304-3975(03)00292-5","volume":"304","author":"M Fukuyama","year":"2003","unstructured":"Fukuyama M (2003) A Nim game played on graphs. Theor Comput Sci 304:387\u2013399","journal-title":"Theor Comput Sci"},{"key":"265_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01763118","volume":"7","author":"S-YR Li","year":"1978","unstructured":"Li S-YR (1978) N-person Nim and N-person Moore\u2019s games. Int J Game Theory 7:31\u201336","journal-title":"Int J Game Theory"},{"key":"265_CR7","first-page":"G02","volume":"5","author":"C-W Lim","year":"2005","unstructured":"Lim C-W (2005) Partial Nim. Integers Electron J Comb Number Theory 5:G02","journal-title":"Integers Electron J Comb Number Theory"},{"key":"265_CR8","first-page":"G2","volume":"15","author":"RM Low","year":"2015","unstructured":"Low RM, Chan WH (2015) An Atlas of N- and P-positions in \u2018nim with a pass\u2019. Integers 15:G2","journal-title":"Integers"},{"key":"265_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.2307\/1967321","volume":"11","author":"EH Moore","year":"1910","unstructured":"Moore EH (1910) A generalization of a game called nim. Ann Math 11:93\u201394","journal-title":"Ann Math"},{"issue":"5","key":"265_CR10","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1080\/0025570X.1971.11976162","volume":"44","author":"BL Schwartz","year":"1971","unstructured":"Schwartz BL (1971) Some extensions of nim. Math Mag 44(5):252\u2013257","journal-title":"Math Mag"},{"key":"265_CR11","first-page":"199","volume":"7","author":"W Wythoff","year":"1907","unstructured":"Wythoff W (1907) A modification of the game of Nim. Nieuw Arch Wisk 7:199\u2013202","journal-title":"Nieuw Arch Wisk"},{"key":"265_CR12","doi-asserted-by":"crossref","unstructured":"Xu R, Zhu X (2018) Bounded greedy nim game. Theor Comput Sci (to appear)","DOI":"10.1016\/j.tcs.2018.06.015"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0265-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0265-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0265-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T12:35:18Z","timestamp":1603888518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0265-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,22]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["265"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0265-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,22]]},"assertion":[{"value":"22 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}