Greedy Nim $$_\mathrm{{k}}$$ k Game

Xinzhong Lv (), Rongxing Xu () and Xuding Zhu ()
Additional contact information
Xinzhong Lv: Zhejiang Normal University
Rongxing Xu: Zhejiang Normal University
Xuding Zhu: Zhejiang Normal University

Journal of Combinatorial Optimization, 2018, vol. 35, issue 4, No 12, 1249 pages

Abstract: Abstract This paper introduces a new variant of Nim game, the Greedy Nim $$_\mathrm{{k}}$$ k Game. We present a complete solution for this game.

Keywords: Nim game; Greedy Nim game; Greedy Nim $$_\mathrm{k}$$ k game (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0265-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:35:y:2018:i:4:d:10.1007_s10878-018-0265-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0265-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().