Back to Search Start Over

Bounded Greedy Nim.

Authors :
Xu, Rongxing
Zhu, Xuding
Source :
Theoretical Computer Science. Oct2018, Vol. 746, p1-5. 5p.
Publication Year :
2018

Abstract

Abstract This paper introduces a new variant of the game Nim–Bounded Greedy Nim. This game is a combination of Bounded Nim and Greedy Nim. We present a complete solution to this game, which generalizes the solution of Greedy Nim. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
03043975
Volume :
746
Database :
Academic Search Index
Journal :
Theoretical Computer Science
Publication Type :
Academic Journal
Accession number :
131658362
Full Text :
https://doi.org/10.1016/j.tcs.2018.06.015