Bounded greedy Nim

DOI10.1016/J.TCS.2018.06.015MaRDI QIDQ1784736zbMATH OpenOpenAlexWikidataFDO

Authors Rongxing Xu, Xuding Zhu

Publication date 27 September 2018

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2018.06.015

zbMATH Keywords

bounded Nimgreedy NimNimP-position

Mathematics Subject Classification ID

Combinatorial games (91A46)

Recommendations

• scientific article; zbMATH DE number 2214423
• A Nim game played on graphs.
• scientific article; zbMATH DE number 5242355
• How far can nim in disguise be stretched?
• On Kotzig's Nim

Cites work

• \(N\)-person Nim and \(N\)-person Moore's games
• A Nim game played on graphs. II.
• Greedy Nim\(\mathrm{_k}\) game
• scientific article; zbMATH DE number 2124097 (Why is no real title available?)
• scientific article; zbMATH DE number 6456850 (Why is no real title available?)
• scientific article; zbMATH DE number 2214423 (Why is no real title available?)
• Some Extensions of NIM
• The game of End-Nim

Cited in

(1)

• Greedy Nim\(\mathrm{_k}\) game

This page was built for publication: Bounded greedy Nim

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784736)